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,742 papers · 148 categories

Trend · papers per month

74147221294 · Jun 202019922001200920172026
48 results for heavy-tailed losses

Improved privacy-preserving methods for convex optimization with heavy-tailed data.

problem Privacy-preserving optimization of convex functions with heavy-tailed data.
method Developed algorithms for private mean estimation and convex optimization under concentrated differential privacy constraints.
result Achieved improved upper bounds on excess population risk for convex and strongly convex loss functions.

Optimizes hybrid insurance contracts for heavy-tailed losses.

problem Providing insurance against heavy-tailed losses with finite expected loss.
method Combines traditional and parametric insurance, using a Pareto-type criterion for optimization.
result The hybrid contract outperforms traditional contracts in simulations and real data.

Derives derivatives of risk measures for various types of portfolio losses.

problem Calculating precise risk measures for portfolio losses.
method Analyzes first and second order derivatives of risk measures for both continuous and discrete portfolio loss scenarios.
result Provides asymptotic results for conditional moments of heavy-tailed portfolio losses.

New algorithms avoid a dominant lower-order term in heavy-tailed loss settings.

problem Prediction with heavy-tailed losses without prior knowledge.
method Adaptive algorithms that avoid the maximum of losses as a lower-order term in regret.
result Improved regret bounds of O(θTlog(K))\mathcal{O}(\sqrt{θT\log(K)}) and O(θlog(KT)/Δmin)\mathcal{O}(θ\log(KT)/Δ_{\min}).

Exponential Lasso improves Lasso's robustness to outliers and heavy-tailed noise.

problem Lasso's sensitivity to outliers and heavy-tailed noise in high-dimensional statistics.
method Integrates an exponential-type loss function into the Lasso framework.
result Achieves strong statistical convergence rates robust to heavy-tailed contamination.

Optimizes privacy-preserving optimization for heavy-tailed data.

problem Privacy-preserving optimization with heavy-tailed gradients.
method Pure ε-differential privacy framework for Lipschitz extensions.
result Minimax optimal excess-risk rate for pure ε-DP heavy-tailed SCO.

Adam outperforms gradient descent on language models due to handling heavy-tailed class imbalance.

problem Heavy-tailed class imbalance in language tasks.
method Comparing Adam and gradient descent on various architectures and data types, focusing on the impact of class imbalance.
result Class imbalance causes slow convergence for gradient descent, while Adam and sign-based methods are less affected.

New bounds link SGD's generalization to heavy tails without topological assumptions.

problem Linking SGD's generalization error to heavy tails without additional assumptions.
method Developed Wasserstein stability bounds for heavy-tailed SDEs and their discretizations, converting to generalization bounds.
result Generalization bounds for a broader class of objective functions, including non-convex functions, without topological assumptions.

Work on SGDm under heavy-tailed noise, revealing its generalization properties.

problem Understanding generalization of SGDm under heavy-tailed noise.
method Analysis of continuous-time limit (SDE) and discrete-time SGDm, establishing generalization bounds.
result SGDm can have worse generalization in the presence of heavy-tailed noise for quadratic loss functions.

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.

In this paper, we consider the problem of linear regression with heavy-tailed distributions. Different from previous studies that use the squared loss to measure the performance, we choose the absolute loss, which is capable of estimating the conditional median. To address the challenge that both the input and output c…

2018-05-02abs ↗pdf ↗

We improve generative models for heavy-tailed multivariate data using an invariant statistical loss.

problem Traditional generative models struggle with heavy-tailed and multivariate data, leading to unstable training and mode dropping.
method We extend the invariant statistical loss method to handle heavy-tailed and multivariate data using a Pareto-ISL generator trained with input noise from a generalised Pareto distribution.
result Pareto-ISL accurately models the tails of heavy-tailed distributions while capturing central characteristics.

The study analyzes a model for aggregate losses with dependent and overdispersed inter-losses times.

problem Analyzing aggregate loss models with dependent and overdispersed inter-losses times.
method The study uses a two-state Markovian arrival process (MAP2) and a Markov renewal process to model the inter-losses times. Severities are modeled using a heavy-tailed, double-Pareto Lognormal distribution. The model is estimated via direct maximization of the likelihood function.
result The model with dependence and overdispersion in inter-losses times leads to higher capital charges compared to a Poisson process.

We study fast learning rates when the losses are not necessarily bounded and may have a distribution with heavy tails. To enable such analyses, we introduce two new conditions: (i) the envelope function supfFf\sup_{f \in \mathcal{F}}|\ell \circ f|, where \ell is the loss function and F\mathcal{F} is the hypothesis class…

2016-09-29abs ↗pdf ↗

We derive PAC-Bayesian learning guarantees for heavy-tailed losses, and obtain a novel optimal Gibbs posterior which enjoys finite-sample excess risk bounds at logarithmic confidence. Our core technique itself makes use of PAC-Bayesian inequalities in order to derive a robust risk estimator, which by design is easy to …

2019-05-20abs ↗pdf ↗

Learning with a {\it convex loss} function has been a dominating paradigm for many years. It remains an interesting question how non-convex loss functions help improve the generalization of learning with broad applicability. In this paper, we study a family of objective functions formed by truncating traditional loss f…

