On the public citation graph
PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
0 signed · 77 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1997.2648openalex-snapshot
Efficient Learning of Typical Finite Automata from Random Walks
inferredcites →https://doi.org/10.1007/11503415_30openalex-snapshot
The Spectral Method for General Mixture Models
inferredcites →https://doi.org/10.1007/11503415_31openalex-snapshot
On Spectral Learning of Mixtures of Distributions
inferredcites →https://doi.org/10.1109/sfcs.2002.1181888openalex-snapshot
A spectral algorithm for learning mixtures of distributions
inferredcites →https://doi.org/10.1109/sfcs.2005.46openalex-snapshot
Learning mixtures of product distributions over discrete domains
inferredcites →https://doi.org/10.1109/sffcs.1999.814639openalex-snapshot
Learning mixtures of Gaussians
inferredcites →https://doi.org/10.1111/j.2517-6161.1977.tb01600.xopenalex-snapshot
Maximum Likelihood from Incomplete Data Via the EM Algorithm
inferredcites →https://doi.org/10.1137/s0097539798342496openalex-snapshot
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.1145/237814.237833openalex-snapshot
Evaluation may be easier than generation (extended abstract)
inferredcites →https://doi.org/10.1145/307400.307412openalex-snapshot
Estimating a mixture of two product distributions
inferredcites →https://doi.org/10.1145/380752.380808openalex-snapshot
Learning mixtures of arbitrary gaussians
inferredcites →https://doi.org/10.2307/2289504openalex-snapshot
Statistical Analysis of Finite Mixture Distributions.
inferredcites →https://doi.org/10.2307/2531224openalex-snapshot
Statistical Analysis of Finite Mixture Distributions.
inferredcites →https://doi.org/10.48550/arxiv.1301.3850openalex-snapshot
A Two-round Variant of EM for Gaussian Mixtures
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-540-77120-3_39openalex-snapshot
Separating Populations with Wide Data: A Spectral Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-85221-6_8openalex-snapshot
Isotropic PCA and Affine-Invariant Clustering
inferred← citeshttps://doi.org/10.1016/j.ic.2015.09.002openalex-snapshot
Recovery guarantees for exemplar-based clustering
inferred← citeshttps://doi.org/10.1017/9781316882177openalex-snapshot
Algorithmic Aspects of Machine Learning
inferred← citeshttps://doi.org/10.1017/9781316882177.003openalex-snapshot
Nonnegative Matrix Factorization
inferred← citeshttps://doi.org/10.1017/9781316882177.004openalex-snapshot
Tensor Decompositions: Algorithms
inferred← citeshttps://doi.org/10.1017/9781316882177.005openalex-snapshot
Tensor Decompositions: Applications
inferred← citeshttps://doi.org/10.1109/focs.2008.48openalex-snapshot
Isotropic PCA and Affine-Invariant Clustering
inferred← citeshttps://doi.org/10.1109/focs.2010.15openalex-snapshot
Settling the Polynomial Learnability of Mixtures of Gaussians
inferred← citeshttps://doi.org/10.1109/focs.2010.16openalex-snapshot
Polynomial Learning of Distribution Families
inferred← citeshttps://doi.org/10.1109/focs.2017.17openalex-snapshot
On Learning Mixtures of Well-Separated Gaussians
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00112openalex-snapshot
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
inferred← citeshttps://doi.org/10.1109/icdm.2015.48openalex-snapshot
Convex Approximation to the Integral Mixture Models Using Step Functions
inferred← citeshttps://doi.org/10.1109/ita50056.2020.9244945openalex-snapshot
Differentially Private Algorithms for Learning Mixtures of Separated Gaussians
inferred← citeshttps://doi.org/10.1109/tit.2021.3049802openalex-snapshot
Private Hypothesis Selection
inferred← citeshttps://doi.org/10.1145/1806689.1806765openalex-snapshot
Efficiently learning mixtures of two Gaussians
inferred← citeshttps://doi.org/10.1145/2554797.2554818openalex-snapshot
Learning mixtures of arbitrary distributions over large discrete domains
inferred← citeshttps://doi.org/10.1145/2591796.2591881openalex-snapshot
Smoothed analysis of tensor decompositions
inferred← citeshttps://doi.org/10.1145/2746539.2746584openalex-snapshot
Learning Arbitrary Statistical Mixtures of Discrete Distributions
inferred← citeshttps://doi.org/10.1145/2746539.2746616openalex-snapshot
Learning Mixtures of Gaussians in High Dimensions
inferred← citeshttps://doi.org/10.1145/3188745.3188748openalex-snapshot
Mixture models, robustness, and sum of squares proofs
inferred← citeshttps://doi.org/10.1145/3417994openalex-snapshot
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
inferred← citeshttps://doi.org/10.1145/3519935.3520014openalex-snapshot
Clustering mixture models in almost-linear time via list-decodable mean estimation
inferred← citeshttps://doi.org/10.1145/3798129.3800903openalex-snapshot
Learning Mixture Models via Efficient High-Dimensional Sparse Fourier Transforms
inferred← citeshttps://doi.org/10.1214/08-ejs289openalex-snapshot
Separating populations with wide data: A spectral analysis
inferred← citeshttps://doi.org/10.1214/22-aos2207openalex-snapshot
Optimal estimation of high-dimensional Gaussian location mixtures
inferred← citeshttps://doi.org/10.1214/24-aos2400openalex-snapshot
Fundamental limits of low-rank matrix estimation with diverging aspect ratios
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11627openalex-snapshot
Sample-Efficient Learning of Mixtures
inferred← citeshttps://doi.org/10.17760/d20413921openalex-snapshot
Differentially private statistical estimation
inferred← citeshttps://doi.org/10.3929/ethz-b-000269194openalex-snapshot
Training Gaussian Mixture Models at Scale via Coresets
inferred← citeshttps://doi.org/10.48550/arxiv.1004.4864openalex-snapshot
Polynomial Learning of Distribution Families
inferred← citeshttps://doi.org/10.48550/arxiv.1309.3256openalex-snapshot
Recovery guarantees for exemplar-based clustering
inferred← citeshttps://doi.org/10.48550/arxiv.1311.2891openalex-snapshot
The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3651openalex-snapshot
Smoothed Analysis of Tensor Decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1054openalex-snapshot
Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians
inferred← citeshttps://doi.org/10.48550/arxiv.1402.4746openalex-snapshot
Near-optimal-sample estimators for spherical Gaussian mixtures
inferred← citeshttps://doi.org/10.48550/arxiv.1501.01689openalex-snapshot
Sparse Solutions to Nonnegative Linear Systems and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1506.01367openalex-snapshot
A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k
inferred← citeshttps://doi.org/10.48550/arxiv.1705.09269openalex-snapshot
Geometric Methods for Robust Data Analysis in High Dimension
inferred← citeshttps://doi.org/10.48550/arxiv.1710.05209openalex-snapshot
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes
inferred← citeshttps://doi.org/10.48550/arxiv.1712.07242openalex-snapshot
Linear Time Clustering for High Dimensional Mixtures of Gaussian Clouds
inferred← citeshttps://doi.org/10.48550/arxiv.1804.02744openalex-snapshot
Unsupervised Learning of GMM with a Uniform Background Component
inferred← citeshttps://doi.org/10.48550/arxiv.1906.04895openalex-snapshot
Coresets for Gaussian Mixture Models of Any Shape
inferred← citeshttps://doi.org/10.48550/arxiv.2002.00329openalex-snapshot
The EM Algorithm gives Sample-Optimality for Learning Mixtures of Well-Separated Gaussians
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.2106.02774openalex-snapshot
Robust Model Selection and Nearly-Proper Learning for GMMs
inferred← citeshttps://doi.org/10.5555/1496770.1496887openalex-snapshot
Robust PCA and clustering in noisy mixtures
inferred← citeshttps://doi.org/10.5821/dissertation-2117-129592openalex-snapshot
Learning latent variable models : efficient algorithms and applications
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.