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

57114171228 · Jun 202019922001200920172026
48 results for tail probability

New bounds on continuous random variables' right-tail probabilities.

problem Finding precise upper and lower limits for right-tail probabilities of continuous random variables.
method Developed new bounds based on PDF, first derivative, and two parameters.
result The new bounds are tight for various continuous random variables.

SS-GEN simulates rare events in heavy and light-tailed data.

problem Estimating probabilities of extreme events in multivariate data.
method Self-Similar Generative Estimation (SS-GEN) decomposes tail distribution into radial and angular components.
result SS-GEN generates representative extreme scenarios and estimates rare-event probabilities beyond observed data.

Econometric framework integrates heavy-tailed distributions with behavioral probability weighting for better asset pricing.

problem Underestimation of Value-at-Risk by traditional models in asset pricing.
method Developed an econometric framework combining heavy-tailed Student's tt distributions with behavioral probability weighting.
result Student's tt specifications outperform Gaussian models in 88.4% of cases, reducing underestimation of Value-at-Risk by 16.5 percentage points.

New measures capture tail dependence and non-exchangeability in financial data.

problem Underestimation of tail dependence and inability to capture non-exchangeable tail dependence.
method Tail copulas and novel tail dependence measures (MTCM, ATCM) are proposed.
result Captures non-exchangeable tail dependence and provides analytical forms for various copulas.

Study on error probability for classification of heavy-tailed renewal processes.

problem Error probability in classification of heavy-tailed renewal processes.
method Asymptotic expressions for Bhattacharyya bound on misclassification error probabilities.
result Obtained asymptotic expressions for misclassification error probabilities.

The paper examines how heavy-tailed risks behave under Gaussian copula models.

problem Understanding tail risk probabilities with heavy-tailed marginal risks and Gaussian dependence.
method Modeling heavy-tailed risks using regular variation and analyzing tail probabilities under Gaussian copula.
result The rate of decay of tail set probabilities varies with the type of tail sets and Gaussian correlation matrix.

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 ↗

TTF improves performance of normalizing flows for heavy-tailed distributions.

problem Improving performance of normalizing flows for heavy-tailed distributions.
method Uses a Gaussian base distribution and a final transformation layer to produce heavy tails.
result Experimental results show TTF outperforms current methods, especially in high-dimensional or heavy-tailed scenarios.

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.

Study optimizes sampling to avoid extreme tail risks in unknown heavy-tailed distributions.

problem Identify optimal alternative with minimal extreme tail risk from unknown heavy-tailed distributions.
method Data-driven sequential sampling policies to maximize likelihood of selecting the optimal alternative.
result Proposed methods outperform existing approaches in identifying the optimal alternative.

New algorithms achieve high-probability parameter-free regret in online convex optimization with heavy-tailed data.

problem Achieving high-probability parameter-free regret in online convex optimization with heavy-tailed data.
method Developed new regularization techniques to handle exponentially large iterates and heavy-tailed subgradients.
result Achieved regret bound of O(uT1/plog(1/δ))O(\| \mathbf{u} \| T^{1/\mathfrak{p}} \log (1/δ)) with high probability for subgradients with bounded pthp^{th} moments.

Dynamic Vocabulary Pruning stabilizes LLM training by removing low-probability tokens.

problem Training Large Language Models (LLMs) with Reinforcement Learning (RL) causes numerical divergence between inference and training.
method Dynamic Vocabulary Pruning (DVP) constrains the RL objective to a safe vocabulary that excludes low-probability tokens.
result DVP stabilizes training by reducing systematic bias introduced by the extreme tail of the token distribution.

We propose a family of models that enable predictive estimation of time-varying extreme event probabilities in heavy-tailed and nonlinearly dependent time series. The models are a white noise process with conditionally log-Laplace stochastic volatility. In contrast to other, similar stochastic volatility formalisms, th…

2019-01-08abs ↗pdf ↗

In the presence of a layer of metaprobabilities (from uncertainty concerning the parameters), the asymptotic tail exponent corresponds to the lowest possible tail exponent regardless of its probability. The problem explains "Black Swan" effects, i.e., why measurements tend to chronically underestimate tail contribution…

2012-10-06abs ↗pdf ↗

The paper proposes a new method to measure risk with fine-grained tail sensitivity.

problem Risk measures that do not account for tail sensitivity are insufficient for machine learning systems.
method The approach involves specifying a reference distribution with desired tail behavior and constructing risk measures compatible with this upper probability.
result Risk measures with fine-grained tail sensitivity can replace the expectation operator in machine learning systems.

Method bounds tail probabilities of continuous RVs.

problem Bounding tail probabilities of continuous random variables.
method Setting continuous, positive, and strictly decreasing/increasing functions to derive upper and lower bounds.
result Provides tighter bounds than existing methods, including a novel asymptotic capacity bound for AWGN channel.

Paper develops a TR-SSQP method for noisy optimization with heavy-tailed noise.