2018-05-21abs ↗pdf ↗

Studied how heavy-tailed behavior affects SGD's generalization in quadratic optimization.

problem Link between heavy-tailed behavior and generalization in SGD.
method Used heavy-tailed stochastic differential equation and proved stability bounds.
result Stability of SGD depends on the loss function's tail behavior.

New algorithm finds critical points in non-convex optimization with heavy-tailed gradients.

problem Non-convex stochastic optimization with heavy-tailed gradient estimates.
method Gradient clipping, momentum, and normalized gradient descent.
result High-probability convergence to critical points with best-known rates.

Improved DP SO with large Lipschitz parameters, handling outliers and heavy-tailed data.

problem Differential privacy in stochastic optimization with large Lipschitz parameters.
method Assumes bounded k-th order moments, provides linear-time algorithms for smooth convex and non-smooth convex losses.
result Improved risk bounds scaling with k-th moment, not uniform Lipschitz parameter.

Study connects covariance cleaning theory to information theory for heavy-tailed distributions.

problem Optimizing covariance matrices for heavy-tailed distributions using information theory.
method Minimizing Frobenius norm and information loss between true and estimated covariance matrices.
result Asymptotic regime of large matrices minimizes information loss for Student's t distributions.

The paper explores how benign overfitting occurs in heavy-tailed input distributions.

problem Understanding overfitting in heavy-tailed input distributions.
method Analysis of maximum margin classifiers on unregularized logistic loss with gradient descent.
result Linear classifiers trained under certain conditions can asymptotically achieve the noise level as misclassification error.

This work studies applications and generalizations of a simple estimation technique that provides exponential concentration under heavy-tailed distributions, assuming only bounded low-order moments. We show that the technique can be used for approximate minimization of smooth and strongly convex losses, and specificall…

2013-07-07abs ↗pdf ↗

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.

Privacy-preserving SGD with heavy-tailed noise achieves differential privacy guarantees.

problem Privacy preservation in noisy SGD with heavy-tailed noise.
method Differential privacy guarantees for SGD with heavy-tailed noise.
result SGD with heavy-tailed perturbations achieves (0,O(1/n))(0, O(1/n))-DP.

TailedTS dataset benchmarks heavy-tailed time series forecasting and periodicity quantification.

problem Benchmarking robustness of time series models under heavy-tailed distributions.
method Derived from Wikipedia page views, introduces periodicity quantification and robust loss functions.
result Standard Gaussian models degrade on high-volume page categories, while robust alternatives perform consistently.

A new algorithm improves both computational efficiency and statistical optimality for robust low-rank matrix and tensor estimation.

problem Challenges in low-rank matrix estimation under heavy-tailed noise, both computationally and statistically.
method Riemannian sub-gradient (RsGrad) algorithm, which is computationally efficient and statistically optimal.
result RsGrad achieves linear convergence and statistical optimality for robust loss functions under Gaussian and heavy-tailed noise.

This paper studies distributed estimation and support recovery for high-dimensional linear regression model with heavy-tailed noise. To deal with heavy-tailed noise whose variance can be infinite, we adopt the quantile regression loss function instead of the commonly used squared loss. However, the non-smooth quantile …

2019-06-13abs ↗pdf ↗

DE-SGD shows heavy-tailed behavior in decentralized settings.

problem Heavy-tailed behavior in decentralized SGD.
method Analyzes the emergence of heavy-tails in DE-SGD, considering both quadratic and twice continuously differentiable strongly convex loss functions.
result DE-SGD exhibits heavier tails than centralized SGD, and tail behavior depends on network parameters.

Paper addresses DP-SCO on heavy-tailed data, providing methods and results.

problem Designing DP algorithms for SCO on heavy-tailed data.
method Sample-and-aggregate framework, gradient smoothing and trimming.
result Achieved DP guarantees for various loss functions with different excess population risks.

Robust X-Learner improves HTE estimation in imbalanced and heavy-tailed data.

problem Estimating HTE in imbalanced and heavy-tailed data.
method Integrates γ-divergence objective and Proxy Hessian strategy into gradient boosting.
result Reduces PEHE metric by 98.6% in semi-synthetic Criteo Uplift dataset.

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.

We propose an analytical approach to the computation of tail probabilities of compound distributions whose individual components have heavy tails. Our approach is based on the contour integration method, and gives rise to a representation of the tail probability of a compound distribution in the form of a rapidly conve…

2017-10-03abs ↗pdf ↗

New study shows diversification can increase risk for heavy-tailed losses.

problem Diversification can increase tail risk for heavy-tailed losses.
method Comparison of diversified portfolio to a 'one-basket' benchmark.
result Diversified portfolio has larger tail probabilities than a 'one-basket' benchmark for all thresholds.

Under the Basel II standards, the Operational Risk (OpRisk) advanced measurement approach is not prescriptive regarding the class of statistical model utilised to undertake capital estimation. It has however become well accepted to utlise a Loss Distributional Approach (LDA) paradigm to model the individual OpRisk loss…

2011-02-17abs ↗pdf ↗