Local exchangeability

Exchangeability---in which the distribution of an infinite sequence is invariant to reorderings of its elements---implies the existence of a simple conditional independence structure that may be leveraged in the design of probabilistic models and efficient inference algorithms. In practice, however, this assumption is too strong an idealization; the distribution typically fails to be exactly invariant to permutations and de Finetti's representation theory does not apply. Thus there is the need for a distributional assumption that is both weak enough to hold in practice, and strong enough to guarantee a useful underlying representation. We introduce a relaxed notion of local exchangeability---where swapping data associated with nearby covariates causes a bounded change in the distribution. Next, we prove that locally exchangeable processes correspond to independent observations from an underlying measure-valued stochastic process, showing that de Finetti's theorem is robust to perturbation and providing further justification for the Bayesian modelling approach. We also provide an investigation of approximate sufficiency and sample continuity properties of locally exchangeable processes on the real line. The paper concludes with examples of popular statistical models that exhibit local exchangeability.

[1]  B. Hansen,et al.  Optimal Full Matching and Related Designs via Network Flows , 2006 .

[2]  N. Hjort Nonparametric Bayes Estimators Based on Beta Processes in Models for Life History Data , 1990 .

[3]  Francis Comets,et al.  École d'été de probabilités de Saint-Flour XLVI , 2017 .

[4]  D. Freedman,et al.  Finite Exchangeable Sequences , 1980 .

[5]  J. Sethuraman A CONSTRUCTIVE DEFINITION OF DIRICHLET PRIORS , 1991 .

[6]  Hongseok Yang,et al.  A generalization of hierarchical exchangeability on trees to directed acyclic graphs , 2018, 1812.06282.

[7]  O. Kallenberg Foundations of Modern Probability , 2021, Probability Theory and Stochastic Modelling.

[8]  Michael I. Jordan Bayesian Nonparametric Learning : Expressive Priors for Intelligent Systems , 2010 .

[9]  B. Hansen Full Matching in an Observational Study of Coaching for the SAT , 2004 .

[10]  Alison L Gibbs,et al.  On Choosing and Bounding Probability Metrics , 2002, math/0209021.

[11]  David B. Dunson,et al.  The Kernel Beta Process , 2011, NIPS.

[12]  Emily B. Fox,et al.  Sparse graphs using exchangeable random measures , 2014, Journal of the Royal Statistical Society. Series B, Statistical methodology.

[13]  Chong Wang,et al.  Continuous Time Dynamic Topic Models , 2008, UAI.

[14]  Walter Dempsey,et al.  Edge exchangeable models for network data , 2016, ArXiv.

[15]  W. Sendler A Note on the Proof of the Zero-One Law of Blum and Pathak , 1975 .

[16]  Michael I. Jordan,et al.  Feature allocations, probability functions, and paintboxes , 2013, 1301.6647.

[17]  Stephen E. Fienberg,et al.  Testing Statistical Hypotheses , 2005 .

[18]  L. J. Savage,et al.  Symmetric measures on Cartesian products , 1955 .

[19]  Paul R Rosenbaum,et al.  Optimal Pair Matching With Two Control Groups , 2004 .

[20]  Dylan S. Small,et al.  Building a Stronger Instrument in an Observational Study of Perinatal Care for Premature Infants , 2010 .

[21]  Dmitry Panchenko,et al.  A hierarchical version of the de Finetti and Aldous-Hoover representations , 2013, 1301.1259.

[22]  J. Potthoff Sample properties of random fields II: Continuity , 2009 .

[23]  E. Pitman SIGNIFICANCE TESTS WHICH MAY BE APPLIED TO SAMPLES FROM ANY POPULATIONS III. THE ANALYSIS OF VARIANCE TEST , 1938 .

[24]  Federico Camerlenghi,et al.  Distribution theory for hierarchical processes , 2019, The Annals of Statistics.

[25]  R. Horwitz The planning of observational studies of human populations , 1979 .

[26]  Xinyi Xu,et al.  Optimal Nonbipartite Matching and Its Statistical Applications , 2011, The American statistician.

[27]  D. Freedman,et al.  De Finetti's Theorem for Markov Chains , 1980 .

[28]  Gerry Leversha,et al.  Foundations of modern probability (2nd edn), by Olav Kallenberg. Pp. 638. £49 (hbk). 2002. ISBN 0 387 95313 2 (Springer-Verlag). , 2004, The Mathematical Gazette.

[29]  B. D. Finetti La prévision : ses lois logiques, ses sources subjectives , 1937 .

