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

156311467622 · Jun 202019922001200920172026
48 results for Regularly Varying Distributions

New insights into tail behavior of heavy-tailed random vectors and processes.

problem Understanding tail behavior of aggregates of heavy-tailed random vectors.
method Analyzing multivariate regularly varying random vectors and Lévy processes.
result More than one large jump can determine tail behavior of aggregates.

Given nn samples from a population of individuals belonging to different types with unknown proportions, how do we estimate the probability of discovering a new type at the (n+1)(n+1)-th draw? This is a classical problem in statistics, commonly referred to as the missing mass estimation problem. Recent results by Ohannes…

2018-06-25abs ↗pdf ↗

The study shows how geometric Weyl bulk-density exponent rigidifies spectral encodings in O-regularly varying classes.

problem Understanding spectral encodings under Weyl growth conditions.
method Analyzing geometric Weyl bulk-density exponent and proving spectral rigidity.
result The geometric Weyl bulk-density exponent (d2)/2(d-2)/2 rigidifies spectral encodings in the O-regularly varying class, leading to unique admissible exponents and scaling laws.

Introduces Polar Depth for analyzing multivariate heavy-tailed data extremes.

problem Analyzing the behavior of extremes from multivariate heavy-tailed distributions.
method Introduces Polar Depth, a novel statistical depth function expressed in polar coordinates.
result The polar depth of the largest observations converges to the polar depth of the limiting distribution as the threshold increases.

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.

New features from early battery cycles predict lifetime with high accuracy.

problem Accurately predicting battery lifetime under varying conditions is challenging due to manufacturing variability and usage-dependent degradation.
method Extracted features from regularly scheduled reference performance tests and used them to predict battery lifetime using a hierarchical Bayesian regression model.
result Demonstrated a lifetime prediction of in-distribution cells with 15.1% mean absolute percentage error using only the first 15% of data.

We examine random variables in the power law/regularly varying class with stochastic tail exponent, the exponent αα having its own distribution. We show the effect of stochasticity of αα on the expectation and higher moments of the random variable. For instance, the moments of a right-tailed or right-asymmetric varia…

2016-09-08abs ↗pdf ↗

Study free energy in spherical spin glasses, proving universality dichotomy.

problem Analyzing free energy in spherical spin glass models with different tail exponents.
method Introduced a tail-adapted normalization and used universality dichotomy.
result Sharp universality dichotomy for free energy across different tail exponents.

Every day, hundreds of millions of new Tweets containing over 40 languages of ever-shifting vernacular flow through Twitter. Models that attempt to extract insight from this firehose of information must face the torrential covariate shift that is endemic to the Twitter platform. While regularly-retrained algorithms can…

2018-09-18abs ↗pdf ↗

Proposes a method to adapt DNNs to drift in data distribution.

problem Adapting to out-of-distribution data and shifting objectives.
method Bayesian Inference, Variational Density Propagation, Evidence Lower Bound (ELBO), Minimum Description Length (MDL) Principle.
result Minimizes catastrophic forgetting by approximating MDL principle.

We give three formulas expressing the Smale invariant of an immersion f of a (4k-1)-sphere into (4k+1)-space. The terms of the formulas are geometric characteristics of any generic smooth map g of any oriented 4k-dimensional manifold, where g restricted to the boundary is an immersion regularly homotopic to f in (6k-1)…

2000-02-10abs ↗pdf ↗

Volterra square-root process boundary behavior and martingale measures

problem Boundary behavior of the Volterra square-root process
method Comparison principles for Volterra integral equations and generalized Riemann-Liouville fractional equations
result Finiteness of negative pp-moments and atom at the boundary for rough kernels

New protocol evaluates synthetic data for temporal consistency.

problem Synthetic data generators can produce invalid timestamps and trajectories.
method Characterize datasets by four properties, then measure timestamp validity and dynamics.
result Temporal fidelity must be measured, not inferred from static data.

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.

This paper analyzes M-estimators under infinite-variance noise in high dimensions.

problem High-dimensional M-estimation with infinite-variance noise.
method Study of the Fenchel conjugate domain and its impact on risk.
result Exact risk of M-estimators under infinite-variance noise is derived.

