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

1223 · Oct 201819922001200920172026
44 results for finite-moment

The paper proves that Gaussian field critical points have finite moments.

problem Proving the finiteness of moments for Gaussian field critical points.
method General approach not specific to critical points, using Taylor polynomial non-degeneracy.
result The finiteness of moments of the number of critical points of Gaussian fields.

We provide conditions for the existence and the unicity of strictly stationary solutions of the usual Dynamic Conditional Correlation GARCH models (DCC-GARCH). The proof is based on Tweedie's (1988) criteria, after having rewritten DCC-GARCH models as nonlinear Markov chains. Moreover, we study the existence of their f…

2014-05-27abs ↗pdf ↗

We provide explicit conditions on the distribution of risk-neutral log-returns which yield sharp asymptotic estimates on the implied volatility smile. We allow for a variety of asymptotic regimes, including both small maturity (with arbitrary strike) and extreme strike (with arbitrary bounded maturity), extending previ…

2014-11-06abs ↗pdf ↗

The study of random walks on hyperbolic spaces and Teichmüller spaces, proving central limit theorems and geodesic tracking.

problem Analyzing random walks on hyperbolic and Teichmüller spaces.
method Proving central limit theorems and geodesic tracking using finite moments and logarithmic moments.
result Translation lengths of random isometries satisfy a central limit theorem if and only if the random walk has finite second moment.

Affine jump-diffusions constitute a large class of continuous-time stochastic models that are particularly popular in finance and economics due to their analytical tractability. Methods for parameter estimation for such processes require ergodicity in order establish consistency and asymptotic normality of the associat…

2018-10-31abs ↗pdf ↗

In this paper we study the exponential functionals of the processes XX with independent increments , namely It=0texp(Xs)ds,,t0,I_t= \int _0^t\exp(-X_s)ds, _,\,\, t\geq 0, and also I=0exp(Xs)ds.I_{\infty}= \int _0^{\infty}\exp(-X_s)ds. When XX is a semi-martingale with absolutely continuous characteristics, we derive recurrent integral equat…

2016-10-27abs ↗pdf ↗

New protocols show 1-bit mean estimation can be order-optimal without interaction.

problem Can 1-bit mean estimation be optimal without interaction?
method Adaptive and non-adaptive threshold and interval queries, with one adaptive transition.
result Arbitrary non-adaptive quantizers can match the adaptive rate, suggesting interaction is not necessary.

Study on queues with Hawkes arrivals, proving steady-state behavior and developing an efficient algorithm.

problem Analyzing the steady-state behavior of queues with Hawkes arrivals.
method Novel coupling techniques and exponential convergence results for workload and busy period processes.
result Exponential convergence of queueing processes to their stationary distribution.

In recent studies the truncated Levy process (TLP) has been shown to be very promising for the modeling of financial dynamics. In contrast to the Levy process, the TLP has finite moments and can account for both the previously observed excess kurtosis at short timescales, along with the slow convergence to Gaussian at …

1997-10-20abs ↗pdf ↗

Variational inference with α-divergences has been widely used in modern probabilistic machine learning. Compared to Kullback-Leibler (KL) divergence, a major advantage of using α-divergences (with positive α values) is their mass-covering property. However, estimating and optimizing α-divergences require to use importa…

2018-10-29abs ↗pdf ↗

Improved KL bounds and Wasserstein guarantees for diffusion flow matching under minimal conditions.

problem Theoretical convergence properties of Brownian motion based diffusion flow matching.
method Refined analysis under Kullback-Leibler and 2-Wasserstein distances.
result State-of-the-art scaling in KL convergence bounds under minimal conditions.

We study the estimation of the parametric components of single and multiple index volatility models. Using the first- and second-order Stein's identities, we develop methods that are applicable for the estimation of the variance index in the high-dimensional setting requiring finite moment condition, which allows for h…

2018-11-27abs ↗pdf ↗

High frequency data in finance have led to a deeper understanding on probability distributions of market prices. Several facts seem to be well stablished by empirical evidence. Specifically, probability distributions have the following properties: (i) They are not Gaussian and their center is well adjusted by Levy dist…

2000-03-22abs ↗pdf ↗

We tackle the problem of estimating a location parameter with differential privacy guarantees and sub-Gaussian deviations. Recent work in statistics has focused on the study of estimators that achieve sub-Gaussian type deviations even for heavy tailed data. We revisit some of these estimators through the lens of differ…

2019-06-27abs ↗pdf ↗

