Risk bounds for mixture density estimation

DOI10.1051/PS:2005011zbMATH Open1141.62024OpenAlexW2158733996WikidataQ56906344 ScholiaQ56906344MaRDI QIDQ3373741FDOQ3373741

Authors: Alexander Rakhlin, D. Panchenko, Sayan Mukherjee 

Publication date: 9 March 2006

Published in: ESAIM: Probability and Statistics (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=PS_2005__9__220_0

Recommendations

• Density estimation through convex combinations of densities: Approximation and estimation bounds
• Optimal Kullback-Leibler aggregation in mixture density estimation by maximum likelihood
• A PAC-Bayes Bound for Tailored Density Estimation
• Adaptive density estimation on bounded domains under mixing conditions
• Mixing strategies for density estimation.

zbMATH Keywords

maximum likelihoodRademacher processesMixture density estimation

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Density estimation (62G07) Asymptotic properties of nonparametric inference (62G20)

Cites Work

• Weak convergence and empirical processes. With applications to statistics
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Universal approximation bounds for superpositions of a sigmoidal function
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Uniform Central Limit Theorems
• Probability inequalities for likelihood ratios and convergence rates of sieve MLEs
• Rates of convergence for minimum contrast estimators
• Approximation and estimation bounds for artificial neural networks
• Generalization bounds for function approximation from scattered noisy data
• Rates of convergence for the maximum likelihood estimator in mixture models
• On the size of convex hulls of small sets

Cited In (16)

• Greedy algorithms for prediction
• Optimal Kullback-Leibler aggregation in mixture density estimation by maximum likelihood
• Consistency and generalization bounds for maximum entropy density estimation
• SIEVE ESTIMATION OF THE MINIMAL ENTROPY MARTINGALE MARGINAL DENSITY WITH APPLICATION TO PRICING KERNEL ESTIMATION
• Density estimation with stagewise optimization of the empirical risk
• Multi-kernel regularized classifiers
• Approximation by finite mixtures of continuous density functions that vanish at infinity
• Unregularized online algorithms with varying Gaussians
• The optimal solution of multi-kernel regularization learning
• On approximations via convolution-defined mixture models
• Summary statistics and discrepancy measures for approximate Bayesian computation via surrogate posteriors
• A non-asymptotic approach for model selection via penalization in high-dimensional mixture of experts models
• Error bounds for functional approximation and estimation using mixtures of experts
• Analysis of error propagation in particle filters with approximation
• Approximations of conditional probability density functions in Lebesgue spaces via mixture of experts models
• Coherent mixtures of SRSWOR sampling schemes for bounded risk estimation of a finite population mean

This page was built for publication: Risk bounds for mixture density estimation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3373741)