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

103205308410 · Jun 202019922001200920172026
48 results for exponential tail property

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.

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.

New model captures time-varying volatility with stochastic exponential tails.

problem Capturing time-varying volatility and stochastic skewness in financial markets.
method Normal Tempered Stable distribution with time-varying parameter.
result Model better explains market option prices with stochastic exponential tails.

Study on U-statistics with heavy-tailed samples, providing tail bounds and LDP.

problem Deviation of U-statistics with heavy-tailed samples.
method Exponential tail bounds and Large Deviation Principle (LDP) for U-statistics.
result Obtained an exponential upper bound for U-statistics tail decay, showing two regions of decay.

We consider strictly stationary heavy tailed time series whose finite-dimensional exponent measures are concentrated on axes, and hence their extremal properties cannot be tackled using classical multivariate regular variation that is suitable for time series with extremal dependence. We recover relevant information ab…

2013-07-05abs ↗pdf ↗

This work achieves exponential concentration in heavy-tailed data over CAT(κ) spaces using the Fréchet median.

problem Achieving robust estimation in heavy-tailed data distributions.
method Developing a concentration bound for the Fréchet median in CAT(κ) spaces.
result Exponential concentration of the Fréchet median in CAT(κ) spaces over heavy-tailed data.

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.

This work extends diffusion models to handle heavy-tailed targets, improving score estimation and sampling guarantees.

problem Score estimation and sampling guarantees for heavy-tailed targets in diffusion models.
method Kernel density estimation and minimax rates analysis for score estimation and sampling guarantees.
result Sharp minimax rates for score estimation and sampling guarantees for heavy-tailed targets, revealing qualitative differences between exponential and polynomial tails.

New insights into natural exponential families improve regret bounds for bandit problems.

problem Improving regret bounds for bandit problems with subexponential tails.
method Proving self-concordance for natural exponential families and applying to bandits.
result Optimistic algorithms for generalized linear bandits have second-order regret bounds that are free of an exponential dependence on problem parameters.

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.

The κκ-generalised distribution fits daily stock returns well.

problem Stock returns are often heavy-tailed, not normally distributed.
method Used the κκ-generalised distribution with a Monte-Carlo goodness of fit test.
result The κκ-generalised distribution fits historic daily stock returns well for a significant proportion of analyzed stocks.

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.

Study on price fluctuations in NFT market, showing heavy-tailed distributions and long-range memory.

problem Characterizing price fluctuations in NFT market.
method Analysis of capitalization, floor price, transactions, inter-transaction times, and volume value of NFTs.
result NFT market exhibits heavy-tailed probability distribution functions, well described by stretched exponentials, with long-range memory.

SGD converges to an invariant distribution with sub-Gaussian or sub-exponential properties.

problem Optimizing smooth and strongly convex objectives using SGD.
method Analysis through Markov chains, focusing on convergence and concentration properties.
result SGD iterates and their invariant limit distribution inherit sub-Gaussian or sub-exponential concentration properties.

We consider a priori generalization bounds developed in terms of cross-validation estimates and the stability of learners. In particular, we first derive an exponential Efron-Stein type tail inequality for the concentration of a general function of n independent random variables. Next, under some reasonable notion of s…

2017-06-19abs ↗pdf ↗

Optimizes regret distribution in stochastic bandits for risk balance.

problem Balancing regret expectation and tail risk in stochastic bandits.
method Characterizes optimal regret tail probability for any threshold, proposes new policies.
result Discovers an intrinsic gap in optimal tail rate based on time horizon uncertainty.

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.

Based on the minute-by-minute data of the Hang Seng Index in Hong Kong and the analysis of probability distribution and autocorrelations, we find that the index fluctuations for the first few minutes of daily opening show behaviors very different from those of the other times. In particular, the properties of tail dist…

2000-06-08abs ↗pdf ↗

A random walk wnw_n on a separable, geodesic hyperbolic metric space XX converges to the boundary X\partial X with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes positive linear progress. Progress is known to be linear with exponential decay when …

2017-10-14abs ↗pdf ↗

We present sharp tail asymptotics for the density and the distribution function of linear combinations of correlated log-normal random variables, that is, exponentials of components of a correlated Gaussian vector. The asymptotic behavior turns out to depend on the correlation between the components, and the explicit s…

2013-09-12abs ↗pdf ↗

Sharp large deviations and Gibbs conditioning for portfolio credit risk models.

problem Analyzing the risk of default in financial portfolios with dependent factors.
method Sharp large deviation estimates and conditional Bahadur-Rao estimates for threshold models with diverging latent factors.
result Conditioned on a large exceedance event, default indicators become asymptotically i.i.d., and loss-given-default is exponentially tilted.

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 ↗

Modeling financial returns as conditionally independent random variables explains power-law tails.

problem Understanding the distribution of financial returns and their relation to volatility.
method Assuming returns are conditionally independent given volatility, which varies randomly over time.
result Returns distribution can be described by the sum of conditionally independent random variables, showing scaling and power-law tails.

We introduce and establish the main properties of QHawkes ("Quadratic" Hawkes) models. QHawkes models generalize the Hawkes price models introduced in E. Bacry et al. (2014), by allowing all feedback effects in the jump intensity that are linear and quadratic in past returns. A non-parametric fit on NYSE stock data sho…

2015-09-25abs ↗pdf ↗

Adaptive estimation for nonstationary time series reduces computational cost.

problem Estimating parameters of nonstationary time series with varying parameters over time.
method Moving exponential moving ML estimator for scale parameter estimation.
result Significantly improved log-likelihoods compared to standard estimation.

PH-VAE models heavy-tailed data with flexible Phase-Type distributions.

problem Standard VAEs fail to capture heavy-tailed behavior in real-world data.
method PH-VAE uses Phase-Type distributions defined by continuous-time Markov chains to adaptively model tail behavior.
result PH-VAE significantly outperforms existing heavy-tail-aware VAEs in approximating diverse heavy-tailed distributions.

There is accumulating evidence in the literature that stability of learning algorithms is a key characteristic that permits a learning algorithm to generalize. Despite various insightful results in this direction, there seems to be an overlooked dichotomy in the type of stability-based generalization bounds we have in …

2019-03-12abs ↗pdf ↗