pith. sign in

arxiv: 1805.10406 · v1 · pith:FWZGZPVMnew · submitted 2018-05-26 · 🧮 math.ST · cs.DS· cs.LG· stat.ME· stat.ML· stat.TH

Robust Nonparametric Regression under Huber's ε-contamination Model

classification 🧮 math.ST cs.DScs.LGstat.MEstat.MLstat.TH
keywords noiselocalmedianbinningepsilonregressionsmoothnessadversarial
0
0 comments X
read the original abstract

We consider the non-parametric regression problem under Huber's $\epsilon$-contamination model, in which an $\epsilon$ fraction of observations are subject to arbitrary adversarial noise. We first show that a simple local binning median step can effectively remove the adversary noise and this median estimator is minimax optimal up to absolute constants over the H\"{o}lder function class with smoothness parameters smaller than or equal to 1. Furthermore, when the underlying function has higher smoothness, we show that using local binning median as pre-preprocessing step to remove the adversarial noise, then we can apply any non-parametric estimator on top of the medians. In particular we show local median binning followed by kernel smoothing and local polynomial regression achieve minimaxity over H\"{o}lder and Sobolev classes with arbitrary smoothness parameters. Our main proof technique is a decoupled analysis of adversary noise and stochastic noise, which can be potentially applied to other robust estimation problems. We also provide numerical results to verify the effectiveness of our proposed methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form

    cs.LG 2024-08 unverdicted novelty 7.0

    Presents the first algorithm to identify an ε-optimal policy in robust constrained MDPs via epigraph form and bisection search with Õ(ε^{-4}) robust policy evaluations.