[30]  D. Bertsekas,et al.  TWO-METRIC PROJECTION METHODS FOR CONSTRAINED OPTIMIZATION* , 1984 .

[31]  Carl E. Rasmussen,et al.  Gaussian processes for machine learning , 2005, Adaptive computation and machine learning.

[32]  Christian Borgs,et al.  Sparse Exchangeable Graphs and Their Limits via Graphon Processes , 2016, J. Mach. Learn. Res..

[33]  Chris Preston,et al.  Some Notes on Standard Borel and Related Spaces , 2008, 0809.3066.

[34]  P. Diaconis Finite forms of de Finetti's theorem on exchangeability , 1977, Synthese.

[35]  Radford M. Neal Markov Chain Sampling Methods for Dirichlet Process Mixture Models , 2000 .

[36]  Daniel M. Roy,et al.  Bayesian Models of Graphs, Arrays and Other Exchangeable Random Structures , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[37]  Rajendra Bhatia,et al.  A Better Bound on the Variance , 2000, Am. Math. Mon..

[38]  E. Pitman Significance Tests Which May be Applied to Samples from Any Populations , 1937 .

[39]  Tamara Broderick,et al.  Exchangeable Trait Allocations , 2016, 1609.09147.

[40]  John D. Lafferty,et al.  Dynamic topic models , 2006, ICML.

[41]  J. I The Design of Experiments , 1936, Nature.

[42]  Steffen L. Lauritizen On the Interrelationships Among Sufficiency, Total Sufficiency and Some Related Concepts , 1974 .

[43]  J. Kingman The Representation of Partition Structures , 1978 .

[44]  Olav Kallenberg,et al.  Spreading and Predictable Sampling in Exchangeable Sequences and Processes , 1988 .

[45]  Walter Dempsey,et al.  Relational exchangeability , 2016, Journal of Applied Probability.

[46]  David A. Freedman,et al.  De Finetti's generalizations of exchangeability , 1980 .

[47]  D. Aldous Representations for partially exchangeable arrays of random variables , 1981 .

[48]  E. J. G. Pitman,et al.  Significance Tests Which May be Applied to Samples from Any Populations. II. The Correlation Coefficient Test , 1937 .

[49]  T. Ferguson A Bayesian Analysis of Some Nonparametric Problems , 1973 .

[50]  Luca Pratelli,et al.  Limit theorems for a class of identically distributed random variables , 2004, math/0410105.

[51]  P. Rosenbaum Covariance Adjustment in Randomized Experiments and Observational Studies , 2002 .

[52]  R. Reiss Approximation of Product Measures with an Application to Order Statistics , 1981 .

[53]  O. Kallenberg Exchangeable random measures in the plane , 1990 .

[54]  Nicholas J. Foti,et al.  A Survey of Non-Exchangeable Priors for Bayesian Nonparametric Models , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[55]  Yee Whye Teh,et al.  Dependent Normalized Random Measures , 2013, ICML.

[56]  J. Pitman Exchangeable and partially exchangeable random partitions , 1995 .

[57]  D. Rubin Matched Sampling for Causal Effects: The Use of Matched Sampling and Regression Adjustment to Remove Bias in Observational Studies , 1973 .

[58]  D. Rubin Matched Sampling for Causal Effects: Matching to Remove Bias in Observational Studies , 1973 .

[59]  S. Janson On Edge Exchangeable Random Graphs , 2017, Journal of statistical physics.

[60]  B. De Finetti,et al.  Funzione caratteristica di un fenomeno aleatorio , 1929 .

[61]  Daniel M. Roy,et al.  The Class of Random Graphs Arising from Exchangeable Random Measures , 2015, ArXiv.

[62]  Paul R. Rosenbaum,et al.  Optimal Matching for Observational Studies , 1989 .

[63]  D. Aldous Exchangeability and related topics , 1985 .

[64]  M. D. Ernst Permutation Methods: A Basis for Exact Inference , 2004 .

[65]  Yoram Singer,et al.  Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.

[66]  Michael I. Jordan,et al.  Latent Dirichlet Allocation , 2001, J. Mach. Learn. Res..

[67]  Jeffrey H Silber,et al.  Optimal multivariate matching before randomization. , 2004, Biostatistics.

[68]  W. Eric L. Grimson,et al.  Construction of Dependent Dirichlet Processes based on Poisson Processes , 2010, NIPS.

[69]  Trevor Campbell,et al.  Edge-exchangeable graphs and sparsity , 2016, NIPS.

[70]  P. Rosenbaum Conditional Permutation Tests and the Propensity Score in Observational Studies , 1984 .