In this paper, for μμ and νν two probability measures on Rd\mathbb{R}^d with finite moments of order ρ1ρ\ge 1, we define the respective projections for the WρW_ρ-Wasserstein distance of μμ and νν on the sets of probability measures dominated by νν and of probability measures larger than μμ in the convex order. Th…

2017-09-15abs ↗pdf ↗

The paper improves Monte Carlo methods for optimization problems.

problem Efficiently solving optimization problems with biased Monte Carlo estimators.
method Introduces Multilevel Monte Carlo (MLMC) within Sample Average Approximation (SAA).
result Establishes uniform convergence and sample complexity for MLMC in SAA.

New method improves generative modeling on convex domains using regularized mirror maps and Student-t priors.

problem Challenges in generative modeling on convex domains with heavy-tailed targets.
method Mirror Flow Matching with regularized mirror maps and Student-t priors.
result Empirically outperforms baselines and achieves competitive sample quality.

Understanding and developing a correlation measure that can detect general dependencies is not only imperative to statistics and machine learning, but also crucial to general scientific discovery in the big data age. In this paper, we establish a new framework that generalizes distance correlation --- a correlation mea…

2017-10-26abs ↗pdf ↗

The paper deals with distribution of singular values of product of random matrices arising in the analysis of deep neural networks. The matrices resemble the product analogs of the sample covariance matrices, however, an important difference is that the population covariance matrices, which are assumed to be non-random…

2020-01-17abs ↗pdf ↗

The COS method for European options pricing is improved with a new bound for the number of terms.

problem Determining the optimal number of terms in the COS method for accurate European option pricing.
method Using Fourier-cosine expansion, the study finds an explicit bound for the number of terms N in the cosine series approximation.
result The COS method achieves exponential convergence when the log-return density is smooth, but not when it has heavy tails.

BBVI converges nearly dimensionally independent for log-concave targets.

problem Efficiently optimizing variational parameters in high-dimensional spaces.
method Proved convergence rate of BBVI with reparametrization gradient for log-concave targets.
result BBVI converges with nearly independent dimension dependence for log-concave targets.

In the paper "On Truncated Variation of Brownian Motion with Drift" (Bull. Pol. Acad. Sci. Math. 56 (2008), no.4, 267 - 281) we defined truncated variation of Brownian motion with drift, Wt=Bt+μt,t0,W_t = B_t + μt, t\geq 0, where (Bt)(B_t) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…

2009-12-23abs ↗pdf ↗

A new method for estimating causal parameters from observables reduces the need for finite moment conditions.

problem Estimating causal parameters from observational data with unknown or infinite moment conditions.
method Variational Method of Moments (VMM) for a general class of estimators, including kernel and neural net-based methods.
result VMM estimators are consistent, asymptotically normal, and semiparametrically efficient.

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

problem Understanding spectrum behavior of random inner-product kernel matrices in polynomial regime.
method Analyzing matrices formed by a nonlinear function applied entrywise to a sample-covariance matrix, considering i.i.d. entries with all finite moments.
result The spectrum of random inner-product kernel matrices is universally described by the free convolution of the semicircular and Marčenko-Pastur distributions, with relative weights given by expanding the nonlinear function in the Hermite basis.

Improved portfolio optimization method reduces risk and improves performance.

problem Minimizing risk in large portfolios with limited data.
method Combines Tikhonov regularization and direct shrinkage of portfolio weights.
result Significantly reduces out-of-sample variance and Sharpe ratio compared to existing methods.

Paper introduces robust kernel ridge regression using Cauchy loss for handling various noise types.

problem Developing robust regression methods for noisy data.
method Introduces kernel Cauchy ridge regressor (KCRR) using Cauchy loss function.
result Establishes almost minimax-optimal convergence rate for KCRR in terms of L2L_2-risk.

New diffusion models learn distributions from samples with improved error bounds.

problem Statistical guarantees for score-based diffusion models on low-dimensional data.
method Derive finite-sample error bounds for Wasserstein-pp distance.
result Error bounds scale as n1/dp,q(μ)n^{-1 / d^\ast_{p,q}(μ)} for diffusion models.

We derive a new radial link for binary classification under shared elliptical distributions.

problem Binary classification under shared-generator elliptical class-conditional distributions.
method We derive the Bayes radial-link family from the within-class radius law and estimate it by a finite fractional-power stochastic-polynomial projection.
result The derived link is asymptotically Bayes-optimal and significantly better than QDA on various benchmarks.