×

An algorithmic and a geometric characterization of coarsening at random. (English) Zbl 1148.62005

Summary: We show that the class of conditional distributions satisfying the coarsening at random (CAR) property for discrete data has a simple and robust algorithmic description based on randomized uniform multicovers: combinatorial objects generalizing the notion of partition of a set. However, the complexity of a given CAR mechanism can be large: the maximal “height” of the needed multicovers can be exponential in the number of points in the sample space. The results stem from a geometric interpretation of the set of CAR distributions as a convex polytope and a characterization of its extreme points. The hierarchy of CAR models defined in this way could be useful in parsimonious statistical modeling of CAR mechanisms, though the results also raise doubts in applied work as to the meaningfulness of the CAR assumption in its full generality.

MSC:

62E10 Characterization and structure theory of statistical distributions
62A01 Foundations and philosophical topics in statistics
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] Gill, R., van der Laan, M. and Robins, J. (1997). Coarsening at random: Characterisations, conjectures and counter-examples. In Proceedings First Seattle Conference on Biostatistics (D. Lin, ed.) 255-294. Springer, New York. · Zbl 0918.62003
[2] Grünwald, P. and Halpern, J. (2003). Updating probabilities. J. Artificial Intelligence Research 19 243-278. · Zbl 1076.68579
[3] Heitjan, D. and Rubin, D. (1991). Ignorability and coarse data. Ann. Statist. 19 2244-2253. · Zbl 0745.62004 · doi:10.1214/aos/1176348396
[4] Jaeger, M. (2005a). Ignorability for categorical data. Ann. Statist. 33 1964-1981. · Zbl 1078.62002 · doi:10.1214/009053605000000363
[5] Jaeger, M. (2005b). Ignorability in statistical and probabilistic inference. J. Artificial Intelligence Research 24 889-917. · Zbl 1123.62004
[6] Jaeger, M. (2006a). The AI & M procedure for learning from incomplete data. In Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence ( UAI 2006 ) (R. Dechter and T. Richardson, eds.) 225-232.
[7] Jaeger, M. (2006b). On testing the missing at random assumption. In Machine Learning : ECML 2007 , Seventeenth European Conference on Machine Learning (J. Fürnkranz, T. Scheffer and M. Spiliopoulou, eds.). Lecture Notes in Comput. Sci. 4212 671-678. Springer, Berlin.
[8] Schrijver, A. (1986). Theory of Linear and Integer Programming . Wiley, Chichester. · Zbl 0665.90063
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.