pith. sign in

arxiv: 1207.6083 · v4 · pith:PTJOGIU6new · submitted 2012-07-25 · 📊 stat.ML · cs.IR· cs.LG

Determinantal point processes for machine learning

classification 📊 stat.ML cs.IRcs.LG
keywords dppsalgorithmsbuildingdeterminantaldiverselearninglikemachine
0
0 comments X
read the original abstract

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 efficient and exact algorithms for sampling, marginalization, conditioning, and other inference tasks. We provide a gentle introduction to DPPs, focusing on the intuitions, algorithms, and extensions that are most relevant to the machine learning community, and show how DPPs can be applied to real-world applications like finding diverse sets of high-quality search results, building informative summaries by selecting diverse sentences from documents, modeling non-overlapping human poses in images or video, and automatically building timelines of important news stories.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SAVER: Selective As-Needed Vision Evidence for Multimodal Information Extraction

    cs.CV 2026-05 unverdicted novelty 6.0

    SAVER proposes a conformal groundability gate plus submodular image selector that activates vision only when needed for multimodal named entity recognition and relation extraction, improving F1 while lowering compute.

  2. On two ways to use determinantal point processes for Monte Carlo integration

    cs.LG 2026-04 unverdicted novelty 5.0

    Generalizing two DPP-based Monte Carlo estimators to continuous domains provides variance rates of O(N^{-(1+1/d)}) for a fixed DPP method and O(1/N) for a tailored DPP method, along with new sampling algorithms.