Cover Image

On the best approximation by finite Gaussian mixtures

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ma, Yun, Wu, Yihong, Yang, Pengkun
Format:	Preprint
Published:	2024
Subjects:	Statistics Theory Information Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs
by: Huang, Dong, et al.
Published: (2024)

Sharp regret-Hellinger bounds for Gaussian empirical Bayes via polynomial approximation
by: Chen, Jiafeng, et al.
Published: (2026)

High-probability sample complexities for policy evaluation with linear function approximation
by: Li, Gen, et al.
Published: (2023)

Random pairing MLE for estimation of item parameters in Rasch model
by: Yang, Yuepeng, et al.
Published: (2024)

Sample efficient inductive matrix completion with noise and inexact side information
by: Yang, Yuepeng, et al.
Published: (2026)

Universal time-series forecasting with mixture predictors
by: Ryabko, Daniil
Published: (2020)

Fast and Multiphase Rates for Nearest Neighbor Classifiers
by: Yang, Pengkun, et al.
Published: (2023)

Top-$K$ ranking with a monotone adversary
by: Yang, Yuepeng, et al.
Published: (2024)

Instance-Optimal Estimation with Multiple LLM Judges on a Budget
by: Lee, Junghyun, et al.
Published: (2026)

High-Dimensional Asymptotics of Differentially Private PCA
by: Yun, Youngjoo, et al.
Published: (2025)

Sharp One-Dimensional Sub-Gaussian Comparison in Convex Order
by: Zhang, Yihan
Published: (2026)

Attributed Network Alignment: Statistical Limits and Efficient Algorithm
by: Huang, Dong, et al.
Published: (2026)

Orthogonal Approximate Message Passing with Optimal Spectral Initializations for Rectangular Spiked Matrix Models
by: Chen, Haohua, et al.
Published: (2025)

Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
by: Chen, Haohua, et al.
Published: (2026)

Gaussian mixture layers for neural networks
by: Chewi, Sinho, et al.
Published: (2025)

Diffusion Models Are Statistically Optimal for Learning Low-Dimensional Multi-Modal Distributions
by: Wu, Jingda, et al.
Published: (2026)

Prior-dependent analysis of posterior sampling reinforcement learning with function approximation
by: Li, Yingru, et al.
Published: (2024)

Sharp Gaussian approximations for Decentralized Federated Learning
by: Bonnerjee, Soham, et al.
Published: (2025)

A non-asymptotic distributional theory of approximate message passing for sparse and robust regression
by: Li, Gen, et al.
Published: (2024)

Generalization of LiNGAM that allows confounding
by: Suzuki, Joe, et al.
Published: (2024)

Smoothed SGD for quantiles: Bahadur representation and Gaussian approximation
by: Chen, Likai, et al.
Published: (2025)

Statistical Mean Estimation with Coded Relayed Observations
by: Ling, Yan Hao, et al.
Published: (2025)

Universality laws for Gaussian mixtures in generalized linear models
by: Dandi, Yatin, et al.
Published: (2023)

Asymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
by: Fan, Jianqing, et al.
Published: (2025)

Unifying AMP Algorithms for Rotationally-Invariant Models
by: Liu, Songbin, et al.
Published: (2024)

Spectral clustering in the Gaussian mixture block model
by: Li, Shuangping, et al.
Published: (2023)

Efficient reductions from a Gaussian source with applications to statistical-computational tradeoffs
by: Lou, Mengqi, et al.
Published: (2025)

Optimality of Approximate Message Passing Algorithms for Spiked Matrix Models with Rotationally Invariant Noise
by: Dudeja, Rishabh, et al.
Published: (2024)

High-dimensional Clustering and Signal Recovery under Block Signals
by: Su, Wu, et al.
Published: (2025)

Characterisations of Kullback--Leibler approximation by finite Gaussian mixtures
by: Nguyen, Hien Duy
Published: (2026)

Optimal score estimation via empirical Bayes smoothing
by: Wibisono, Andre, et al.
Published: (2024)

Information-Geometric Decomposition of Generalization Error in Unsupervised Learning
by: Kim, Gilhan
Published: (2026)

Fine-Grained Uncertainty Quantification via Collisions
by: Friedbaum, Jesse, et al.
Published: (2024)

Efficient Unbiased Sparsification
by: Barnes, Leighton, et al.
Published: (2024)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

Characterizing Dependence of Samples along the Langevin Dynamics and Algorithms via Contraction of $Φ$-Mutual Information
by: Liang, Jiaming, et al.
Published: (2024)

Representatividad Muestral en la Incertidumbre Simétrica Multivariada para la Selección de Atributos
by: Sosa-Cabrera, Gustavo
Published: (2024)

Fast Convergence of $Φ$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler
by: Mitra, Siddharth, et al.
Published: (2024)

Sparse Max-Affine Regression
by: Kanj, Haitham, et al.
Published: (2024)

Theoretical limits of descending $\ell_0$ sparse-regression ML algorithms
by: Stojnic, Mihailo
Published: (2024)