Polynomial Learning of Distribution Families
From MaRDI portal
Publication:5501205
Recommendations
- On learning multivariate polynomials under the uniform distribution
- A sufficient condition for polynomial distribution-dependent learnability
- Bernstein polynomials and learning theory
- Distribution theory and inference for polynomial-normal densities
- Equivalence of models for polynomial learnability
- scientific article; zbMATH DE number 67608
- Approximating distributions in stochastic learning
Cites work
- scientific article; zbMATH DE number 194758 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- Algorithms in real algebraic geometry
- Efficiently learning mixtures of two Gaussians
- Identifiability of Finite Mixtures
- Isotropic PCA and Affine-Invariant Clustering
- Learning Mixtures of Product Distributions over Discrete Domains
- Learning Theory
- Learning Theory
- Learning mixtures of arbitrary Gaussians
- Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
- Lectures on algebraic statistics
- Mixture models: theory, geometry and applications
- PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
- Polynomial Learning of Distribution Families
- Smoothed analysis of tensor decompositions
- Statistical analysis of finite mixture distributions
Cited in
(16)- Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
- scientific article; zbMATH DE number 7525505 (Why is no real title available?)
- Optimal estimation of Gaussian mixtures via denoised method of moments
- Structured matrix estimation and completion
- Public-key encryption from homogeneous CLWE
- Training Gaussian mixture models at scale via coresets
- Convergence of latent mixing measures in finite and infinite mixture models
- A spectral algorithm for latent Dirichlet allocation
- Compressive statistical learning with random feature moments
- On strong identifiability and convergence rates of parameter estimation in finite mixtures
- Polynomial Learning of Distribution Families
- Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders
- Fundamental limits of low-rank matrix estimation with diverging aspect ratios
- Clustering subgaussian mixtures by semidefinite programming
- Recovering structured probability matrices
- Learning polynomial transformations via generalized tensor decompositions
This page was built for publication: Polynomial Learning of Distribution Families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501205)
