Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

591418 · May 202619922001200920172026
48 results for Huber contamination

Improved robust regression with clean covariates achieves better rates than Huber's model.

problem Robust regression under adaptive contamination of responses with clean covariates.
method Exploiting clean covariates to construct an estimator achieving better rates than Huber's model.
result Improved estimation rate even with constant contamination, achieving consistency.

New proof shows faster convergence rate for robust estimation with Lasso in adversarially contaminated outputs.

problem Robust estimation of parameters in the presence of adversarial output contamination.
method Extended Lasso with Huber loss function and L1L_1 penalty, focusing on specific properties of the Huber function.
result Same convergence rate as Dalalyan and Thompson (2019), but with a different proof.

Robust estimators for Gaussian sparse tasks with optimal error under contamination.

problem Robust mean estimation, PCA, and linear regression in the presence of Huber contamination.
method Novel multidimensional filtering method for sparse regime.
result Optimal error guarantees within constant factors for Gaussian robust kk-sparse mean estimation.

Improved robust regression for heavy-tailed and contaminated data.

problem Linear regression with heavy-tailed and adversarially contaminated covariates and responses.
method Applying a filtering algorithm to covariates and then using Huber regression, least trimmed squares, or least absolute deviation estimators on the remaining data.
result Near-optimal error rates achieved for the Huber regression estimator.

Near-optimal algorithms for mean estimation and linear regression with Gaussian covariates and Huber contamination.

problem Gaussian mean estimation and linear regression with Gaussian covariates in the presence of Huber contamination.
method Near-optimal algorithms with optimal error guarantees, achieving sample complexity n=ildeO(d/ε2)n = ilde{O}(d/ε^2) and almost linear runtime.
result First sample near-optimal and almost linear-time algorithms with optimal error guarantees for both problems.

Study minimax rates for density estimation under Huber contamination and Besov IPM losses.

problem Minimax convergence rates of nonparametric density estimation under Huber contamination model with outliers.
method Re-scaled thresholding wavelet series estimator and GAN architectures.
result Achieves minimax optimal convergence rates under Besov IPM losses.

A robust loss for anomaly mitigation and unsupervised contamination classification

problem Detecting and mitigating contamination in supervised and unsupervised settings
method Neural Bayesian Anomaly Mitigation (NBAM)
result Recovering the structure of contamination and identifying label-flip pairs

In this paper, we develop connections between two seemingly disparate, but central, models in robust statistics: Huber's epsilon-contamination model and the heavy-tailed noise model. We provide conditions under which this connection provides near-statistically-optimal estimators. Building on this connection, we provide…

2019-07-01abs ↗pdf ↗

Study sample complexity of robust binary hypothesis testing under different contamination models.

problem Analyzing the sample complexity of robust binary hypothesis testing under various contamination models.
method Examined three standard contamination models: ε-additive (Huber), ε-subtractive, and ε-total variation (TV). Provided explicit formulas for least favourable distributions and compared sample complexities across models.
result Sample complexities are highly unstable in the contamination parameter ε and comparable up to constant-factor rescaling of ε across models.

Study minimax robustness in statistical estimation under Wasserstein contamination.

problem Adversarial perturbations in statistical data.
method Developed minimax theory for qr\ell_q^r losses under Wasserstein-rr contaminations.
result Exact minimax risk identified for joint contaminations in location estimation and prediction in linear regression.

New algorithms improve robust estimation in contaminated Gaussian models.

problem Simultaneous estimation of location and variance matrix in contaminated Gaussian models.
method Tractable adversarial algorithms with spline discriminators for robust estimation.
result Achieve minimax optimal rates or near-optimal rates under Huber's contamination model.

New algorithms robust to adversarial data achieve optimal performance.

problem Adversarial robustness in high-dimensional online learning problems.
method Alternating minimization scheme combining least-squares and convex reweighting.
result Achieves optimal robustness guarantees without distributional assumptions.

