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

Trend · papers per month

78157235313 · May 202619922001200920172026
48 results for asymptotic probability

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.

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.

Develops asymptotic analysis for RandNLA sampling estimators in least-squares problems.

problem Lack of distributional information for RandNLA estimators in statistical inference.
method Asymptotic analysis of sampling estimators for least-squares problems in two settings.
result Sampling estimators are asymptotically normally distributed under mild conditions.

Estimates growth of reciprocal classes in Hecke groups.

problem Estimating the growth of reciprocal conjugacy classes in Hecke groups.
method Using free product structure and word lengths of reciprocal elements, with tools from basic probability theory.
result Estimates the asymptotic growth of reciprocal conjugacy classes in Hecke groups.

In this paper we study the asymptotic decay of finite time ruin probabilities for an insurance company that faces heavy-tailed claims, uses predictable investment strategies and makes investments in risky assets whose prices evolve according to quite general semimartingales. We show that the ruin problem corresponds to…

2008-09-25abs ↗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.

New strategy optimally identifies best arm in unknown variance Gaussian bandits.

problem Identifying the best arm in two-armed Gaussian bandits with unknown variances.
method Proposes a Neyman Allocation (NA)-Augmented Inverse Probability weighting (AIPW) strategy to estimate variances and draw arms adaptively.
result Demonstrates asymptotic optimality of the proposed strategy in the small-gap regime.

Sharp bounds for high-probability estimation of discrete distributions.

problem Estimating discrete distributions with high probability under χ2χ^2-divergence.
method Sharp upper and lower bounds for the classical Laplace estimator, and characterization of minimax high-probability risk for any estimator.
result Sharp bounds for high-probability estimation of discrete distributions can be achieved through a simple smoothing strategy.

Study shows limits of Fuchsian surfaces in hyperbolic 3-manifolds.

problem Understanding the limits of Fuchsian surfaces in hyperbolic 3-manifolds.
method Analyzing asymptotically Fuchsian maps and their induced probability area measures.
result Weak-* limits of induced area measures are convex combinations of Haar and totally geodesic surface measures.

We study an optimal investment control problem for an insurance company. The surplus process follows the Cramer-Lundberg process with perturbation of a Brownian motion. The company can invest its surplus into a risk free asset and a Black-Scholes risky asset. The optimization objective is to minimize the probability of…

2015-02-08abs ↗pdf ↗

The study shows subgroup separability conditions for specific groups.

problem Conditions for subgroup separability in free-by-cyclic and deficiency 1 groups.
method Analyzes polynomially growing monodromy and asymptotic probability of random groups.
result Random deficiency 1 groups are not subgroup separable with positive probability.

This survey reviews portfolio selection problem for long-term horizon. We consider two objectives: (i) maximize the probability for outperforming a target growth rate of wealth process (ii) minimize the probability of falling below a target growth rate. We study the asymptotic behavior of these criteria formulated as l…

2014-08-27abs ↗pdf ↗

Study of random multicurves and square-tiled surfaces on large genus surfaces.

problem Understanding the geometry and combinatorial properties of random multicurves and square-tiled surfaces on surfaces of large genus.
method Combination of combinatorial and geometric analysis, including large genus asymptotic analysis of moduli space volumes and intersection numbers.
result Random multicurves and square-tiled surfaces have well-approximated properties by random permutations, with specific expected values.

The paper analyzes stability and asymptotic behavior of hedging strategies in binomial and trinomial models.

problem Stability and asymptotic analysis of hedging strategies in incomplete financial models.
method Discrete-time Föllmer-Schweizer decomposition, perturbation analysis, and asymptotic approximation.
result Explicit formulas for leading order correction terms in asymptotic analysis.

Study on error probabilities of machine learning classification techniques using large deviations theory.

problem Performance analysis of machine learning binary classification techniques.
method Large deviations theory applied to Data-Driven Decision Function (D3F) for error probability analysis.
result Classification error probabilities vanish exponentially, with an asymptotic formula providing precise error rate estimates.

An optimal algorithm for multi-armed bandits with constraints.

problem Optimizing decisions in constrained multi-armed bandit problems.
method An index-based deterministic algorithm using Locatelli's anytime thresholding under known optimal value assumption.
result The algorithm achieves asymptotic optimality with probability approaching 1.

The paper develops approximations for Pearson's chi-square statistic and applies them to confidence intervals.

problem Finding confidence intervals for strictly convex functions of discrete distribution weights.
method Non-asymptotic local normal approximation for multinomial probabilities, deriving bounds and coupling inequalities.
result Developed methods to find confidence intervals for negative entropy of discrete distributions.

This study analyzes AdaGrad's stability and convergence in non-convex optimization.

problem Lack of theoretical analysis for AdaGrad in non-convex optimization.
method Novel stopping time-based techniques from probability theory.
result Established stability and derived convergence rates for AdaGrad.

Detects dense subhypergraphs in heterogeneous random hypergraphs.

problem Testing for the existence of a dense subhypergraph in heterogeneous random hypergraphs.
method Established detection boundaries and constructed asymptotically powerful and adaptive tests.
result Developed tests for distinguishing between null and alternative hypotheses.

Work in the classification literature has shown that in computing a classification function, one need not know the class membership of all observations in the training set; the unlabeled observations still provide information on the marginal distribution of the feature set, and can thus contribute to increased classifi…

