An algorithmic and a geometric characterization of Coarsening At Random

@article{Gill2005AnAA,
  title={An algorithmic and a geometric characterization of Coarsening At Random},
  author={R. Gill and Peter D. G{\"u}unwald},
  journal={ArXiv},
  year={2005},
  volume={abs/math/0510276}
}
  • R. Gill, Peter D. Güunwald
  • Published 2005
  • Computer Science, Mathematics
  • ArXiv
  • 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… CONTINUE READING
    14 Citations

    Figures and Topics from this paper

    Robust probability updating
    • 6
    • PDF
    Worst-case Optimal Probability Updating
    • PDF
    Combinatorial Entropy Power Inequalities: A Preliminary Study of the Stam Region
    • 14
    • Highly Influenced
    • PDF
    On Consistency of Estimators Based on Random Set Vector Observations
    • 1
    • PDF
    Analysis of rounded exponential data
    • 3
    Safe Probability
    • 17
    • PDF
    On the testability of coarsening assumptions: A hypothesis test for subgroup independence
    • 2
    • PDF
    The entropy power of a sum is fractionally superadditive
    • M. Madiman, F. Ghassemi
    • Mathematics, Computer Science
    • 2009 IEEE International Symposium on Information Theory
    • 2009
    • 10
    • PDF

    References

    SHOWING 1-10 OF 11 REFERENCES
    Updating Probabilities
    • 171
    • Highly Influential
    • PDF
    Ignorability in Statistical and Probabilistic Inference
    • M. Jaeger
    • Mathematics, Computer Science
    • J. Artif. Intell. Res.
    • 2005
    • 17
    • Highly Influential
    • PDF
    On Testing the Missing at Random Assumption
    • M. Jaeger
    • Computer Science, Mathematics
    • ECML
    • 2006
    • 24
    • PDF
    The AI&M Procedure for Learning from Incomplete Data
    • M. Jaeger
    • Computer Science, Mathematics
    • UAI
    • 2006
    • 16
    • PDF
    Ignorability for categorical data
    • 22
    • Highly Influential
    • PDF
    Theory of linear and integer programming
    • A. Schrijver
    • Mathematics, Computer Science
    • Wiley-Interscience series in discrete mathematics and optimization
    • 1999
    • 4,172
    • Highly Influential
    • PDF
    Coarsening at random: Characterisations , conjectures and counter-examples
    • Proceedings First Seattle Conference on Biostatistics (D. Lin
    • 1997
    Coarsening at random: Characterisations, conjectures and counter-examples
    • Proceedings First Seattle Conference on Biostatistics (D. Lin, ed.) 255–294. Springer, New York.
    • 1997
    Ignorability and Coarse Data
    • 527