Paper presents robust confidence sequences for means with known moment bounds and arbitrary corruption.

problem Tackles robustness to outliers and adversarial corruptions in mean estimation.
method Designs new robust exponential supermartingales to create confidence sequences.
result Achieves optimal width and shows smaller margin of error compared to fixed-time robust methods.

This paper studies robust regression in the settings of Huber's εε-contamination models. We consider estimators that are maximizers of multivariate regression depth functions. These estimators are shown to achieve minimax rates in the settings of εε-contamination models for various regression problems including nonpa…

2017-02-15abs ↗pdf ↗

A new robust Wasserstein distance is proposed to handle outliers in probability distributions.

problem Outliers in probability distributions make Wasserstein distances sensitive and impractical.
method Introduces a new outlier-robust Wasserstein distance Wpε\mathsf{W}_p^\varepsilon.
result Achieves strong robust estimation guarantees under the Huber ε\varepsilon-contamination model.

Robustly estimates linear regression coefficients with adversarial and noisy data.

problem Estimating robust linear regression coefficients with adversarial and noisy data.
method Adversarial robust weighted Huber regression with polynomial computational complexity.
result Derives an estimation error bound that depends on the stable rank and condition number of the covariance matrix.

Efficient streaming algorithms for robust statistics with near-optimal memory.

problem High-dimensional robust statistics tasks in streaming model.
method First efficient streaming algorithms with near-optimal memory requirements.
result Near-optimal error guarantees and space complexity nearly-linear in the dimension for robust mean estimation.

We consider the non-parametric regression problem under Huber's εε-contamination model, in which an εε 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 t…

2018-05-26abs ↗pdf ↗

SHIFT improves robustness in estimating dose-response functions with heavy-tailed contamination.

problem Outliers bias estimates of average dose-response functions in heavy-tailed data.
method SHIFT combines cross-fit nuisance orthogonalization, Welsch-loss, and defensive OLS refit.
result SHIFT reduces RMSE from 1.03 to 0.33 on localized contamination test.

Bayesian X-Learner calibrates uncertainty and robustness for CATE estimation under heavy-tailed data.

problem Estimating heterogeneous treatment effects with calibrated uncertainty and robustness to heavy-tailed outcomes.
method Bayesian X-Learner using cross-fitted doubly robust pseudo-outcomes and MCMC for a full posterior over CATE.
result Bayesian X-Learner achieves robust and calibrated CATE estimation on real and contaminated data.

Study enhances robustness of In-CVaR based regression models under perturbation and contamination.

problem Enhancing robustness of nonlinear regression models under perturbation and contamination.
method Introduces interval conditional value-at-risk (In-CVaR) and rigorously analyzes its robustness properties under both perturbation and contamination.
result The In-CVaR based estimator is qualitatively robust in terms of the Prokhorov metric if and only if the largest portion of losses is trimmed.

Efficiently estimates mean in contaminated Gaussian data with near-optimal sample complexity.

problem Robust mean estimation in the presence of mean-shift contamination.
method First computationally efficient algorithm with near-optimal sample complexity and polynomial-time running.
result Approximates the target mean to any desired accuracy with constant fraction of outliers tolerated.

LARF improves random forests with attention mechanisms and contamination models.

problem Improving accuracy in classification tasks with random forests.
method Introduces a two-level attention mechanism and uses a mixture of contamination models.
result Significantly improved classification performance on various datasets.

Robust covariance testing requires significantly more samples in contaminated data.

problem Testing the covariance matrix of a high-dimensional Gaussian in the presence of contamination.
method We study the problem in the Huber's contamination model, distinguishing between the identity matrix and matrices far from it in Frobenius norm.
result The sample complexity of covariance testing increases dramatically to Ω(d2)Ω(d^2) in the contaminated setting.

New method calibrates ambiguity sets for robust decision-making under contamination.