2015-10-06abs ↗pdf ↗

For massive data, the family of subsampling algorithms is popular to downsize the data volume and reduce computational burden. Existing studies focus on approximating the ordinary least squares estimate in linear regression, where statistical leverage scores are often used to define subsampling probabilities. In this p…

2017-02-03abs ↗pdf ↗

Study best arm identification with limited precision sampling in bandits.

problem Limited precision sampling in multi-armed bandit problems.
method Proposed a modified tracking-based algorithm to handle non-unique optimal allocations and presented non-asymptotic bounds.
result Asymptotically optimal tracking-based algorithm for best arm identification.

We give an exact formula for the value of the derivative at zero of the gap probability in finite n x n Gaussian ensembles. As n goes to infinity our computation provides an asymptotic (with an explicit constant) of the order n^(1/2). As a first application, we consider the set of n x n (Real, Complex or Quaternionic) …

2013-09-22abs ↗pdf ↗

This paper analyzes the bias of inexact MCMC methods in high dimensions.

problem Understanding the bias of inexact MCMC methods in high-dimensional spaces.
method Establishing bounds on Wasserstein distances between inexact MCMC methods and target distributions.
result The asymptotic bias of ULA and uHMC depends on key quantities related to the target distribution or the stationary probability measure of the scheme.

We consider an insurance company in the case when the premium rate is a bounded non-negative random function $c_\zs{t}$ and the capital of the insurance company is invested in a risky asset whose price follows a geometric Brownian motion with mean return aa and volatility σ>0σ>0. If β:=2a/σ21>0β:=2a/σ^2-1>0 we find exact the as…

2010-11-05abs ↗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 ↗

In this article, we classify the set of asymptotic mass-like invariants for asymptotically hyperbolic metrics. It turns out that the standard mass is just one example (but probably the most important one) among the two families of invariants we find. These invariants are attached to finite-dimensional representations o…

2016-03-25abs ↗pdf ↗

Motivated by community detection, we characterise the spectrum of the non-backtracking matrix BB in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random graph on nn vertices partitioned into two equal-sized clusters. The vertices have i.i.d. weights {φu}u=1n\{ φ_u \}_{u=1}^n with second moment $Φ…

2016-09-08abs ↗pdf ↗

Paper tackles identifying an odd arm in a multi-armed bandit with restless Markov processes and trembling hand.

problem Identifying an odd arm in a multi-armed bandit with restless Markov processes and trembling hand.
method Derive asymptotic lower bound on expected time to identify the odd arm, stitch together parameterised solutions to MDPs.
result First known asymptotic lower bound on expected time to identify the odd arm, with vanishing error probability.

A nonparametric two-sample test using a parametric integral probability metric

problem Detecting distributional differences between two independent samples
method Propose a new two-sample test statistic based on a newly introduced integral probability metric (IPM)
result Establish theoretical guarantees for the associated two-sample testing procedure

In this paper, we analyze the finite sample complexity of stochastic system identification using modern tools from machine learning and statistics. An unknown discrete-time linear system evolves over time under Gaussian noise without external inputs. The objective is to recover the system parameters as well as the Kalm…

2019-03-21abs ↗pdf ↗

Instantaneous volatility of logarithmic return in the lognormal fractional SABR model is driven by the exponentiation of a correlated fractional Brownian motion. Due to the mixed nature of driving Brownian and fractional Brownian motions, probability density for such a model is less studied in the literature. We show i…

2017-02-26abs ↗pdf ↗

Counting meanders on surfaces of arbitrary genus, with precise asymptotics.

problem Counting and understanding meanders on surfaces of arbitrary genus.
method Square-tiled surfaces, moduli spaces of Abelian and quadratic differentials, Witten-Kontsevich 2-correlators.
result Asymptotic probability and polynomial growth of meanders with intersections.

In this paper we discuss the asymptotic behaviour of random contractions X=RSX=RS, where RR, with distribution function FF, is a positive random variable independent of S(0,1)S\in (0,1). Random contractions appear naturally in insurance and finance. Our principal contribution is the derivation of the tail asymptotics of $X…

2010-07-31abs ↗pdf ↗

The problem of multi-hypothesis testing with controlled sensing of observations is considered. The distribution of observations collected under each control is assumed to follow a single-parameter exponential family distribution. The goal is to design a policy to find the true hypothesis with minimum expected delay whi…

2019-10-24abs ↗pdf ↗

We consider the least-square linear regression problem with regularization by the 1\ell^1-norm, a problem usually referred to as the Lasso. In this paper, we first present a detailed asymptotic analysis of model consistency of the Lasso in low-dimensional settings. For various decays of the regularization parameter, w…

2009-01-21abs ↗pdf ↗

The study optimizes distribution estimation from samples with relative entropy error, adapting to sparse distributions.

problem Estimating discrete distributions with high-probability accuracy in relative entropy.
method Analysis of Laplace estimator and confidence-dependent smoothing techniques, including data-dependent smoothing.
result Optimal high-probability risk bounds for various estimators, including a new data-dependent smoothing method.

This work proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.

problem Proving the asymptotic freeness of layerwise Jacobians in multilayer perceptrons (MLPs).
method Replacing each layer's parameter matrix with itself multiplied by a Haar orthogonal matrix, and using the invariance of the MLP.
result Proves the asymptotic freeness of layerwise Jacobians in MLPs with Haar orthogonal matrices.