problem Optimization problems with stochastic objectives and heavy-tailed noise.
method Trust-Region Stochastic Sequential Quadratic Programming (TR-SSQP) method.
result Achieves high-probability first-order and second-order stationarity bounds for heavy-tailed noise.

We consider the tail probabilities of stock returns for a general class of stochastic volatility models. In these models, the stochastic differential equation for volatility is autonomous, time-homogeneous and dependent on only a finite number of dimensional parameters. Three bounds on the high-volatility limits of the…

2018-09-22abs ↗pdf ↗

The literature of heavy tails (typically) starts with a random walk and finds mechanisms that lead to fat tails under aggregation. We follow the inverse route and show how starting with fat tails we get to thin-tails when deriving the probability distribution of the response to a random variable. We introduce a general…

2013-07-25abs ↗pdf ↗

The paper integrates behavioral distortions into portfolio optimization using implied probability weighting functions.

problem Behavioral distortions in probability weighting affect portfolio optimization under different return distributions.
method Developed a unified framework to extract probability weighting functions from optimal portfolios modeled under Gaussian and NIG distributions.
result Increasing tail fatness amplifies behavioral distortions, and shifts in risk-free rates alter the curvature of these distortions.

In this paper we study the asymptotic decay of finite time ruin probabilities for an insurance company that faces heavy-tailed claims, uses predictable investment strategies and makes investments in risky assets whose prices evolve according to quite general semimartingales. We show that the ruin problem corresponds to…

2008-09-25abs ↗pdf ↗

Paper solves robust convex problems with heavy-tailed noise.

problem Solving convex compositional problems with heavy-tailed noise.
method Sub-Gaussian confidence bounds under weak heavy-tailed noise assumptions, using boosting strategy.
result Achieves nearly optimal high probability convergence result.

Paper studies second order tail probabilities in risk models.

problem Analyzing tail probabilities in risk models with constant interest force.
method Asymptotic expansion and weighted Kesten-type inequality for second order subexponential random variables.
result Second order asymptotic formulae for continuous-time renewal risk models are derived.

Optimal algorithm identifies best arm for risk measures in heavy-tailed distributions.

problem Identifying the arm with smallest CVaR, VaR, or weighted sum of CVaR and mean from heavy-tailed distributions.
method Multi-armed bandit best-arm identification framework, solving non-convex optimization problem.
result Optimal δ-correct algorithm with matching lower bound on expected samples.

Nonlinear SGD achieves high-probability rates in non-convex optimization with heavy-tailed noise.

problem Optimization in non-convex problems with heavy-tailed noise.
method General nonlinear framework for SGD, including symmetrization techniques.
result Achieves O~(t1/2)\widetilde{\mathcal{O}}(t^{-1/2}) rate for heavy-tailed noise.

The hidden tail of empirical distributions is analyzed using extreme value theory.

problem Understanding the bias between in-sample mean and true statistical mean for large nn.
method Extreme value theory applied to empirical distributions and their moments.
result The hidden moment of order 0 for power law distributions follows an exponential distribution with expectation 1/n1/n.

Proposes a new framework to manage venture capital portfolio risk by focusing on deal-level correlations.

problem Managing venture capital portfolio risk, especially extreme outcomes.
method Gaussian-copula-based framework that learns deal-level dependence from observed joint success frequencies.
result Correlation amplifies extreme upside outcomes, shifting portfolio distribution toward heavier right tails.

TailGAN uses GANs to detect anomalies near data distribution tails.

problem Anomaly detection near data distribution tails with current GAN limitations.
method TailGAN leverages GANs with maximum entropy regularization to generate and detect anomalies near data distribution tails.
result TailGAN achieves competitive performance on various datasets compared to existing methods.

Develops a new divergence framework that combines ff-divergences and IPMs.

problem Comparing distributions that are not absolutely continuous.
method Introduces (f,Γ)(f,Γ)-divergences as a two-stage mass-redistribution/mass-transport process.
result Improves estimation, learning, and uncertainty quantification in GANs for heavy-tailed distributions.

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.

Financial time series have been investigated to follow fat-tailed distributions. Further, an empirical probability distribution sometimes shows cut-off shapes on its tails. To describe this stylized fact, we incorporate the cut-off effect in superstatistics. Then we confirm that the presented stochastic model is capabl…

2018-09-13abs ↗pdf ↗

Modified lognormal distribution with flexible tails for skewed data.

problem Skewed and fat-tailed data in natural and engineering datasets.
method Developed a family of three-parameter non-Gaussian probability density functions based on generalized kappa-exponential and kappa-logarithm functions.
result Closed-form analytic expressions for statistical functions and maximum-likelihood estimation.

In the world of modern financial theory, portfolio construction has traditionally operated under at least one of two central assumptions: the constraints are derived from a utility function and/or the multivariate probability distribution of the underlying asset returns is fully known. In practice, both the performance…

2014-12-24abs ↗pdf ↗

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.