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

Trend · papers per month

20395978 · May 202619922001200920172026
48 results for subexponential tails

Study improves error bounds for sparse regression with heavy-tailed covariates.

problem Estimating sparse coefficients in linear regression with heavy-tailed covariates.
method Employed an 1\ell_1-penalized Huber regression method.
result Error bound identical to Gaussian case for LL-subexponential covariates.

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.

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.

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.

Ridge regression performs optimally in noisy environments with heavy-tailed distributions.

problem Performance of ridge regression in noisy environments with heavy-tailed noise.
method Established excess risk bounds using integral operator framework and Fuk-Nagaev inequality.
result Ridge regression achieves optimal convergence rates under heavy-tailed noise, demonstrating robustness.

Study of linear classifiers in infinite imbalance scenarios.

problem Behavior of linear discriminant functions in extreme imbalance conditions.
method Analysis of linear classifiers under infinite imbalance, focusing on weight function properties and limit behavior.
result Limiting coefficient vectors reflect robustness or conservatism, optimizing against worst-case alternatives.

We present a new, more elementary proof of the Freedman-Teichner result that the geometric classification techniques (surgery, s-cobordism, and pseudoisotopy) hold for topological 4-manifolds with groups of subexponential growth. In an appendix Freedman and Teichner give a correction to their original proof, and reform…

2000-01-11abs ↗pdf ↗

We introduce a new quasi-isometry invariant $\subcorank X$ of a metric space XX called {\it subexponential corank}. A metric space XX has subexponential corank kk if roughly speaking there exists a continuous map g:XTg:X\to T such that for each tTt\in T the set g1(t)g^{-1}(t) has subexponential growth rate in XX and the…

2001-02-14abs ↗pdf ↗

Study shows torsion grows subexponentially in book of I-bundles but can grow exponentially in non-regular covers.

problem Growth rates of torsion in book of I-bundles.
method Analysis of torsion in homology of book of I-bundles using finite-sheeted covers.
result Torsion growth rates differ between regular and non-regular finite-sheeted covers.

Study finds the minimum number of finite Gaussian mixtures for best approximation.

problem Finding the minimum number of finite Gaussian mixtures for best approximation.
method Local moment matching for upper bound and spectral analysis for lower bound.
result Corrects a previous lower bound in the case of Gaussian mixing distributions.

Single gradient step finds adversarial examples in random neural networks.

problem Finding adversarial examples in neural networks with random architectures.
method Gradient descent approach applied to random undercomplete and overcomplete two-layers neural networks.
result A single gradient step is sufficient to find adversarial examples in random neural networks.

Graphs with bounded degrees and non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk.

problem Understanding geometric properties of graphs with non-negative Ollivier-Ricci curvature.
method Analyzing the geometric properties of graphs with non-negative Ollivier-Ricci curvature, proving subexponential growth and diffusive random walk.
result For graphs with bounded degrees and non-negative Ollivier-Ricci curvature, the average log-volume growth and random walk displacement are subexponential.

We address a long-standing and long-investigated problem in combinatorial topology, and break the exponential barrier for triangulations of real projective space, constructing a trianglation of RPn\mathbb{RP}^n of size e(12+o(1))nlogne^{(\frac{1}{2}+o(1))\sqrt{n}{\log n}}.

2020-09-06abs ↗pdf ↗

Estimates change point in high dimensional time series models.

problem Change point estimation in high dimensional time series.
method Plug-in least squares estimator with sufficient conditions for adaptivity.
result Optimal rate of convergence Op(ξ2)O_p(ξ^{-2}) in integer scale.

Study on hyperbolic groups, focusing on separability and splittings.

problem Coarse separability and splittings in hyperbolic groups.
method Quantitative analysis of volume growth and cut-sets, focusing on thickened spheres.
result One-ended hyperbolic groups that are not virtually surface groups are coarsely separable by a subset of subexponential growth if and only if they split over a virtually cyclic subgroup.

