paper-with-me

홈 › Papers

Moment Estimation for Nonparametric Mixture Models Through Implicit Tensor Decomposition

2022-10-25 · Yifan Zhang, Joe Kileel

We present an alternating least squares type numerical optimization scheme to estimate conditionally-independent mixture models in $\mathbb{R}^n$, without parameterizing the distributions. Following the method of moments, we tackle an incomplete tensor decomposition problem to learn the mixing weights and componentwise means. Then we compute the cumulative distribution functions, higher moments and other statistics of the component distributions through linear solves. Crucially for computations in high dimensions, the steep costs associated with high-order tensors are evaded, via the development of efficient tensor-free operations. Numerical experiments demonstrate the competitive performance of the algorithm, and its applicability to many models and applications. Furthermore we provide theoretical analyses, establishing identifiability from low-order moments of the mixture and guaranteeing local linear convergence of the ALS algorithm.

📄 PDF Abstract BibTeX arXiv:2210.14386

Code (1)

yifan8/moment_estimation_incomplete_tensor_decomposition 공식 구현

Tasks

Tensor Decomposition

Methods 이 논문이 사용한 방법론

ALS 설명 없음

Similar Papers 제목 키워드 기반

Estimating Mixture Models via Mixtures of Polynomials

2016-03-28 · NeurIPS 2015 12 · Sida I. Wang, Arun Tejasvi Chaganty, Percy Liang

Mixture modeling is a general technique for making any simple model more expressive through weighted combination. This generality and simplicity in part explains the success of the Expectation Maximization (EM) algorithm…

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models

2024-11-23 · Ilias Diakonikolas, Daniel M. Kane

We study the task of learning latent-variable models. A common algorithmic technique for this task is the method of moments. Unfortunately, moment-based approaches are hampered by the fact that the moment tensors of supe…

Density EstimationPAC learningparameter estimation

How Well Generative Adversarial Networks Learn Distributions

2018-11-07 · Tengyuan Liang

This paper studies the rates of convergence for learning distributions implicitly with the adversarial framework and Generative Adversarial Networks (GANs), which subsume Wasserstein, Sobolev, MMD GAN, and Generalized/Si…

Density Estimationvalid

PMODE: Theoretically Grounded and Modular Mixture Modeling

2025-08-29 · Robert A. Vandermeulen arxiv

We introduce PMODE (Partitioned Mixture Of Density Estimators), a general and modular framework for mixture modeling with both parametric and nonparametric components. PMODE builds mixtures by partitioning the data and f…

Density EstimationAnomaly Detection

Dirichlet Process Parsimonious Mixtures for clustering

2015-01-14 · Faicel Chamroukhi, Marius Bartcus, Hervé Glotin

The parsimonious Gaussian mixture models, which exploit an eigenvalue decomposition of the group covariance matrices of the Gaussian mixture, have shown their success in particular in cluster analysis. Their estimation i…

ClusteringModel Selection