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

0111 · Mar 201119922001200920172026
6 results for tail-specific

We examine whether hedging effectiveness is affected by asymmetry in the return distribution by applying tail specific metrics to compare the hedging effectiveness of short and long hedgers using crude oil futures contracts. The metrics used include Lower Partial Moments (LPM), Value at Risk (VaR) and Conditional Value…

2011-03-28abs ↗pdf ↗

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.

Consider the problem of finding a population or a probability distribution amongst many with the largest mean when these means are unknown but population samples can be simulated or otherwise generated. Typically, by selecting largest sample mean population, it can be shown that false selection probability decays at an…

2015-07-16abs ↗pdf ↗

A motif-based framework identifies local spillover structures in financial markets.

problem Aggregate risk spillovers obscure local interaction patterns in systemic risk.
method Develops a motif-based framework using multiscale backbones and colored motifs.
result Motif-based portfolios outperform traditional benchmarks on risk-adjusted returns.

Optimized bandit algorithms have heavy-tailed regret distributions that can grow faster than expected.

problem Heavy-tailed regret distributions in optimized bandit algorithms.
method Change-of-measure ideas and UCB algorithm modifications.
result Regret distributions of optimized UCB algorithms have a heavy Cauchy tail, and can grow faster than poly-logarithmically.