Revisiting Le Cam's Equation: Exact Minimax Rates over Convex Density Classes

2022-10-20 · Shamindra Shrotriya, Matey Neykov

We study the classical problem of deriving minimax rates for density estimation over convex density classes. Building on the pioneering work of Le Cam (1973), Birge (1983, 1986), Wong and Shen (1995), Yang and Barron (1999), we determine the exact (up to constants) minimax rate over any convex density class. This work thus extends these known results by demonstrating that the local metric entropy of the density class always captures the minimax optimal rates under such settings. Our bounds provide a unifying perspective across both parametric and nonparametric convex density classes, under weaker assumptions on the richness of the density class than previously considered. Our proposed `multistage sieve' MLE applies to any such convex density class. We further demonstrate that this estimator is also adaptive to the true underlying density of interest. We apply our risk bounds to rederive known minimax rates including bounded total variation, and Holder density classes. We further illustrate the utility of the result by deriving upper bounds for less studied classes, e.g., convex mixture of densities.

📄 PDF Abstract BibTeX arXiv:2210.11436

Code (0)

등록된 구현이 없습니다.

Tasks

Density Estimation

Methods 이 논문이 사용한 방법론

CAM Class activation maps could be used to interpret the prediction decision made by the convolutional neural network (CNN). Image source: [Learning Deep Features for…

Minimax Regret Optimisation for Robust Planning in Uncertain Markov Decision Processes

2020-12-08 · Marc Rigter, Bruno Lacerda, Nick Hawes

The parameters for a Markov Decision Process (MDP) often cannot be specified exactly. Uncertain MDPs (UMDPs) capture this model ambiguity by defining sets which the parameters belong to. Minimax regret has been proposed …

Posterior Concentration of Bayesian Physics-Informed Neural Networks for Elliptic PDEs

2026-05-09 · Yuxuan Zhao, Yulong Lu arxiv

We study the posterior contraction rate of Bayesian Physics-Informed Neural Networks (PINNs) for solving a general class of elliptic partial differential equations (PDEs). We focus on learning of the elliptic equation wi…

Flow matching achieves almost minimax optimal convergence

2024-05-31 · Kenji Fukumizu, Taiji Suzuki, Noboru Isobe, Kazusato Oko 외

Flow matching (FM) has gained significant attention as a simulation-free generative model. Unlike diffusion models, which are based on stochastic differential equations, FM employs a simpler approach by solving an ordina…

The Hamilton-Jacobi Theory of Deep Learning

2026-05-27 · Jose Marie Antonio Miñoza, Erika Fille T. Legara, Christopher P. Monterola arxiv

In this paper, training a neural network is identified, exactly, as a search through Hamilton--Jacobi initial-value problems: each gradient step selects the initial data of a viscous Hamilton--Jacobi equation whose Hopf-…

Adversarial Robustness

Reconciling Universal and Uniform Learning with $Q$-Aggregation

2026-09-04 · Mikael Møller Høgsgaard, Patrick Rebeschini, Tobias Wegel arxiv

We study regression under bounded responses in terms of excess mean squared error. When the comparator class is finite, this setting is known as model selection aggregation, and achieving minimax excess risk requires imp…