On the public citation graph

Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes

0 signed · 49 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.1007/11776420_5openalex-snapshot
PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
inferredcites →https://doi.org/10.1007/978-1-4612-1880-7openalex-snapshot
Festschrift for Lucien Le Cam
inferredcites →https://doi.org/10.1007/978-1-4613-0125-7openalex-snapshot
Combinatorial Methods in Density Estimation
inferredcites →https://doi.org/10.1007/978-1-4613-9620-8openalex-snapshot
Approximate Distributions of Order Statistics
inferredcites →https://doi.org/10.1007/b13794openalex-snapshot
Introduction to Nonparametric Estimation
inferredcites →https://doi.org/10.1016/j.aim.2004.08.004openalex-snapshot
Smallest singular value of random matrices and geometry of random polytopes
inferredcites →https://doi.org/10.1016/sopenalex-snapshot
A B(4)C silicon target for the detection of neutrino interactions
inferredcites →https://doi.org/10.1017/9781108231596openalex-snapshot
High-Dimensional Probability
inferredcites →https://doi.org/10.1017/9781108303453openalex-snapshot
The Random Matrix Theory of the Classical Compact Groups
inferredcites →https://doi.org/10.1017/9781108303453.009openalex-snapshot
Index
inferredcites →https://doi.org/10.1017/cbo9780511624216openalex-snapshot
Neural Network Learning
inferredcites →https://doi.org/10.1017/cbo9780511642401.015openalex-snapshot
Introduction to non-parametric estimation
inferredcites →https://doi.org/10.1017/cbo9780511755279openalex-snapshot
Coding Theory
inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot
Convex Optimization
inferredcites →https://doi.org/10.1109/focs.2010.15openalex-snapshot
Settling the Polynomial Learnability of Mixtures of Gaussians
inferredcites →https://doi.org/10.1109/focs.2010.16openalex-snapshot
Polynomial Learning of Distribution Families
inferredcites →https://doi.org/10.1109/sffcs.1999.814639openalex-snapshot
Learning mixtures of Gaussians
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.1145/2076450.2076474openalex-snapshot
Disentangling Gaussians
inferredcites →https://doi.org/10.1145/2591796.2591848openalex-snapshot
Efficient density estimation via piecewise polynomial approximation
inferredcites →https://doi.org/10.1145/2745754.2745772openalex-snapshot
Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms
inferredcites →https://doi.org/10.1145/2890490openalex-snapshot
Sample Compression Schemes for VC Classes
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1201/9781315140919openalex-snapshot
Density Estimation for Statistics and Data Analysis
inferredcites →https://doi.org/10.1214/105051604000000512openalex-snapshot
Learning mixtures of separated nonspherical Gaussians
inferredcites →https://doi.org/10.1214/20-ejs1721openalex-snapshot
The minimax learning rates of normal and Ising undirected graphical models
inferredcites →https://doi.org/10.1214/aoms/1177729694openalex-snapshot
On Information and Sufficiency
inferredcites →https://doi.org/10.1214/aos/1015957395openalex-snapshot
Adaptive estimation of a quadratic functional by model selection
inferredcites →https://doi.org/10.1214/aos/1176349553openalex-snapshot
Rates of Convergence of Minimum Distance Estimators and Kolmogorov's Entropy
inferredcites →https://doi.org/10.1214/lnms/1215090078openalex-snapshot
Estimation of analytic functions
inferredcites →https://doi.org/10.2307/2288956openalex-snapshot
Density Estimation for Statistics and Data Analysis.
inferredcites →https://doi.org/10.3929/ethz-b-000269194openalex-snapshot
Training Gaussian Mixture Models at Scale via Coresets
inferredcites →https://doi.org/10.48550/arxiv.1710.05209openalex-snapshot
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes
inferredcites →https://doi.org/10.52202/085713openalex-snapshot
Advances in Neural Information Processing Systems 19
inferredcites →https://doi.org/10.7551/mitpress/3206.001.0001openalex-snapshot
Gaussian Processes for Machine Learning

What points at this work

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

inferred← citeshttps://doi.org/10.1109/focs52979.2021.00070openalex-snapshot
A Theory of PAC Learnability of Partial Concept Classes
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00092openalex-snapshot
Statistically Near-Optimal Hypothesis Selection
inferred← citeshttps://doi.org/10.1109/ijcnn54540.2023.10191006openalex-snapshot
MultiDrop: A Local Rademacher Complexity-Based Regularization for Multitask Models
inferred← citeshttps://doi.org/10.1137/23m1610082openalex-snapshot
Estimating Gaussian Mixtures Using Sparse Polynomial Moment Systems
inferred← citeshttps://doi.org/10.1214/22-aos2207openalex-snapshot
Optimal estimation of high-dimensional Gaussian location mixtures
inferred← citeshttps://doi.org/10.17771/pucrio.acad.55539openalex-snapshot
APPROXIMATE BORN AGAIN TREE ENSEMBLES
inferred← citeshttps://doi.org/10.48550/arxiv.2002.05818openalex-snapshot
Optimal estimation of high-dimensional location Gaussian mixtures
inferred← citeshttps://doi.org/10.48550/arxiv.2011.04907openalex-snapshot
A Statistical Perspective on Coreset Density Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.2104.09665openalex-snapshot
Learning GMMs with Nearly Optimal Robustness Guarantees
inferred← citeshttps://doi.org/10.48550/arxiv.2106.02162openalex-snapshot
Privately Learning Mixtures of Axis-Aligned Gaussians
inferred← citeshttps://doi.org/10.48550/arxiv.2109.01064openalex-snapshot
Lower Bounds on the Total Variation Distance Between Mixtures of Two Gaussians
inferred← citeshttps://doi.org/10.48550/arxiv.2110.02456openalex-snapshot
VC dimension of partially quantized neural networks in the overparametrized regime
inferred← citeshttps://doi.org/10.48550/arxiv.2111.11320openalex-snapshot
Private and polynomial time algorithms for learning Gaussians and beyond
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.