paper-with-me

Papers

ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels

2019-10-24 · Geoffrey Chinot

We study Empirical Risk Minimizers (ERM) and Regularized Empirical Risk Minimizers (RERM) for regression problems with convex and $L$-Lipschitz loss functions. We consider a setting where $|\cO|$ malicious outliers contaminate the labels. In that case, under a local Bernstein condition, we show that the $L_2$-error rate is bounded by $ r_N + AL |\cO|/N$, where $N$ is the total number of observations, $r_N$ is the $L_2$-error rate in the non-contaminated setting and $A$ is a parameter coming from the local Bernstein condition. When $r_N$ is minimax-rate-optimal in a non-contaminated setting, the rate $r_N + AL|\cO|/N$ is also minimax-rate-optimal when $|\cO|$ outliers contaminate the label. The main results of the paper can be used for many non-regularized and regularized procedures under weak assumptions on the noise. We present results for Huber's M-estimators (without penalization or regularized by the $\ell_1$-norm) and for general regularized learning problems in reproducible kernel Hilbert spaces when the noise can be heavy-tailed.

📄 PDF Abstract BibTeX arXiv:1910.10923

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Similar Papers 제목 키워드 기반

On the robustness of minimum norm interpolators and regularized empirical risk minimizers

2020-12-01 · Geoffrey Chinot, Matthias Löffler, Sara van de Geer

This article develops a general theory for minimum norm interpolating estimators and regularized empirical risk minimizers (RERM) in linear models in the presence of additive, potentially adversarial, errors. In particul…

Near-Optimal Linear Regression under Distribution Shift

2021-06-23 · Qi Lei, Wei Hu, Jason D. Lee

Transfer learning is essential when sufficient data comes from the source domain, with scarce labeled data from the target domain. We develop estimators that achieve minimax linear risk for linear regression problems und…

regressionTransfer Learning

Bagging Robustly Learns VC Classes with Linear Sample Complexity

2026-08-13 · Omar Montasser arxiv

We revisit the problem of learning predictors robust to adversarial examples at test-time. We prove that VC classes are adversarially robustly learnable with sample complexity linear in the VC dimension $d$, providing an…

Outlier-robust sparse/low-rank least-squares regression and robust matrix completion

2020-12-12 · Philip Thompson

We study high-dimensional least-squares regression within a subgaussian statistical learning framework with heterogeneous noise. It includes $s$-sparse and $r$-low-rank least-squares regression when a fraction $\epsilon$…

Matrix Completionregressionvalid

Robust W-GAN-Based Estimation Under Wasserstein Contamination

2021-01-20 · Zheng Liu, Po-Ling Loh

Robust estimation is an important problem in statistics which aims at providing a reasonable estimator when the data-generating distribution lies within an appropriately defined ball around an uncontaminated distribution…

regression