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

111223334445 · Jun 202019922001200920172026
48 results for adaptive Huber regression

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.

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.

This paper examines how noise affects deep neural networks and improves their performance.

problem The impact of noise on the stability of deep ReLU neural networks for nonparametric regression.
method Investigates the optimal rate of convergence for deep ReLU neural networks under Huber loss, considering the p-th moment of noise and the smoothness of the function.
result The optimal rate of convergence cannot be achieved by ordinary least squares but can be by Huber loss with a properly chosen parameter.

Paper supports robust estimation in regression with heavy-tailed errors.

problem Support estimation in high-dimensional heteroscedastic mean regression.
method Use of Huber loss function and adaptive LASSO penalty for robust estimation.
result Sign-consistency and optimal rates of convergence in \ell_\infty norm.

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.

We present a new method for high-dimensional linear regression when a scale parameter of the additive errors is unknown. The proposed estimator is based on a penalized Huber MM-estimator, for which theoretical results on estimation error have recently been proposed in high-dimensional statistics literature. However, t…

2018-11-06abs ↗pdf ↗

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.

The paper introduces a new FOR framework using Huber and ε-insensitive losses.

problem Handling outliers and sparsity in functional output regression.
method Proposes a flexible FOR framework with infimal convolution losses and computable algorithms.
result Demonstrates efficiency and effectiveness on synthetic and real-world data.

Two algorithms tackle heavy-tailed rewards in reinforcement learning with linear function approximation.

problem Online sequential decision-making with heavy-tailed rewards.
method AdaOFUL and VARA algorithms for linear stochastic bandits and MDPs, using modified adaptive Huber regression.
result Achieved state-of-the-art and variance-aware regret bounds for heavy-tailed rewards.

New algorithm recovers sparse signals robustly against Gaussian noise and adaptive adversaries.

problem Designing efficient estimators for sparse linear regression in the presence of two adversaries.
method Polynomial-time algorithms using sum-of-squares relaxations and weighted Huber loss minimization.
result Achieves error o(ε)o(\sqrt{\varepsilon}) for various distributions and adversaries.

Study improves error bounds for sparse regression with heavy-tailed covariates.

problem Estimating sparse coefficients in linear regression with heavy-tailed covariates.
method Employed an 1\ell_1-penalized Huber regression method.
result Error bound identical to Gaussian case for LL-subexponential covariates.

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.

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.

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.

Study improves robust nonparametric regression in heavy-tailed noise.

problem Robust nonparametric regression with heavy-tailed noise and unbounded functions.
method Huber regression in reproducing kernel Hilbert spaces (RKHS), probabilistic effective hypothesis space, new comparison theorems.
result Explicit finite-sample error bounds and convergence rates for Huber regression in RKHS under heavy-tailed noise.

The Huber loss is a robust loss function used for a wide range of regression tasks. To utilize the Huber loss, a parameter that controls the transitions from a quadratic function to an absolute value function needs to be selected. We believe the standard probabilistic interpretation that relates the Huber loss to the H…

2019-11-05abs ↗pdf ↗

A robust Gaussian process model using Huber likelihood for outlier resistance.

problem Outliers in observational data sets affect Gaussian process regression's robustness.
method Proposes a Gaussian process model with Huber likelihood and weights based on projection statistics.
result Demonstrates improved statistical efficiency and robustness to outliers.

This paper investigates tradeoffs among optimization errors, statistical rates of convergence and the effect of heavy-tailed errors for high-dimensional robust regression with nonconvex regularization. When the additive errors in linear models have only bounded second moment, we show that iteratively reweighted $\ell_1…

2019-07-09abs ↗pdf ↗

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.

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 ↗

We consider new formulations and methods for sparse quantile regression in the high-dimensional setting. Quantile regression plays an important role in many applications, including outlier-robust exploratory analysis in gene selection. In addition, the sparsity consideration in quantile regression enables the explorati…

2014-02-19abs ↗pdf ↗

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 ↗

New robust regression method works with fewer data points than previous methods.

problem Adversary can corrupt most of the data, making traditional regression models unreliable.
method Developed a Huber loss estimator for robust linear regression with nearly linear sample size and inverse-polynomial inlier fraction.
result The Huber loss estimator is consistent for nearly linear sample size and inverse-polynomial inlier fraction.

AdapDISCOM tackles high-dimensional multimodal data with missingness and errors, improving prediction and biomarker selection.

problem High-dimensional multimodal data with block-wise missingness and measurement errors.
method AdapDISCOM introduces modality-specific weighting schemes to address heterogeneity and error magnitudes.
result AdapDISCOM consistently outperforms existing methods under heterogeneous contamination and heavy-tailed distributions.

Study robust linear regression with outliers, providing exact asymptotics for ERM performance.

problem Robust linear regression in high-dimension with outliers.
method Analyzes 2\ell_2, 1\ell_1, and Huber losses, providing asymptotic performance metrics.
result Optimally-regularised ERM is asymptotically consistent with simple calibration, but Huber loss requires norm calibration.

New robust method for high-dimensional data analysis in imaging studies.

problem Analyzing high-dimensional data with complex dependence and outliers.
method Robust high-dimensional regression with coefficient thresholding and Huber loss.
result Statistical consistency and computational convergence under high-dimensional settings.

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.

A new framework for time series forecasting that adapts to varying patterns.

problem Forecasting multivariate time series with predictive heterogeneity.
method Validation-driven clustering framework that applies specialization based on out-of-sample predictive performance.
result Improves robustness to heavy-tailed errors and local anomalies.

Heavy Lasso improves robustness in high-dimensional linear regression with heavy-tailed errors.

problem Challenges of classical Lasso in handling heavy-tailed noise and outliers.
method Data-augmented soft-thresholding with Student's t-distribution loss.
result Heavy Lasso achieves comparable rates to Huber loss under theoretical bounds.

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.

Smooth DNNs mitigate the curse of dimensionality in uniform convergence for various regression tasks.

problem The curse of dimensionality in uniform convergence of ReLU networks.
method Analysis of smoothly activated deep neural networks (smooth DNNs), establishing pseudo-dimension bounds and non-asymptotic approximation guarantees.
result Smooth DNNs achieve non-asymptotic uniform convergence rates across multiple statistical contexts, mitigating the curse of dimensionality.

Paper introduces a new robust loss function for RL.

problem Heuristic selection of threshold parameters in quantile Huber loss.
method Derived from Wasserstein distance, captures noise in quantile values.
result Enhances robustness against outliers and enables parameter adjustment.

Unified framework for fair regression under demographic parity.

problem Ensuring fairness in regression tasks subject to demographic parity constraints.
method Proposes a unified framework applicable to various regression tasks with a broad spectrum of loss functions, derived a novel characterization of the fair risk minimizer, and established theoretical consistency and convergence rates.
result Effective minimization of risk while satisfying fairness constraints across various regression settings.