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

Trend · papers per month

10213141 · Oct 202519922001200920172026
48 results for Heavy-tailed Innovations

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 ↗

Modeling spatial extremes with non-Gaussian fields using SAR models and CNNs.

problem Challenges in modeling spatial data with heavy-tailed distributions and missing cells.
method Spatial autoregressive models with Generalized Extreme Value innovations, combined with CNN for fast parameter estimation.
result Effective modeling of spatial extremes in non-Gaussian fields, demonstrated on precipitation data.

This study revisits Fama-French models using sample innovations to address misinterpretation of high R-squared values.

problem Misinterpretation of high R-squared values in Fama-French models due to serial dependence and volatility clustering.
method Use of sample innovations to derive standard econometrics time series models to overcome misinterpretation.
result Suggests the Fama-French model should consider heavy-tail distributions due to relevant tail behavior in financial data.

Innovative extensions to option pricing models using asymmetric Brownian motion and random walk approaches.

problem Capturing empirical phenomena like return skewness, heavy tails, and volatility asymmetry in option pricing models.
method Developing the Geometric Asymmetric Brownian Motion (GABM) within the Bachelier--Black--Scholes--Merton framework.
result Deriving closed-form option pricing formulas and a discrete-time binomial tree algorithm that converges to the GABM limit.

Unified econometric model for portfolio optimization and option valuation.

problem Time-varying volatility and heavy tails in asset returns.
method Multivariate affine GARCH(1,1) with Normal Inverse Gaussian innovations.
result Substantial wealth-equivalent utility losses from ignoring correlation and tail risk.

A general theory of innovation and progress in human society is outlined, based on the combat between two opposite forces (conservatism/inertia and speculative herding "bubble" behavior). We contend that human affairs are characterized by ubiquitous ``bubbles'', which involve huge risks which would not otherwise be tak…

2007-06-13abs ↗pdf ↗

LatentFlow simplifies conditioning of stochastic processes without training.

problem Intractable conditional laws for complex stochastic models.
method Writing stochastic process as latent innovation, reducing conditioning to latent-space inference.
result Exact conditional sampling across various model classes.

Efficiently estimates sparse linear regression with heavy-tailed and outlier-contaminated data.

problem Estimating sparse linear regression coefficients with heavy-tailed and outlier-contaminated data.
method Efficient computation of estimators with sharp error bounds.
result Sharp error bounds for efficient estimators.

New diffusion models capture heavy-tailed distributions better.

problem Diffusion models struggle with rare or extreme events in heavy-tailed distributions.
method Repurposed diffusion framework using multivariate Student-t distributions, tailored perturbation kernel, and γγ-divergence.
result Our models generate rare and extreme events more effectively than standard diffusion models.

New concentration inequalities for tensors with heavy-tailed coefficients.

problem Developing bounds for Euclidean functions of tensors with sub-Weibull distributions.
method Extending concentration inequalities to sub-Weibull random tensors, using new inequalities for heavy-tailed random variables and martingale analysis.
result Established a phase transition between sub-gaussian and heavy-tailed regimes for Euclidean functions of tensors.

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.

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.

Paper tackles robust offline RL with heavy-tailed rewards.

problem Real-world applications often encounter heavy-tailed rewards, challenging offline RL.
method Proposes ROAM and ROOM algorithms using median-of-means method for robust off-policy evaluation and OPO.
result Demonstrates superior performance on heavy-tailed reward datasets compared to existing methods.

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.

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.

Optimized method tackles convex optimization with heavy-tailed noise.

problem Convex optimization problems with noisy gradients.
method Vanilla stochastic proximal subgradient method without gradient clipping or normalization.
result Achieves optimal complexity for various convex optimization types under heavy-tailed noise.

Efficiently estimates sparse linear regression with heavy-tailed data and outliers.

problem Sparse estimation of linear regression coefficients with heavy-tailed covariates and noises, including outliers.
method Efficient computation of robust estimator with nearly optimal error bound.
result Nearly optimal error bound for robust sparse estimation.

This work compresses heavy-tailed weight matrices for tighter generalization bounds.

problem Empirical evidence linking heavy-tailed weight matrices to test set accuracy but lack of formal relationship with generalization bounds.
method Utilized the compression framework to show that heavy-tailed matrices can be compressed, resulting in sparse weight matrices.
result Demonstrated a non-vacuous generalization bound for compressed networks with heavy-tailed weight matrices.

New class of heavy-tailed distributions shows weighted averages dominate individual variables.

problem Understanding and comparing risks in heavy-tailed distributions.
method Introducing a new class of heavy-tailed distributions and proving stochastic dominance relations.
result Weighted averages of random variables in this class are stochastically larger than individual variables.

New RDP guarantees for heavy-tailed SDEs and SGD.

problem Characterizing differential privacy for heavy-tailed noise in learning algorithms.
method Rényi flow computations and fractional Poincaré inequalities.
result First RDP guarantees for heavy-tailed SDEs with weaker dependence on dimension.

New algorithm tackles multi-agent bandits with heavy-tailed data.

problem Maximizing system performance in multi-agent settings with heavy-tailed data.
method Algorithm exploits hub-like structures and synchronization among clients.
result Regret bound of O(M11αlogT)O(M^{1 -\frac{1}α} \log{T}) for homogeneous settings, O(MlogT)O(M \log{T}) for heterogeneous.

New framework IIA identifies innovations in general nonlinear vector autoregressive processes.

problem Limited generality of NVAR models due to additive innovation assumption.
method Independent Innovation Analysis (IIA) framework, assuming mutual independence and modulation by an auxiliary variable.
result Guarantees identifiability of innovations with arbitrary nonlinearities, up to permutation and component-wise invertible nonlinearities.

Heavy-tailed distributions are frequently used to enhance the robustness of regression and classification methods to outliers in output space. Often, however, we are confronted with "outliers" in input space, which are isolated observations in sparsely populated regions. We show that heavy-tailed stochastic processes (…

2010-06-19abs ↗pdf ↗

HTFM improves mode coverage and tail-statistic recovery for heavy-tailed data.

problem Tackles heavy-tailed data in various domains with rare events.
method Proposes a framework using clock-conditioned Gaussian sources and truncated logsignature features.
result Improves mode coverage, sample quality, and tail-statistic recovery over Gaussian flow matching and baselines.

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.