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

1223 · Sep 202019922001200920172026
48 results for Huber-loss

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 ↗

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.

Super learner with Huber loss improves cost prediction and causal effect estimation in healthcare expenditure data.

problem Challenges in modeling healthcare expenditure distributions with standard super learning methods.
method Proposes a super learner using Huber loss, a robust loss function that down-weights outliers.
result Demonstrates appreciable finite-sample gains in cost prediction and causal effect estimation.

This paper solves hedging in incomplete markets using neural networks.

problem Hedging in incomplete markets with risk factor, illiquidity, and discrete transaction dates.
method Proposes a jump-diffusion model and uses RNN, LSTM, and Mogrifier-LSTM neural networks for hedging strategies.
result Mogrifier-LSTM is the fastest and most effective model for hedging.

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.

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.

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 proves robust M-estimators' coordinates' normality in high dimensions.

problem High-dimensional robust M-estimators' asymptotic normality.
method Develops Stein formulae for high-dimensional random vectors on the sphere.
result Asymptotic normality holds for most coordinates of robust M-estimators with convex penalty.

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.

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 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.

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 data quality assessment for structural monitoring data.

problem Ensuring reliability of structural health monitoring data.
method Probabilistic data quality assessment using a conditional diffusion model.
result Significantly improves accuracy of data quality assessment.

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.

Supervised learning is an active research area, with numerous applications in diverse fields such as data analytics, computer vision, speech and audio processing, and image understanding. In most cases, the loss functions used in machine learning assume symmetric noise models, and seek to estimate the unknown function …

2015-11-12abs ↗pdf ↗

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 ↗

Develops efficient estimators for PCA and sparse regression in the presence of oblivious outliers.

problem Estimation of PCA and sparse regression in the presence of a small fraction of corrupted data.
method Designs efficient estimators using Huber loss with non-smooth regularizers like the ℓ1 norm or nuclear norm.
result Achieves consistent estimation error approaching zero as the number of observations grows.

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.

Tensor decomposition is a well-known tool for multiway data analysis. This work proposes using stochastic gradients for efficient generalized canonical polyadic (GCP) tensor decomposition of large-scale tensors. GCP tensor decomposition is a recently proposed version of tensor decomposition that allows for a variety of…

2019-06-04abs ↗pdf ↗

Active sampling algorithm for linear regression with various norms and improved query complexity.

problem Efficiently querying a few entries of a target vector for near optimal minimizers of linear regression.
method Lewis weight sampling and active sampling algorithms for different pp norms.
result Optimal query complexity for p(0,1)p \in (0,1), 1<p<21<p<2, and 2<p<2<p<\infty.

We develop a new approach to solving classification problems, which is bases on the theory of coherent measures of risk and risk sharing ideas. The proposed approach aims at designing a risk-averse classifier. The new approach allows for associating distinct risk functional to each classes. The risk may be measured by …

2018-04-30abs ↗pdf ↗

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.

DeepCausalMMM models marketing impacts using deep learning and causal inference.

problem Traditional MMM approaches struggle with non-linear dynamics and temporal patterns.
method Combines deep learning, causal inference, and marketing science. Uses GRUs for temporal patterns and DAG structure for channel dependencies.
result Captures non-linear dynamics and temporal patterns in marketing impacts.

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.

DEQGAN uses GANs to solve differential equations without supervision.

problem Solving differential equations with neural networks.
method Generative Adversarial Networks (GANs) to learn the loss function.
result DEQGAN achieves lower mean squared errors and competitive solution accuracy compared to traditional methods.

A new Markov subsampling strategy based on Huber criterion improves data processing from noisy full data.

problem High noise level in data leads to poor performance of subsampling procedures.
method Design a Markov subsampling strategy based on Huber criterion to construct an informative subset from noisy full data.
result The estimator based on HMS is statistically consistent with a sub-Gaussian deviation bound.

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.

Paper analyzes statistical properties of log-cosh loss function.

problem No statistical analysis of log-cosh loss function in literature.
method Presented statistical properties of log-cosh loss function, compared to Cauchy distribution, and examined various statistical procedures.
result Characterized statistical properties of log-cosh loss function, including distribution, likelihood function, and Fisher information.

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.