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

Trend · papers per month

77154230307 · Jun 202019922001200920172026
48 results for tail loss

Gradient descent implicitly follows regularization for general losses.

problem The implicit bias of gradient descent methods in machine learning.
method Empirical risk minimization over linear predictors with arbitrary convex, strictly decreasing losses.
result Gradient descent and regularization paths converge to the same direction for non-attained risks.

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.

We provide a detailed study on the implicit bias of gradient descent when optimizing loss functions with strictly monotone tails, such as the logistic loss, over separable datasets. We look at two basic questions: (a) what are the conditions on the tail of the loss function under which gradient descent converges in the…

2018-03-05abs ↗pdf ↗

Paper presents a Bayesian-decision-theory framework for long-tailed classification.

problem Heavy imbalance and asymmetric misprediction costs in long-tailed datasets.
method Bayesian-decision-theory perspective, unifying re-balancing and ensemble methods.
result Improves accuracy for all classes, especially tails, with provably optimal decisions.

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.

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.

A new tail-shape index based on Value at Risk and Expected Shortfall.

problem Measuring and comparing tail behavior of loss distributions.
method Introducing a new θθ-index based on equal level relationships between Value at Risk and Expected Shortfall.
result The θθ-index provides a level-dependent, scale-free measure of upper tail behavior.

New bounds on neural network test loss derived from conditional information measures.

problem Estimating test loss of neural networks trained on limited data.
method Framework based on conditional information density between hypothesis and training set.
result Tail bounds on test loss decay as 1/n, improving over previous 1/sqrt{n} bounds.

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

New method allocates capital based on tail central moments for financial risk assessment.

problem Inability of CTE-based capital allocation to reflect tail behavior of losses.
method Developed TCM-based capital allocation for normal mean-variance mixture distributions.
result TCM-based method captures tail risk contributions not detected by CTE.

We introduce a statistical model for operational losses based on heavy-tailed distributions and bipartite graphs, which captures the event type and business line structure of operational risk data. The model explicitly takes into account the Pareto tails of losses and the heterogeneous dependence structures between the…

2019-02-08abs ↗pdf ↗

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.

The paper examines how small positive dependence can lead to correlated tail risks.

problem Understanding the impact of dependence uncertainty on tail risk measures.
method Introducing a regular dependence measure and analyzing the aggregation of risks.
result Small positive dependence can result in perfectly correlated tail risks.

New loss function restores importance weighting in overparameterized models.

problem Restoring importance weighting in overparameterized neural networks.
method Introduced polynomially-tailed losses to restore effects of importance weighting.
result Polynomially-tailed losses improve performance in correcting distribution shift.

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.

Paper improves PAC-Bayes bounds for various loss types.

problem Improving PAC-Bayes bounds for different types of losses.
method Introducing new high-probability PAC-Bayes bounds for bounded and general tail behaviors losses, and extending to anytime-valid bounds.
result New fast-rate and mixed-rate bounds for losses with bounded ranges, and parameter-free bounds for losses with general tail behaviors.

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 ↗

Mitigates anomaly score imbalance in long-tailed distributions.

problem Class imbalance in normal data leads to skewed anomaly detection performance.
method Proposes an importance-weighted loss function to balance anomaly scores.
result Improves anomaly detection performance by 0.043 on real-world datasets.

Two-Tailed Averaging improves generalization by optimizing the number of leading iterates to ignore.

problem Improving generalization in stochastic optimization with limited resources and hyperparameters.
method An anytime adaptive algorithm that balances the number of leading iterates to ignore for better generalization.
result Approximates the optimal tail at all optimization steps, improving generalization without hyperparameters.

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.

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.

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.

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.

Study improves recognition of long-tail visual relationships.

problem Improving recognition of structured visual relationships from long-tail classes.
method Developed two benchmarks, introduced VilHub loss, and applied RelMix augmentation.
result Simple techniques significantly improved performance on tail classes.

This work extends implicit bias analysis to multiclass classification using a new loss framework.

problem The implicit bias of gradient descent on multiclass data without explicit regularization.
method Employing the PERM framework to introduce a multiclass extension of the exponential tail property.
result Extended implicit bias result to multiclass classification using a new loss framework.

The goal of this paper is to study organized flocking behavior and systemic risk in heterogeneous mean-field interacting diffusions. We illustrate in a number of case studies the effect of heterogeneity in the behavior of systemic risk in the system, i.e., the risk that several agents default simultaneously as a result…

2016-07-28abs ↗pdf ↗

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.

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.

Using the framework of factor models, we establish the general expression of the coefficient of tail dependence between the market and a stock (i.e., the probability that the stock incurs a large loss, assuming that the market has also undergone a large loss) as a function of the parameters of the underlying factor mod…

2002-02-20abs ↗pdf ↗

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.

New method estimates extreme outcomes in heavy-tailed data, breaking circular dependence.

problem Estimating outcomes for extreme events in heavy-tailed data.
method Proposes an ADRF estimator that includes a structured tail-shape output and a diagnostic to evaluate tail shape.
result Successfully reduces MAE in deep-tail and conditional-shortfall predictions.

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.

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 ↗

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.

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.