Polynomial Learning of Distribution Families
From MaRDI portal
Publication:5501205
DOI10.1137/13090818XzbMath1335.68100MaRDI QIDQ5501205
Publication date: 3 August 2015
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Parametric inference (62F99) Semialgebraic sets and related spaces (14P10)
Related Items (14)
Compressive statistical learning with random feature moments ⋮ Public-key encryption from homogeneous CLWE ⋮ Clustering subgaussian mixtures by semidefinite programming ⋮ Convergence of latent mixing measures in finite and infinite mixture models ⋮ Optimal estimation of Gaussian mixtures via denoised method of moments ⋮ Recovering Structured Probability Matrices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On strong identifiability and convergence rates of parameter estimation in finite mixtures ⋮ Structured matrix estimation and completion ⋮ Polynomial Learning of Distribution Families ⋮ A spectral algorithm for latent Dirichlet allocation ⋮ Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders ⋮ Learning Poisson binomial distributions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lectures on algebraic statistics
- Efficiently learning mixtures of two Gaussians
- Learning mixtures of spherical gaussians
- Learning Mixtures of Product Distributions over Discrete Domains
- Isotropic PCA and Affine-Invariant Clustering
- Statistical analysis of finite mixture distributions
- Learning mixtures of arbitrary gaussians
- Smoothed analysis of tensor decompositions
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- Learning Theory
- Learning Theory
- Polynomial Learning of Distribution Families
- Identifiability of Finite Mixtures
- Algorithms in real algebraic geometry
This page was built for publication: Polynomial Learning of Distribution Families
