Papers
Topics
Authors
Recent
Search
2000 character limit reached

Robust density estimation over star-shaped density classes

Published 17 Jan 2025 in math.ST, stat.ML, and stat.TH | (2501.10025v1)

Abstract: We establish a novel criterion for comparing the performance of two densities, g1g_1 and g2g_2, within the context of corrupted data. Utilizing this criterion, we propose an algorithm to construct a density estimator within a star-shaped density class, F\mathcal{F}, 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 ϵ≤13\epsilon \leq \frac{1}{3} of the NN observations are arbitrarily corrupted. We obtain the minimax upper bound max⁡τJ‾<sup>2,</sup>ϵ∧d<sup>2\max{ \tau_{\overline{J}}<sup>2,</sup> \epsilon } \wedge d<sup>2. Under certain conditions, we obtain the minimax risk, up to proportionality constants, under the squared L2L_2 loss as $$ \max\left{ \tau<sup>{*2}</sup> \wedge d<sup>2,</sup> \epsilon \wedge d<sup>2</sup> \right}, $$ where $\tau<sup>*</sup> := \sup\left{ \tau : N\tau<sup>2</sup> \leq \log \mathcal{M}<em>{\mathcal{F}}<sup>{\text{loc}}(\tau,</sup> c) \right}$ for a sufficiently large constant cc. Here, M</em>F<sup>loc(τ,</sup>c)\mathcal{M}</em>{\mathcal{F}}<sup>{\text{loc}}(\tau,</sup> c) denotes the local entropy of the set F\mathcal{F}, and dd is the L2L_2 diameter of F\mathcal{F}.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 4 likes about this paper.