On the public citation graph

Population Recovery and Partial Identification

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1997.1533openalex-snapshot
An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution
inferredcites →https://doi.org/10.1007/11503415_31openalex-snapshot
On Spectral Learning of Mixtures of Distributions
inferredcites →https://doi.org/10.1007/11681878_14openalex-snapshot
Calibrating Noise to Sensitivity in Private Data Analysis
inferredcites →https://doi.org/10.1007/978-3-642-40328-6_25openalex-snapshot
Finding Heavy Hitters from Lossy or Noisy Data
inferredcites →https://doi.org/10.1007/bf00993593openalex-snapshot
Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension
inferredcites →https://doi.org/10.1007/s11538-007-9293-yopenalex-snapshot
Mixed-up Trees: the Structure of Phylogenetic Mixtures
inferredcites →https://doi.org/10.1080/01621459.1965.10480775openalex-snapshot
Randomized Response: A Survey Technique for Eliminating Evasive Answer Bias
inferredcites →https://doi.org/10.1090/conm/026/737400openalex-snapshot
Extensions of Lipschitz mappings into a Hilbert space
inferredcites →https://doi.org/10.1109/focs.2010.15openalex-snapshot
Settling the Polynomial Learnability of Mixtures of Gaussians
inferredcites →https://doi.org/10.1137/0222080openalex-snapshot
Learning Decision Trees Using the Fourier Spectrum
inferredcites →https://doi.org/10.1137/060670705openalex-snapshot
Learning Mixtures of Product Distributions over Discrete Domains
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.1145/1994.383392openalex-snapshot
The statistical security of a statistical database
inferredcites →https://doi.org/10.1145/2076450.2076474openalex-snapshot
Disentangling Gaussians
inferredcites →https://doi.org/10.1145/2090236.2090239openalex-snapshot
Restriction access
inferredcites →https://doi.org/10.1145/320613.320617openalex-snapshot
A security machanism for statistical database
inferredcites →https://doi.org/10.1145/335191.335438openalex-snapshot
Privacy-preserving data mining
inferredcites →https://doi.org/10.1145/3979.4017openalex-snapshot
A data distortion by probability distribution
inferredcites →https://doi.org/10.1145/73007.73010openalex-snapshot
A hard-core predicate for all one-way functions
inferredcites →https://doi.org/10.1145/773153.773173openalex-snapshot
Revealing information while preserving privacy
inferredcites →https://doi.org/10.1201/9781420034462.pt1openalex-snapshot
The reconstruction problem
inferredcites →https://doi.org/10.1214/08-ejs289openalex-snapshot
Separating populations with wide data: A spectral analysis
inferredcites →https://doi.org/10.1214/11-aap837openalex-snapshot
Phylogenetic mixtures: Concentration of measure in the large-tree limit
inferredcites →https://doi.org/10.1214/aos/1017939148openalex-snapshot
Binomial mixtures: geometric estimation of the mixing distribution
inferredcites →https://doi.org/10.29012/jpc.v1i2.570openalex-snapshot
Differential Privacy for Statistics: What we Know and What we Want to Learn
inferredcites →https://doi.org/10.48550/arxiv.1302.1515openalex-snapshot
A Polynomial Time Algorithm for Lossy Population Recovery

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_26openalex-snapshot
Teaching and Compressing for Low VC-Dimension
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_25openalex-snapshot
Finding Heavy Hitters from Lossy or Noisy Data
inferred← citeshttps://doi.org/10.1109/focs.2013.20openalex-snapshot
A Polynomial Time Algorithm for Lossy Population Recovery
inferred← citeshttps://doi.org/10.1109/focs.2015.12openalex-snapshot
Compressing and Teaching for Low VC-Dimension
inferred← citeshttps://doi.org/10.1109/focs.2016.77openalex-snapshot
Noisy Population Recovery in Polynomial Time
inferred← citeshttps://doi.org/10.1109/focs.2018.00036openalex-snapshot
Learning Sums of Independent Random Variables with Sparse Collective Support
inferred← citeshttps://doi.org/10.1109/tit.2020.3030569openalex-snapshot
Trace Reconstruction Problems in Computational Biology
inferred← citeshttps://doi.org/10.1137/130916357openalex-snapshot
Analysis of an Exhaustive Search Algorithm in Random Graphs and the $n^{c\log n}$-Asymptotics
inferred← citeshttps://doi.org/10.1145/2688073.2688108openalex-snapshot
Restricted Distribution Automatizability in PAC-Semantics
inferred← citeshttps://doi.org/10.1145/2746539.2746540openalex-snapshot
Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions
inferred← citeshttps://doi.org/10.1145/2897518.2897519openalex-snapshot
A size-free CLT for poisson multinomials and its applications
inferred← citeshttps://doi.org/10.1214/25-aos2498openalex-snapshot
Dualizing Le Cam’s method for functional estimation I: General theory
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4633openalex-snapshot
PAC Quasi-automatizability of Resolution over Restricted Distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5668openalex-snapshot
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order
inferred← citeshttps://doi.org/10.48550/arxiv.1702.05574openalex-snapshot
Sample complexity of population recovery
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.