Regular variation provides a convenient theoretical framework to study large events. In the multivariate setting, the dependence structure of the positive extremes is characterized by a measure - the spectral measure - defined on the positive orthant of the unit sphere. This measure gathers information on the localizat…

2019-07-01abs ↗pdf ↗

Paper develops sparse learning for heavy-tailed time series with locally stationary dynamics.

problem Sparse learning for high-dimensional heavy-tailed locally stationary time series.
method Additive modeling with kernel smoothing, sparsity-inducing penalized estimation.
result Prediction-error bounds and convergence rates for different sparsity structures.

In this paper, we consider a framework adapting the notion of cointegration when two asset prices are generated by a driftless Itô-semimartingale featuring jumps with infinite activity, observed regularly and synchronously at high frequency. We develop a regression based estimation of the cointegrated relations method …

2019-05-17abs ↗pdf ↗

Researchers prove Weyl laws for Schrödinger operators on noncompact manifolds.

problem Proving Weyl laws for Schrödinger operators on noncompact manifolds.
method Heat kernel asymptotics, Karamata-Hardy-Littlewood Tauberian theorem, and semiclassical analysis.
result Established both classical and semiclassical Weyl laws for Schrödinger operators on noncompact manifolds.

We introduce a simulation scheme for Brownian semistationary processes, which is based on discretizing the stochastic integral representation of the process in the time domain. We assume that the kernel function of the process is regularly varying at zero. The novel feature of the scheme is to approximate the kernel fu…

2015-07-10abs ↗pdf ↗

We study the asymptotic behavior of the difference ΔραX,Y:=ρα(X+Y)ρα(X)Δρ^{X, Y}_α:= ρ_α(X + Y) - ρ_α(X) as α1α\rightarrow 1, where ραρ_α is a risk measure equipped with a confidence level parameter 0<α<10 < α< 1, and where XX and YY are non-negative random variables whose tail probability functions are regularly varying. The case where …

2017-11-20abs ↗pdf ↗

New method learns complex, multimodal distributions in ADVI.

problem Learning unimodal approximate posteriors limits ADVI's ability to capture complex data structures.
method Use stratified sampling to allow mixture distributions as approximate posteriors, derive a tighter evidence lower bound.
result SIWAE objective allows ADVI to learn more complex, multimodal distributions, improving accuracy and calibration.

We show that a compact complex surface which fibers smoothly over a curve of genus >1 with fibers of genus >1 fibers holomorphically. We deduce an improvement of a result in [D Kotschick, Math. Research Letters, 5 (1998) 227-234], and a characterisation of fibered surfaces with zero signature.

1999-11-20abs ↗pdf ↗

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves along the way having at most n+2 crossings.

2008-02-21abs ↗pdf ↗

Develops statistical framework for analyzing functional data extremes.

problem Analyzing extremes of functional data in Hilbert spaces.
method Regular variation in Hilbert spaces, Peaks-Over-Threshold framework, functional PCA.
result Proposes a dimension reduction method for functional extreme observations.

A new method for calculating ES from VaR under Solvency II.

problem The need for a more appropriate risk measure (ES) than VaR.
method Developed PELVE method for multiple insurers, analyzing existence, uniqueness, and expressions for different payoff distributions.
result The choice of method is crucial when payoffs are from different distribution families.

We give geometric formulae which enable us to detect (completely in some cases) the regular homotopy class of an immersion with trivial normal bundle of a closed oriented 3-manifold into 5-space. These are analogues of the geometric formulae for the Smale invariants due to Ekholm and the second author. As a corollary, …

2001-05-10abs ↗pdf ↗

Proposes a new policy gradient algorithm to improve reinforcement learning efficiency and stability.

problem Inefficiency and instability of DDPG in practical applications, and difficulty in controlling Q estimation bias and variance.
method Introduces a Regularly Updated Deterministic (RUD) policy gradient algorithm.
result The RUD algorithm makes better use of new data and has lower Q value variance, leading to improved performance.

This paper, to be regularly updated, lists those prime knots with the fewest possible number of crossings for which values of basic knot invariants, such as the unknotting number or the smooth 4-genus, are unknown. This list is being developed in conjunction with "KnotInfo" (www.indiana.edu/~knotinfo), a web-based tabl…

2005-03-07abs ↗pdf ↗