Robust density estimation over star-shaped density classes
Xiaolong Liu, Matey Neykov

TL;DR
This paper develops a new method for robust density estimation within star-shaped classes under adversarial data corruption, providing minimax bounds that account for corruption fraction and density class complexity.
Contribution
It introduces a novel criterion for comparing densities under data corruption and constructs an estimator with proven minimax bounds for star-shaped density classes.
Findings
Established a new comparison criterion for densities with corrupted data.
Derived minimax upper and lower bounds for density estimation under corruption.
Provided explicit bounds involving density class complexity and corruption fraction.
Abstract
We establish a novel criterion for comparing the performance of two densities, and , within the context of corrupted data. Utilizing this criterion, we propose an algorithm to construct a density estimator within a star-shaped density class, , under conditions of data corruption. We proceed to derive the minimax upper and lower bounds for density estimation across this star-shaped density class, characterized by densities that are uniformly bounded above and below (in the sup norm), in the presence of adversarially corrupted data. Specifically, we assume that a fraction of the observations are arbitrarily corrupted. We obtain the minimax upper bound . Under certain conditions, we obtain the minimax risk, up to proportionality constants, under the squared loss as $$…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference
MethodsSparse Evolutionary Training
