The DOI matches its Crossref record; 108 of the 108 references it cites were found in a registry or an index.
Determinantal Point Processes for Machine Learning
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. While they have been studied extensively by mathematicians, giving rise to a deep and beautiful theory, DPPs are relatively new in machine learning. Determinantal Point Processes for Machine Learning provides a comprehensible introduction to DPPs, focusing on the intuitions, algorithms, and extensions that are most relevant to the machine learning community, and shows 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. It presents the general mathematical background to DPPs along with a range of modeling extensions, efficient algorithms, and theoretical results that aim to enable practical modeling and learning.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Object recognition from local scale-invariant features
Lowe, D. G. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790410 · Cited by 16,472
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
(2004) · Cited by 9,718
(2009) · Cited by 6,153
An analysis of approximations for maximizing submodular set functions—I
Nemhauser, G. L., Wolsey, L. A., & Fisher, M. L. (1978) · Mathematical Programming · doi:10.1007/bf01588971 · Cited by 4,412
Lauritzen, S. L., & Spiegelhalter, D. J. (1988) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1988.tb01721.x · Cited by 3,902
An Introduction to the Theory of Point Processes
Daley, D. J., & Vere-Jones, D. (2008) · Probability and Its Applications · doi:10.1007/978-0-387-49835-5 · Cited by 3,351
What energy functions can be minimized via graph cuts?
Kolmogorov, V., & Zabih, R. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262177 · Cited by 3,127
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
On the distribution of points in a cube and the approximate evaluation of integrals
Sobol', I. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90144-9 · Cited by 2,975
Updating quasi-Newton matrices with limited storage
Nocedal, J. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0572855-7 · Cited by 2,958
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Vlfeat: an open and portable library of computer vision algorithms
Vedaldi, A., & Fulkerson, B. (2010) · Proceedings of the 18th ACM international conference on Multimedia · doi:10.1145/1873951.1874249 · Cited by 2,664
Extensions of Lipschitz mappings into a Hilbert space
Johnson, W. B., & Lindenstrauss, J. (1984) · Contemporary Mathematics · doi:10.1090/conm/026/737400 · Cited by 2,523
Blei, D. M., & Lafferty, J. D. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143859 · Cited by 2,386
Statistical Theory of the Energy Levels of Complex Systems. I
Dyson, F. J. (1962) · Journal of Mathematical Physics · doi:10.1063/1.1703773 · Cited by 2,266
Pictorial Structures for Object Recognition
Felzenszwalb, P. F., & Huttenlocher, D. P. (2005) · International Journal of Computer Vision · doi:10.1023/b:visi.0000042934.15159.49 · Cited by 2,180
The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries
Carbonell, J., & Goldstein, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130369 · Cited by 2,156
Halton, J. H. (1960) · Numerische Mathematik · doi:10.1007/bf01386213 · Cited by 1,985
The computational complexity of probabilistic inference using bayesian belief networks
Cooper, G. F. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90060-d · Cited by 1,937
Meme-tracking and the dynamics of the news cycle
Leskovec, J., Backstrom, L., & Kleinberg, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557077 · Cited by 1,530
Chapter 2 Building the gist of a scene: the role of global image features in recognition
Oliva, A., & Torralba, A. (2006) · Progress in Brain Research · doi:10.1016/s0079-6123(06)55002-2 · Cited by 1,434
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Murphy, K. P., Weiss, Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6725 · Cited by 1,397
The Representation and Matching of Pictorial Structures
Fischler, M. A., & Elschlager, R. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223602 · Cited by 1,322
Automating the Construction of Internet Portals with Machine Learning
McCallum, A. K., Nigam, K., Rennie, J., & Seymore, K. (2000) · Information Retrieval · doi:10.1023/a:1009953814988 · Cited by 1,280
Statistical Ensembles of Complex, Quaternion, and Real Matrices
Ginibre, J. (1965) · Journal of Mathematical Physics · doi:10.1063/1.1704292 · Cited by 1,059
Statistical Inference and Simulation for Spatial Point Processes
Moller, J., & Waagepetersen, R. P. (2003) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203496930 · Cited by 1,055
An analysis of approximations for maximizing submodular set functions - 1Preprint
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · RePEc: Research Papers in Economics · Cited by 837
Boros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
Approximating probabilistic inference in Bayesian belief networks is NP-hard
Dagum, P., & Luby, M. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90036-b · Cited by 761
Algorithm 659: Implementing Sobol's quasirandom sequence generator
Bratley, P., & Fox, B. L. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/42288.214372 · Cited by 754
Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach
Pearl, J. (2022) · Probabilistic and Causal Inference · doi:10.1145/3501714.3501727 · Cited by 727
An Introduction to the Theory of Point Processes : Volume I: Elementary Theory and Methods
Daley, D. J., & Vere‐Jones, D. (2003) · Cited by 701
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time
Schrijver, A. (2000) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.2000.1989 · Cited by 651
An analysis of approximations for maximizing submodular set functions—II
Fisher, M. L., Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematical Programming Studies · doi:10.1007/bfb0121195 · Cited by 589
The coincidence approach to stochastic point processes
Macchi, O. (1975) · Advances in Applied Probability · doi:10.1017/s0001867800040313 · Cited by 582
Beyond Independent Relevance: Methods and Evaluation Metrics for Subtopic Retrieval
Zhai, C., Cohen, W. W., & Lafferty, J. (2015) · ACM SIGIR Forum · doi:10.1145/2795403.2795405 · Cited by 558
Statistical Inference for Spatial Processes
Ripley, B. D. (1988) · doi:10.1017/cbo9780511624131 · Cited by 546
Spatial Statistics and Bayesian Computation
Besag, J., & Green, P. J. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01467.x · Cited by 542
Vempala, S. (2005) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/065 · Cited by 538
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Mei, Q., & Zhai, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081895 · Cited by 524
Learning diverse rankings with multi-armed bandits
Radlinski, F., Kleinberg, R., & Joachims, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390255 · Cited by 503
Determinantal Processes and Independence
Hough, J. B., Krishnapur, M., Peres, Y., & Virág, B. (2006) · Probability Surveys · doi:10.1214/154957806000000078 · Cited by 494
Exact optimization for markov random fields with convex priors
Ishikawa, H. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1233908 · Cited by 486
Determinantal random point fields
Soshnikov, A. B., & Studies, T. (. I. S. F. A. (2000) · Cited by 428
STRAUSS, D. J. (1975) · Biometrika · doi:10.1093/biomet/62.2.467 · Cited by 416
Multi-document Summarization via Budgeted Maximization of Submodular Functions
Lin, H. Z., & Bilmes, J. (2010) · Cited by 354
Finding MAPs for belief networks is NP-hard
Shimony, S. E. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90072-8 · Cited by 332
Minimum Bayes-Risk Decoding for Statistical Machine Translation
Kumar, S., Byrne, B., et al. (2004) · Cited by 328
Less is more: probabilistic models for retrieving fewer relevant documents
Chen, H., & Karger, D. R. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148245 · Cited by 319
Shirai, T., & Takahashi, Y. (2003) · Journal of Functional Analysis · doi:10.1016/s0022-1236(03)00171-x · Cited by 319
Modern Statistics for Spatial Point Processes*
MØLLER, J., & WAAGEPETERSEN, R. P. (2007) · Scandinavian Journal of Statistics · doi:10.1111/j.1467-9469.2007.00569.x · Cited by 305
Infinite wedge and random partitions
Okounkov, A. (2001) · Selecta Mathematica · doi:10.1007/pl00001398 · Cited by 296
On quasi-Monte Carlo integrations
Sobol, I. M. (1998) · Mathematics and Computers in Simulation · doi:10.1016/s0378-4754(98)00096-2 · Cited by 286
Burton, R. M., & Pemantle, R. (1993) · The Annals of Probability · doi:10.1214/aop/1176989121 · Cited by 278
Non-intersecting paths, random tilings and random matrices
Johansson, K. (2002) · Probability Theory and Related Fields · doi:10.1007/s004400100187 · Cited by 278
Temporal summaries of new topics
Allan, J., Gupta, R., & Khandelwal, V. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383954 · Cited by 253
Funktionen von beschränkter Variatiou in der Theorie der Gleichverteilung
Hlawka, E. (1961) · Annali di Matematica Pura ed Applicata · doi:10.1007/bf02415361 · Cited by 252
A Unified Continuous Greedy Algorithm for Submodular Maximization
Feldman, M., Naor, J., & Schwartz, R. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.46 · Cited by 242
Markov Point Processes and Their Applications
Lieshout, V. M.-C. (2000) · TU/e Research Portal · Cited by 238
Non-monotone submodular maximization under matroid and knapsack constraints
Lee, J., Mirrokni, V. S., Nagarajan, V., & Sviridenko, M. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536459 · Cited by 238
Matérn, B. (1960) · Medical Entomology and Zoology · Cited by 233
Review of new experimental techniques for investigating random sequential adsorption
Ramsden, J. J. (1993) · Journal of Statistical Physics · doi:10.1007/bf01052813 · Cited by 219
Dang, H. T. (2005) · Cited by 219
Ripley, B. D., & Kelly, F. P. (1977) · Journal of the London Mathematical Society · doi:10.1112/jlms/s2-15.1.188 · Cited by 212
Grimmett, G. R. (1973) · Bulletin of the London Mathematical Society · doi:10.1112/blms/5.1.81 · Cited by 212
Area-interaction point processes
Baddeley, A. J., & van Lieshout, M. N. M. (1995) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf01856536 · Cited by 211
Nenkova, A., Vanderwende, L., & McKeown, K. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148269 · Cited by 206
Ambuhl, C., Mas, M., & Svensson, O. (2007) · 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) · doi:10.1109/focs.2007.40 · Cited by 206
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chekuri, C., Vondrák, J., & Zenklusen, R. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993740 · Cited by 203
k-DPPs: Fixed-Size Determinantal Point Processes
Kulesza, A., & Taskar, B. (2011) · Cited by 194
Self-citationConnecting the dots between news articles
Shahaf, D., & Guestrin, C. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835884 · Cited by 189
Efficient Volume Sampling for Row/Column Subset Selection
Deshpande, A., & Rademacher, L. (2010) · 2010 IEEE 51st Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.38 · Cited by 181
Evolutionary timeline summarization: a balanced optimization framework via iterative substitution
Yan, R., Wan, X., Otterbacher, J., Kong, L., Li, X., & Zhang, Y. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2010016 · Cited by 177
Learning associative Markov networks
Taskar, B., Chatalbashev, V., & Koller, D. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015444 · Cited by 171
Minimum Bayes-risk automatic speech recognition
Goel, V., & Byrne, W. J. (2000) · Computer Speech & Language · doi:10.1006/csla.2000.0138 · Cited by 169
Predicting diverse subsets using structural SVMs
Yue, Y., & Joachims, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390310 · Cited by 166
Linear Programming Relaxations and Belief Propagation -- An Empirical Study
Yanover, C., Meltzer, T., & Weiss, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248615 · Cited by 153
Likelihood Analysis of Spatial Point Patterns
Ogata, Y., & Tanemura, M. (1984) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1984.tb01322.x · Cited by 148
Pseudolikelihood for Exponential Family Models of Spatial Point Processes
Jensen, J. L., & Møller, J. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005877 · Cited by 140
Multilingual Topic Detection and Tracking: Successful Research Enabled by Corpora and Evaluation
Wayne, C. L. (2000) · Language Resources and Evaluation Conference (LREC) · doi:10.63317/2jqp5764gmwc · Cited by 139
Query based event extraction along a timeline
Chieu, H. L., & Lee, Y. K. (2004) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1008992.1009065 · Cited by 139
Approximating MAPs for belief networks is NP-hard and other theorems
Abdelbar, A. M., & Hedetniemi, S. M. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00043-5 · Cited by 138
Adaptive pose priors for pictorial structures
Sapp, B., Jordan, C., & Taskar, B. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5540182 · Cited by 134
Li, Z., & Eisner, J. M. (2009) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/1699510.1699517 · Cited by 128
A probing method for computing the diagonal of a matrix inverse
Tang, J. M., & Saad, Y. (2011) · Numerical Linear Algebra with Applications · doi:10.1002/nla.779 · Cited by 126
Patterns in eigenvalues: the 70th Josiah Willard Gibbs lecture
Diaconis, P. W. (2003) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-03-00975-3 · Cited by 122
TimeMines : Constructing Timelines with Statistical Models of Word Usage
Swan, R. C. (2000) · Cited by 111
On Parameter Estimation for Pairwise Interaction Point Processes
Diggle, P. J., Fiksel, T., Grabarnik, P., Ogata, Y., Stoyan, D., & Tanemura, M. (1994) · International Statistical Review · doi:10.2307/1403548 · Cited by 107
Approximate Inference and Protein-Folding
Yanover, C., & Weiss, Y. (2002) · Cited by 106
Structured Determinantal Point Processes
Kulesza, A., & Taskar, B. (2010) · ScholarlyCommons (University of Pennsylvania) · Cited by 100
Self-citationNear-Optimal MAP Inference for Determinantal Point Processes
Gillenwater, J., Kulesza, A., & Taskar, B. (2012) · Cited by 97
Self-citationHäggström, O., van Lieshout, M. N. M., Møller, J., Häggström, O., & Møller, J. (1999) · Bernoulli · doi:10.2307/3318694 · Cited by 96
Point process limits of lattice processes
Besag, J. E., Milne, R. K., & Zachary, S. (1982) · Journal of Applied Probability · doi:10.1017/s0021900200028424 · Cited by 72
A Nonparametric Estimator for Pairwise-Interaction Point Processes
Diggle, P. J., Gates, D. J., & Stibbard, A. (1987) · Biometrika · doi:10.1093/biomet/74.4.763 · Cited by 66
Learning mixtures of submodular shells with application to document summarization
Lin, H. Z., & Bilmes, J. (2012) · Cited by 60
On adding a list of numbers (and other one-dependent determinantal processes)
Borodin, A., Diaconis, P. W., & Fulman, J. (2010) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-2010-01306-9 · Cited by 59
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
Feldman, M., Naor, J. S., & Schwartz, R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22006-7_29 · Cited by 54
McCullagh, P. J., & Møller, J. (2006) · Advances in Applied Probability · doi:10.1017/s0001867800001361 · Cited by 54
Ogata, Y., & Tanemura, M. (1985) · Biometrics · doi:10.2307/2530867 · Cited by 50
Niederreiter, H., & Winterhof, A. (2015) · Springer eBooks · doi:10.1007/978-3-319-22321-6_4 · Cited by 48
Likelihood-based inference for Matérn type-III repulsive point processes
Huber, M., & Wolpert, R. L. (2009) · Advances in Applied Probability · doi:10.1017/s0001867800003682 · Cited by 30
The Computational Complexity of Immanants
Bürgisser, P. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539798367880 · Cited by 28
Immanants and Finite Point Processes
Diaconis, P. W., & Evans, S. N. (2000) · Journal of Combinatorial Theory Series A · doi:10.1006/jcta.2000.3097 · Cited by 21
On the complexity of immanants
Hartmann, W. (1985) · Linear and Multilinear Algebra · doi:10.1080/03081088508817680 · Cited by 17
Cited by
Explaining machine learning classifiers through diverse counterfactual explanations
Mothilal, R. K., Sharma, A., & Tan, C. (2020) · Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency · doi:10.1145/3351095.3372850 · Cited by 1,233
A Comprehensive Survey of Continual Learning: Theory, Method and Application
Wang, L., Zhang, X., Su, H., & Zhu, J. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3367329 · Cited by 1,113
Video Summarization with Long Short-Term Memory
Zhang, K., Chao, W.-L., Sha, F., & Grauman, K. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46478-7_47 · Cited by 739
Recent automatic text summarization techniques: a survey
Gambhir, M., & Gupta, V. (2017) · Artificial Intelligence Review · doi:10.1007/s10462-016-9475-9 · Cited by 727
Discriminating Data: Correlation, Neighborhoods, and the New Politics of Recognition
Chun, W. H. K., & Barnett, A. (2021) · The MIT Press eBooks · doi:10.7551/mitpress/14050.001.0001 · Cited by 429
Metadata
- Authors
- Kulesza, A.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2012
- OpenAlex
- W3103014337
- Cited by
- 493
- References
- 108
- FWCI
- 8.34
- Type
- book
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.