Markov Properties of Discrete Determinantal Point Processes

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 for solving several machine learning tasks that require the selection of diverse objects, and have been successfully applied in numerous real-life problems. Despite their popularity, the statistical properties of such models have not been adequately explored. In this note, we derive the Markov properties of discrete DPPs and show how they can be expressed using graphical models.

[1]  A. Dawid.  Conditional Independence in Statistical Theory , 1979 .

[2]  S. Karlin,et al.  Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions , 1980 .

[3]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[4]  N. Wermuth,et al.  Linear Dependencies Represented by Chain Graphs , 1993 .

[5]  Craig Boutilier,et al.  Context-Specific Independence in Bayesian Networks , 1996, UAI.

[6]  G. Kauermann.  On a dualization of graphical Gaussian models , 1996 .

[7]  A. Dawid.  Conditional Independence , 1997 .

[8]  Michael I. Jordan.  Graphical Models , 2003 .

[9]  R. Lyons.  Determinantal probability measures , 2002, math/0204325.

[10]  K. Johansson.  Random matrices and determinantal processes , 2005, math-ph/0510038.

[11]  C.J.H. Mann,et al.  Probabilistic Conditional Independence Structures , 2005 .

[12]  Y. Peres,et al.  Determinantal Processes and Independence , 2005, math/0503110.

[13]  T. Liggett,et al.  Negative dependence and the geometry of polynomials , 2007, 0707.2340.

[14]  N. Wermuth,et al.  Triangular systems for symmetric binary variables , 2009 .

[15]  J. Baik,et al.  The Oxford Handbook of Random Matrix Theory , 2011 .

[16]  Ben Taskar,et al.  Determinantal Point Processes for Machine Learning , 2012, Found. Trends Mach. Learn..

[17]  A. Roverato,et al.  Log-mean linear models for binary data , 2011, 1109.6239.

[18]  Tvrtko Tadi'c.  Graphical structure of conditional independencies in determinantal point processes , 2014, 1406.5577.

[19]  J. Peters.  On the Intersection Property of Conditional Independence and its Application to Causal Discovery , 2014, 1403.0408.

[20]  S. Lauritzen,et al.  Markov properties for mixed graphs , 2011, 1109.5909.

[21]  Shaun M. Fallat,et al.  Total positivity in Markov structures , 2015, 1510.01290.

[22]  S. Lauritzen,et al.  Unifying Markov properties for graphical models , 2016, The Annals of Statistics.

[23]  Jukka Corander,et al.  A Logical Approach to Context-Specific Independence , 2016, WoLLIC.

[24]  Ankur Moitra,et al.  Learning Determinantal Point Processes with Moments and Cycles , 2017, ICML.

[25]  Kayvan Sadeghi,et al.  Faithfulness of Probability Distributions and Graphs , 2017, J. Mach. Learn. Res..

[26]  John C. Urschel,et al.  Maximum likelihood estimation of determinantal point processes , 2017, 1701.06501.