Population recovery and partial identification
暂无分享,去创建一个
[1] Elchanan Mossel,et al. Phylogenetic mixtures: Concentration of measure in the large-tree limit , 2011, ArXiv.
[2] Avi Wigderson,et al. Restriction access , 2012, ITCS '12.
[3] Ramakrishnan Srikant,et al. Privacy-preserving data mining , 2000, SIGMOD '00.
[4] Ronitt Rubinfeld,et al. On the learnability of discrete distributions , 1994, STOC '94.
[5] Avrim Blum,et al. Relevant Examples and Relevant Features: Thoughts from Computational Learning Theory , 1994 .
[6] Dimitris Achlioptas,et al. On Spectral Learning of Mixtures of Distributions , 2005, COLT.
[7] J. Feldman,et al. Learning mixtures of product distributions over discrete domains , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[8] Michael E. Saks,et al. A Polynomial Time Algorithm for Lossy Population Recovery , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[9] Jon Feldman,et al. Learning mixtures of product distributions over discrete domains , 2005, FOCS.
[10] Jeffrey C. Jackson,et al. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[11] Cynthia Dwork,et al. Differential Privacy for Statistics: What we Know and What we Want to Learn , 2010, J. Priv. Confidentiality.
[12] Henryk Wozniakowski,et al. The statistical security of a statistical database , 1984, TODS.
[13] Russell Impagliazzo,et al. Finding Heavy Hitters from Lossy or Noisy Data , 2013, APPROX-RANDOM.
[14] Ezio Lefons,et al. An Analytic Approach to Statistical Databases , 1983, VLDB.
[15] Manfred K. Warmuth,et al. Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension , 1995, Machine Learning.
[16] Irit Dinur,et al. Revealing information while preserving privacy , 2003, PODS.
[17] Rina Panigrahy,et al. Trace reconstruction with constant deletion probability and related results , 2008, SODA '08.
[18] Ankur Moitra,et al. Settling the Polynomial Learnability of Mixtures of Gaussians , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[19] Manfred K. Warmuth,et al. Relating Data Compression and Learnability , 2003 .
[20] W. T. Tutte. The reconstruction problem in graph theory , 1977 .
[21] Chong K. Liew,et al. A data distortion by probability distribution , 1985, TODS.
[22] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[23] Leland L. Beck,et al. A security machanism for statistical database , 1980, TODS.
[24] S L Warner,et al. Randomized response: a survey technique for eliminating evasive answer bias. , 1965, Journal of the American Statistical Association.
[25] G. Wood. Binomial mixtures: geometric estimation of the mixing distribution , 1999 .
[26] Elchanan Mossel,et al. Mixed-up Trees: the Structure of Phylogenetic Mixtures , 2007, Bulletin of mathematical biology.
[27] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[28] Adam Tauman Kalai,et al. Disentangling Gaussians , 2012, Commun. ACM.
[29] Shachar Lovett,et al. Improved Noisy Population Recovery, and Reverse Bonami-Beckner Inequality for Sparse Functions , 2014, Electron. Colloquium Comput. Complex..
[30] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .