Polynomial Learning of Distribution Families

DOI10.1137/13090818XzbMATH Open1335.68100MaRDI QIDQ5501205FDOQ5501205

Authors: Mikhail Belkin, Kaushik Sinha 

Publication date: 3 August 2015

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

learning theoryGaussian mixture modelsstatistical inferencesemialgebraic geometry

Mathematics Subject Classification ID

Parametric inference (62F99) Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32) Semialgebraic sets and related spaces (14P10)

Cites Work

• Statistical analysis of finite mixture distributions
• Mixture models: theory, geometry and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lectures on algebraic statistics
• Learning Mixtures of Product Distributions over Discrete Domains
• Algorithms in real algebraic geometry
• Identifiability of Finite Mixtures
• Efficiently learning mixtures of two Gaussians
• Isotropic PCA and Affine-Invariant Clustering
• Learning Theory
• Learning Theory
• Learning mixtures of arbitrary Gaussians
• PAC Learning Axis-Aligned Mixtures of Gaussians with No Separation Assumption
• Learning mixtures of spherical Gaussians: moment methods and spectral decompositions (extended abstract)
• Polynomial Learning of Distribution Families
• Smoothed analysis of tensor decompositions

Cited In (16)

• Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
• Title not available (Why is that?)
• 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)