Determinantal point process have recently been used as models in machine learning and this has raised questions regarding the characterizations of conditional independence. In this paper we investigate characterizations of conditional independence. We describe some conditional independencies through the conditions on t…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “determinantal processes”
This paper improves signal reconstruction using determinantal sampling from random nodes.
problem Approximating square-integrable functions from random node evaluations.
method Combines determinantal point processes and mixtures thereof for RKHS-adapted approximations.
result Proves mean-square guarantees in norm and shows faster convergence rates.
In this note we consider sampling from (non-homogeneous) strongly Rayleigh probability measures. As an important corollary, we obtain a fast mixing Markov Chain sampler for Determinantal Point Processes.
Paper proposes a simple estimator for DPP correlation kernels.
problem Estimating the correlation kernel matrix of DPPs.
method Closed-form estimator for correlation kernel, easy to implement.
result Consistency and asymptotic normality of the estimator proved.
Paper explores duality in DPPs using embedding structure analysis.
problem Understanding the geometric structure of determinantal point processes.
method Analyzes the exponential family embedding of DPPs and uses the e-embedding curvature tensor.
result Discovers the duality between marginal and L-ensemble kernels.
Given a fixed matrix , where , we study the complexity of sampling from a distribution over all subsets of rows where the probability of a subset is proportional to the squared volume of the parallelepiped spanned by the rows (a.k.a. a determinantal point process). In this task, it is im…
The study examines determinantal point processes linked to a specific operator on Riemannian manifolds.
problem Understanding the spectral properties and associated point processes of the Bochner-Schrödinger operator.
method Analysis of the Bochner-Schrödinger operator on tensor powers of Hermitian line bundles, focusing on large asymptotics.
result The asymptotic behavior of determinantal point processes associated with the operator's spectral projection is computed, leading to the law of large numbers and central limit theorem.
The study computes Bergman kernels and point process asymptotics on Kähler manifolds.
problem Computing asymptotics of Bergman kernels and point process distributions on Kähler manifolds.
method Equivariant and partial Bergman kernels, determinantal point processes, asymptotic analysis.
result The distribution of linear statistics converges to a centered normal variable with specific variances.
The paper studies partition functions of point processes on Kähler manifolds, generalizing geometric functionals and relating to QHE.
problem Analyzing partition functions of determinantal point processes on Kähler manifolds.
method Using geometric functionals and TYZ expansion coefficients of the Bergman kernel.
result The coefficients of the partition function expansion are geometric functionals on Kähler metrics.
This research uses DPPs to improve semi-parametric regression models.
problem Improving comprehensibility in semi-parametric regression models without sacrificing accuracy.
method Introduced a novel representation of finite DPPs and used it to derive a key identity illustrating implicit regularization.
result Demonstrated the implicit regularization effect of determinantal sampling for semi-parametric regression.
New algorithms for online MAP inference and learning for NDPPs.
problem Online inference and learning for nonsymmetric determinantal point processes.
method Single-pass algorithms with sub-linear memory usage.
result Comparable performance to offline algorithms with multiple passes.
The paper develops efficient algorithms for sampling from random spanning trees and determinantal point processes.
problem Sampling from strongly Rayleigh distributions efficiently.
method Optimal sublinear sampling algorithms for random spanning trees and determinantal point processes.
result Achieves optimal sublinear sampling for strongly Rayleigh distributions.
Determinantal consensus clustering improves clustering robustness.
problem Robustness of clustering algorithms.
method Use of determinantal point processes (DPP) for random restart of clustering algorithms.
result Determinantal consensus clustering outperforms classical algorithms.
This work improves sampling efficiency on complex spaces using determinantal processes.
problem Efficient sampling from large-scale datasets with general spaces.
method Determinantal point processes on general spaces and diffusion geometry.
result Improved sampling rates for determinantal processes on Riemannian manifolds and networks.
We study the complexity of sampling from a distribution over all index subsets of the set with the probability of a subset proportional to the determinant of the submatrix of some p.s.d. matrix , where corresponds to the entries of ind…
DPP-BBO diversifies batched Bayesian optimization using DPPs.
problem Efficiently proposing diverse and informative batches in batched Bayesian optimization.
method Introducing DPP-Batch Bayesian Optimization (DPP-BBO) with DPP-Thompson Sampling (DPP-TS).
result Novel Bayesian simple regret bounds for DPP-TS show improved performance over classical methods.
New algorithm scales NDPP learning and inference to large item collections.
problem Memory and runtime limitations in existing NDPP learning and inference algorithms.
method Introduced a new NDPP kernel decomposition for learning and a linear-complexity MAP inference algorithm.
result Our algorithms scale linearly in , matching prior work's predictive performance.
Determinantal point processes (DPPs) are probabilistic models for repulsion. When used to represent the occurrence of random subsets of a finite base set, DPPs allow to model global negative associations in a mathematically elegant and direct way. Discrete DPPs have become popular and computationally tractable models f…
Study the limits of discrete DPPs to continuous DPPs as set size grows.
problem Characterize the behavior of discrete DPPs as they approach continuous DPPs.
method Non-asymptotic characterization of the limit in terms of weak coherency.
result Sufficient conditions for weak coherency are identified.
We propose a new class of determinantal point processes (DPPs) which can be manipulated for inference and parameter learning in potentially sublinear time in the number of items. This class, based on a specific low-rank factorization of the marginal kernel, is particularly suited to a subclass of continuous DPPs and DP…
Paper explores how DPP sampling can implicitly regularize kernel regression.
problem Improving kernel regression by reducing redundancy in data.
method Using Determinantal Point Processes (DPPs) to sample subsets implicitly regularizes ridgeless Kernel Regression.
result Ensemble of ridgeless regressors can be effective for datasets with redundant information.
Study characteristic classes of a specific type of determinantal varieties.
problem Understanding the geometric properties of a special class of determinantal varieties.
method Used Schubert calculus to derive explicit formulas for Chern-Schwartz-MacPherson and Chern-Mather classes.
result Explicit formulas for sectional Euler characteristics, characteristic cycles, and polar classes were obtained.
Determinantal point processes (DPPs) are well-suited for modeling repulsion and have proven useful in many applications where diversity is desired. While DPPs have many appealing properties, such as efficient sampling, learning the parameters of a DPP is still considered a difficult problem due to the non-convex nature…
Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that arise in quantum physics and random matrix theory. In contrast to traditional structured models like Markov random fields, which become intractable and hard to approximate in the presence of negative correlations, DPPs offer efficie…
Determinantal point processes (DPPs) are random point processes well-suited for modeling repulsion. In machine learning, the focus of DPP-based models has been on diverse subset selection from a discrete and finite base set. This discrete setting admits an efficient sampling algorithm based on the eigendecomposition of…
Determinantal point processes based on orthogonal polynomials for sampling minibatches in SGDstat.ML
This work improves SGD minibatch sampling using determinantal point processes based on orthogonal polynomials.
problem Improving variance reduction in stochastic gradient descent (SGD) for large datasets.
method Orthogonal polynomial-based determinantal point processes for sampling minibatches in SGD.
result DPP minibatches lead to a smaller mean square approximation error than uniform minibatches.
We present a new random sampling strategy for k-bandlimited signals defined on graphs, based on determinantal point processes (DPP). For small graphs, ie, in cases where the spectrum of the graph is accessible, we exhibit a DPP sampling scheme that enables perfect recovery of bandlimited signals. For large graphs, ie, …
Paper tests DPPs for diversity models, distinguishing them from other distributions.
problem Testing whether a given distribution is a Determinantal Point Process (DPP) or far from any DPP.
method Proposes the first algorithm for DPP testing and establishes a lower bound on sample complexity.
result Establishes a matching lower bound on the sample complexity of DPP testing.
Determinantal Point Processes (DPPs) are probabilistic models over all subsets a ground set of items. They have recently gained prominence in several applications that rely on "diverse" subsets. However, their applicability to large problems is still limited due to the complexity of core tasks suc…
Structured Monte Carlo Sampling for Nonisotropic Distributions via Determinantal Point Processescs.LG
We propose a new class of structured methods for Monte Carlo (MC) sampling, called DPPMC, designed for high-dimensional nonisotropic distributions where samples are correlated to reduce the variance of the estimator via determinantal point processes. We successfully apply DPPMCs to problems involving nonisotropic distr…
Optimizes balanced treatment assignment for experiments.
problem Balancing treatment groups in experiments for optimal results.
method Optimization of a two-sample test, using minimum spanning tree test.
result Optimal assignment algorithm with polynomial time complexity.
We study the Euler obstruction of essentially isolated determinantal singularities (EIDS). The EIDS were defined by W. Ebeling and S. Gusein-Zade, as a generalization of isolated singularity. We obtain some formulas to calculate the Euler obstruction for the determinantal varieties with singular set an ICIS.
Determinantal point processes (DPPs) have received significant attention in the recent years as an elegant model for a variety of machine learning tasks, due to their ability to elegantly model set diversity and item quality or popularity. Recent work has shown that DPPs can be effective models for product recommendati…
Study Euler obstruction of 1-forms on determinantal singularities.
problem Understanding the Euler obstruction of 1-forms on determinantal singularities.
method Investigation of connections between local Euler obstruction and PHN index.
result Explicit computations of Euler obstruction for specific singularities.
Quantum machine learning boosts financial forecasting accuracy.
problem Churn prediction and credit risk assessment in finance.
method Used quantum and classical Determinantal Point Processes for churn prediction, and quantum neural networks for credit risk assessment.
result Significant improvement in precision for churn prediction (6% increase). Quantum models match classical performance with fewer parameters.
New scalable MCMC sampling for nonsymmetric DPPs speeds up computations.
problem Efficient sampling for nonsymmetric DPPs with low-rank kernels.
method Enhanced rejection sampling with efficient proposal distribution construction.
result Sublinear runtime for scalable MCMC sampling of -NDPPs.
Determinantal point processes (DPPs) enable the modeling of repulsion: they provide diverse sets of points. The repulsion is encoded in a kernel that can be seen as a matrix storing the similarity between points. The diversity comes from the fact that the inclusion probability of a subset is equal to the determinan…
Determinantal point processes (DPPs) offer a powerful approach to modeling diversity in many applications where the goal is to select a diverse subset. We study the problem of learning the parameters (the kernel matrix) of a DPP from labeled training data. We make two contributions. First, we show how to reparameterize…
Minimal cones defined by rank conditions in matrix spaces.
problem Characterizing minimal cones in matrix spaces.
method Proving determinantal varieties are minimal cones with regular strata.
result Determinantal varieties are minimal cones with regular submanifolds.
We study a mini-batch diversification scheme for stochastic gradient descent (SGD). While classical SGD relies on uniformly sampling data points to form a mini-batch, we propose a non-uniform sampling scheme based on the Determinantal Point Process (DPP). The DPP relies on a similarity measure between data points and g…
Adaptive sampling for risk-averse learning on hard examples.
problem Training models to perform well on difficult examples in high-stakes applications.
method Adaptive sampling algorithm for stochastically optimizing CVaR, using distributionally robust formulation and regret minimization.
result Empirically demonstrates effectiveness on large-scale convex and non-convex learning tasks.
Driven by the need for parallelizable hyperparameter optimization methods, this paper studies \emph{open loop} search methods: sequences that are predetermined and can be generated before a single configuration is evaluated. Examples include grid search, uniform random search, low discrepancy sequences, and other sampl…
Bayesian optimization method for permutations accelerates combinatorial search.
problem Optimizing expensive-to-evaluate objectives on permutation problems.
method LAW2ORDER, a batch Bayesian optimization method based on the acquisition weighted kernel.
result LAW2ORDER achieves sublinear batch cumulative regret, demonstrating accelerated search.
We propose a novel diverse feature selection method based on determinantal point processes (DPPs). Our model enables one to flexibly define diversity based on the covariance of features (similar to orthogonal matching pursuit) or alternatively based on side information. We introduce our approach in the context of Bayes…
The Poincaré-Hopf theorem is extended to projective varieties with isolated singularities.
problem Extending the Poincaré-Hopf theorem to projective varieties with isolated singularities.
method Using generalized Poincaré-Hopf indices for a projective variety with isolated determinantal singularities.
result A Poincaré-Hopf type theorem is proven for projective varieties with isolated singularities.
Improved uncertainty estimation through diverse sampling in neural networks.
problem Enhancing uncertainty estimation for machine learning models.
method Data-driven correlations and determinantal point processes-based sampling for dropout layers.
result State-of-the-art results in uncertainty estimation for regression and classification tasks.
Determinantal Point Processes (DPPs) provide an elegant and versatile way to sample sets of items that balance the point-wise quality with the set-wise diversity of selected items. For this reason, they have gained prominence in many machine learning applications that rely on subset selection. However, sampling from a …
In this technical report, we discuss several sampling algorithms for Determinantal Point Processes (DPP). DPPs have recently gained a broad interest in the machine learning and statistics literature as random point processes with negative correlation, i.e., ones that can generate a "diverse" sample from a set of items.…