problem Minimizing worst-case expected loss over distributional shifts in out-of-sample environments.
method Bulk-calibrated credal ambiguity sets that learn a high-mass bulk set from data and bound tail contributions.
result Closed-form, finite robust objective and tractable optimization for various losses and geometries.

Unified approach for robust low rank matrix estimation with adversaries.

problem Robust low rank matrix estimation in the presence of adversaries.
method Unified approach combining Huber loss and nuclear norm penalization.
result Sharp estimation error bounds for matrix compressed sensing and completion.

We solve robust regression and matrix completion problems with sparse and low-rank models.

problem Adversarial contamination and noisy matrix completion in high-dimensional settings.
method Subgaussian statistical learning framework, trace-regression with matrix decomposition, novel Huber-type loss.
result Near-optimal estimation rates for robust regression and matrix completion.

Heavy-tailed outliers are more resilient to robust estimation than adversarial ones.

problem Developing robust estimators for data with outliers.
method Analyzing the relationship between adversarial and heavy-tailed outlier models.
result Optimal estimators for heavy-tailed outliers are also optimal for adversarial settings, but not vice versa.

We provide a new computationally-efficient class of estimators for risk minimization. We show that these estimators are robust for general statistical models: in the classical Huber epsilon-contamination model and in heavy-tailed settings. Our workhorse is a novel robust variant of gradient descent, and we provide cond…

2018-02-19abs ↗pdf ↗

The paper develops adaptive confidence intervals for Efron's Gaussian two-groups model with unknown contamination.

problem Developing robust uncertainty quantification for Efron's Gaussian two-groups model with unknown contamination fraction.
method The approach involves Fourier-based certification procedures to find minimax-optimal adaptive confidence intervals.
result The minimax-optimal length of adaptive confidence intervals is polynomially worse than when contamination fraction is known.

New method recovers sparse signals from nonlinear observations with robust error bounds.

problem Recovering two sparse vectors from nonlinearly mixed observations with limited data.
method Regularization-based framework combining Huberized data fidelity and generalized folded-concave penalties with a proximal alternating algorithm.
result Estimation error bounds of order σslog(n)/mσ\sqrt{s\log(n)/m} at every localized stationary point, with oracle rate σs/mσ\sqrt{s/m} under beta-min condition.

Study examines robust regression in high dimensions with heavy-tailed data.

problem Analyzing robust regression in high-dimensional settings with heavy-tailed data.
method Sharp asymptotic characterisation of M-estimators and ridge regression in elliptical distributions.
result Ridge regression is optimal and universal for finite second moments but can decay faster without them.

Estimating average causal effect (ACE) is useful whenever we want to know the effect of an intervention on a given outcome. In the absence of a randomized experiment, many methods such as stratification and inverse propensity weighting have been proposed to estimate ACE. However, it is hard to know which method is opti…

2019-07-10abs ↗pdf ↗

Paper proposes an algorithm for robust estimation using Huber's criterion.

problem Non-convexity and non-robustness of joint maximum likelihood estimation.
method Block-wise minimization majorization framework with data-adaptive step sizes.
result Improved convergence and robustness in sparse learning.

Generalized Huber's theorem for specific manifold curvature types.

problem Finite point conformal compactification on manifolds with certain curvature integrability.
method Generalization of Huber's theorem to higher dimensions with $L^ rac{n}{2}$ integrable Ricci curvatures.
result Validated finite point conformal compactification theorem for new class of manifolds.

Huber regression assessed for robustness in statistical learning.

problem Understanding Huber regression in nonparametric statistical learning.
method Assessment from statistical learning perspective, focusing on risk consistency, adaptive tuning, and convergence rates.
result Huber regression can be asymptotically mean regression calibrated under (1+ε)(1+ε)-moment conditions, justifying its robustness.

Robust estimation under Huber's εε-contamination model has become an important topic in statistics and theoretical computer science. Statistically optimal procedures such as Tukey's median and other estimators based on depth functions are impractical because of their computational intractability. In this paper, we est…

2018-10-04abs ↗pdf ↗