Population recovery and partial identification
From MaRDI portal
(Redirected from Publication:255358)
Statistical aspects of information-theoretic topics (62B10) Software, source code, etc. for problems pertaining to statistics (62-04) Characterization and structure theory of statistical distributions (62E10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Recommendations
Cites work
- scientific article; zbMATH DE number 5764889 (Why is no real title available?)
- scientific article; zbMATH DE number 3674136 (Why is no real title available?)
- A security machanism for statistical database
- Extensions of Lipschitz mappings into a Hilbert space
- Finding heavy hitters from lossy or noisy data
- Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
- Learning Decision Trees Using the Fourier Spectrum
- Learning Mixtures of Product Distributions over Discrete Domains
- Mixed-up trees: the structure of phylogenetic mixtures
- On the learnability of discrete distributions
- Randomized response: a survey technique for eliminating evasive answer bias
- Restriction access
- Separating populations with wide data: a spectral analysis
- Theory of Cryptography
Cited in
(6)- Teaching and Compressing for Low VC-Dimension
- scientific article; zbMATH DE number 7650111 (Why is no real title available?)
- Improved noisy population recovery, and reverse Bonami-Beckner inequality for sparse functions
- Sharp bounds for population recovery
- A note on hardness of computing recursive teaching dimension
- Decoding from pooled data: sharp information-theoretic bounds
This page was built for publication: Population recovery and partial identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255358)