The paper proves concentration inequalities for diffusion processes.

problem Proving concentration inequalities for diffusion processes.
method Analysis via the Poisson equation for a broad class of subexponentially ergodic processes.
result Demonstrates power of concentration inequalities in validating conditions for Lasso estimation and sampling algorithms.

The quantification of diversification benefits due to risk aggregation plays a prominent role in the (regulatory) capital management of large firms within the financial industry. However, the complexity of today's risk landscape makes a quantifiable reduction of risk concentration a challenging task. In the present pap…

2009-10-13abs ↗pdf ↗

This is a sequel to the paper [Cas]. Here, we extend the methods of Farb-Wolfson using the theory of FI_G-modules to obtain stability of equivariant Galois representations of the etale cohomology of orbit configuration spaces. We establish subexponential bounds on the growth of unstable cohomology, and then use the Gro…

2017-03-21abs ↗pdf ↗

This paper extends the standard chaining technique to prove excess risk upper bounds for empirical risk minimization with random design settings even if the magnitude of the noise and the estimates is unbounded. The bound applies to many loss functions besides the squared loss, and scales only with the sub-Gaussian or …

2016-09-07abs ↗pdf ↗

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not be replaced by a subexponential bound. However, if T is polytopal (resp. shellab…

2001-10-17abs ↗pdf ↗

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated group GG has the word problem solvable in subexponential time and has a subgroup of…

2002-06-25abs ↗pdf ↗

We study the computational cost of recovering a unit-norm sparse principal component xRnx \in \mathbb{R}^n planted in a random matrix, in either the Wigner or Wishart spiked model (observing either W+λxxW + λxx^\top with WW drawn from the Gaussian orthogonal ensemble, or NN independent samples from $\mathcal{N}(0, I_n + …

2019-07-26abs ↗pdf ↗

Optimal data-driven formulations are found for learning and decision-making with historical data.

problem Designing optimal learning and decision-making formulations from historical data.
method Define a yardstick for measuring formulation quality, then construct an optimal formulation that is uniformly closer to the true cost.
result Existence of three distinct out-of-sample performance regimes with corresponding optimal formulations.

The study classifies translating and self-expanding solitons in 3D space.

problem Characterizing the topology and index of solitons in mean curvature flow.
method Analyzing the spectrum and index of expanding and translating solitons in R3\mathbb{R}^3.
result Translating and self-expanding solitons have finite topology under certain conditions.

New method models fat-tailed distributions with anisotropic tail-adaptive flows.

problem Gaussian-based variational inference fails to accurately capture tail decay in fat-tailed distributions.
method Improved theory on tails of flows, developed anisotropic tail-adaptive flows (ATAF).
result ATAF models tail-anisotropy, outperforming prior work on synthetic and real-world targets.

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.

We contribute to the arithmetic/topology dictionary by relating asymptotic point counts and arithmetic statistics over finite fields to homological stability and representation stability over $\Cb$ in the example of configuration spaces of nn points in smooth varieties. To do this, we import the method of homological …

2015-12-01abs ↗pdf ↗

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.

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.

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.

This paper investigates the average-case time complexity of certifying RIP matrices.

problem Certifying the restricted isometry property (RIP) for large sparsity levels in random Gaussian matrices.
method Analysis of the low-degree likelihood ratio to determine the average-case time complexity.
result Subexponential runtime of NildeΩ(s2/M)N^{ ildeΩ(s^2/M)} is required for certifying RIP matrices.

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 ↗

This paper improves tail dependence analysis by introducing a path-based approach.

problem The classical tail dependence coefficient fails to capture non-exchangeable features of tail dependence.
method The paper introduces a path-based maximal tail dependence approach to capture the most pronounced feature of dependence over all possible paths.
result The paper proves the existence and provides an explicit characterization of the path-based maximal TDC, improving analytical and computational tractability.