English
Related papers

Related papers: On Sampling and Greedy MAP Inference of Constraine…

200 papers

A determinantal point process (DPP) is a random process useful for modeling the combinatorial problem of subset selection. In particular, DPPs encourage a random subset Y to contain a diverse set of items selected from a base set Y. For…

Machine Learning · Computer Science 2012-10-19 Raja Hafiz Affandi , Alex Kulesza , Emily B. Fox

Determinantal point processes (DPPs) have become a significant tool for recommendation systems, feature selection, or summary extraction, harnessing the intrinsic ability of these probabilistic models to facilitate sample diversity. The…

Machine Learning · Statistics 2020-07-09 Rémi Bardenet , Subhroshekhar Ghosh

Deep learning has yielded extraordinary results in vision and natural language processing, but this achievement comes at a cost. Most models require enormous resources during training, both in terms of computation and in human labeling…

Computer Vision and Pattern Recognition · Computer Science 2021-10-11 Srikumar Ramalingam , Daniel Glasner , Kaushal Patel , Raviteja Vemulapalli , Sadeep Jayasumana , Sanjiv Kumar

Randomized Numerical Linear Algebra (RandNLA) uses randomness to develop improved algorithms for matrix problems that arise in scientific computing, data science, machine learning, etc. Determinantal Point Processes (DPPs), a seemingly…

Data Structures and Algorithms · Computer Science 2020-05-08 Michał Dereziński , Michael W. Mahoney

We study the following problem: Given a variable of interest, we would like to find a best linear predictor for it by choosing a subset of $k$ relevant variables obeying a matroid constraint. This problem is a natural generalization of…

Data Structures and Algorithms · Computer Science 2023-01-19 Theophile Thiery , Justin Ward

Determinantal Point Process (DPPs) are statistical models for repulsive point patterns. Both sampling and inference are tractable for DPPs, a rare feature among models with negative dependence that explains their popularity in machine…

Machine Learning · Computer Science 2021-11-30 Michaël Fanuel , Rémi Bardenet

Determinant maximization problem gives a general framework that models problems arising in as diverse fields as statistics \cite{pukelsheim2006optimal}, convex geometry \cite{Khachiyan1996}, fair allocations\linebreak \cite{anari2016nash},…

Data Structures and Algorithms · Computer Science 2022-07-12 Adam Brown , Aditi Laddha , Madhusudhan Pittu , Mohit Singh , Prasad Tetali

Determinantal point processes (DPPs) have emerged as a kernelized alternative to vanilla independent sampling for generating efficient minibatches, coresets and other parsimonious representations of large-scale datasets. While theoretical…

Machine Learning · Statistics 2026-05-14 Hoang-Son Tran , Pranav Gupta , Rémi Bardenet , Subhroshekhar Ghosh

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…

Machine Learning · Statistics 2014-02-21 Raja Hafiz Affandi , Emily B. Fox , Ryan P. Adams , Ben Taskar

Determinantal point processes (DPPs) are distributions over sets of items that model diversity using kernels. Their applications in machine learning include summary extraction and recommendation systems. Yet, the cost of sampling from a DPP…

Machine Learning · Statistics 2022-03-22 Guillaume Gautier , Rémi Bardenet , Michal Valko

Determinantal point processes (DPPs) are an elegant model for encoding probabilities over subsets, such as shopping baskets, of a ground set, such as an item catalog. They are useful for a number of machine learning tasks, including product…

Machine Learning · Statistics 2016-08-17 Mike Gartrell , Ulrich Paquet , Noam Koenigstein

We investigate the limiting behavior of discrete determinantal point processes (DPPs) towards continuous DPPs when the size of the set to sample from goes to infinity. We propose a non-asymptotic characterization of this limit in terms of…

Probability · Mathematics 2026-03-03 Hugo Jaquard , Nicolas Keriven

We study the problem of parallelizing sampling from distributions related to determinants: symmetric, nonsymmetric, and partition-constrained determinantal point processes, as well as planar perfect matchings. For these distributions, the…

Data Structures and Algorithms · Computer Science 2023-05-01 Nima Anari , Callum Burgess , Kevin Tian , Thuy-Duong Vuong

By using the framework of Determinantal Point Processes (DPPs), some theoretical results concerning the interplay between diversity and regularization can be obtained. In this paper we show that sampling subsets with kDPPs results in…

Machine Learning · Computer Science 2021-07-22 Joachim Schreurs , Michaël Fanuel , Johan A. K. Suykens

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…

Machine Learning · Statistics 2019-05-10 Jesse Dodge , Kevin Jamieson , Noah A. Smith

Symmetric determinantal point processes (DPP's) are a class of probabilistic models that encode the random selection of items that exhibit a repulsive behavior. They have attracted a lot of attention in machine learning, when returning…

Statistics Theory · Mathematics 2018-11-02 Victor-Emmanuel Brunel

Submodular maximization arises in many applications, and has attracted a lot of research attentions from various areas such as artificial intelligence, finance and operations research. Previous studies mainly consider only one kind of…

Data Structures and Algorithms · Computer Science 2023-07-20 Yu-Ran Gu , Chao Bian , Chao Qian

Determinantal point processes (DPPs) are popular probabilistic models of diversity. In this paper, we investigate DPPs from a new perspective: property testing of distributions. Given sample access to an unknown distribution $q$ over the…

Machine Learning · Computer Science 2020-08-11 Khashayar Gatmiry , Maryam Aliakbarpour , Stefanie Jegelka

The Nystr\"om method has long been popular for scaling up kernel methods. Its theoretical guarantees and empirical performance rely critically on the quality of the landmarks selected. We study landmark selection for Nystr\"om using…

Machine Learning · Computer Science 2016-05-31 Chengtao Li , Stefanie Jegelka , Suvrit Sra

Autonomous navigation in intelligent mobile systems represents a core research focus within artificial intelligence-driven robotics. Contemporary path planning approaches face constraints in dynamic environmental responsiveness and…

Robotics · Computer Science 2025-03-11 Junzhe Wang