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

Trend · papers per month

162324486648 · Jun 202019922001200920172026
48 results for moment-generating function

The Johnson-Lindenstrauss Lemma allows for the projection of nn points in pp-dimensional Euclidean space onto a kk-dimensional Euclidean space, with k24lnn3ε22ε3k \ge \frac{24\ln \emph{n}}{3ε^2-2ε^3}, so that the pairwise distances are preserved within a factor of 1±ε1\pmε. Here, working directly with the distributions of the …

2010-05-10abs ↗pdf ↗

We extend the model-free formula of [Fukasawa 2012] for E[Ψ(XT)]\mathbb E[Ψ(X_T)], where XT=logST/FX_T=\log S_T/F is the log-price of an asset, to functions ΨΨ of exponential growth. The resulting integral representation is written in terms of normalized implied volatilities. Just as Fukasawa's work provides rigourous ground for Ch…

2017-03-02abs ↗pdf ↗

We provide an integral representation for the (implied) copulas of dependent random variables in terms of their moment generating functions. The proof uses ideas from Fourier methods for option pricing. This representation can be used for a large class of models from mathematical finance, including Lévy and affine proc…

2011-08-04abs ↗pdf ↗

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 ↗

The Langevin Algorithm's stationary distribution is shown to be sub-exponential or sub-Gaussian under certain conditions.

problem Understanding the properties of the Langevin Algorithm's stationary distribution.
method Analysis using a rotation-invariant moment generating function (Bessel function) to study the stationary dynamics of the Langevin Algorithm.
result Concentration results for the Langevin Algorithm's stationary distribution πηπ_η are established, showing it is sub-exponential or sub-Gaussian under convex or strongly convex potential conditions.

The paper extends RDPG model to handle weighted graphs, enabling better analysis of network data.

problem Modeling networks with weighted edges to capture heterogeneous weight distributions.
method Proposes a nonparametric W-RDPG model with latent positions and moment-generating functions.
result Establishes statistical guarantees for estimating nodal latent positions and sampling graphs.

We propose a stochastic process driven by memory effect with novel distributions including both exponential and leptokurtic heavy-tailed distributions. A class of distribution is analytically derived from the continuum limit of the discrete binary process with the renormalized auto-correlation and the closed form momen…

2012-01-27abs ↗pdf ↗

We propose a stochastic process driven by the memory effect with novel distributions which include both exponential and leptokurtic heavy-tailed distributions. A class of the distributions is analytically derived from the continuum limit of the discrete binary process with the renormalized auto-correlation. The moment …

2012-03-26abs ↗pdf ↗

In this paper we will study the statistics of the unit geodesic flow normal to the boundary of a hyperbolic manifold with non-empty totally geodesic boundary. Viewing the time it takes this flow to hit the boundary as a random variable, we derive a formula for its moments in terms of the orthospectrum. The first moment…

2013-03-26abs ↗pdf ↗

The paper analyzes distances and volumes in lens spaces using recursion and formulas.

problem The problem of moments for distances between points on lens spaces.
method Derivation of recursion relations, formulas for moments and moment generating function, explicit formula for ball volumes.
result Explicit formulas for the volume of balls of all radii in lens spaces.

The MEM method uses data-driven priors for linear inverse problems, proving convergence and estimating differences.

problem Linear inverse problems with approximate priors.
method Maximum Entropy on the Mean (MEM) method with data-driven priors.
result Empirical mean convergence and estimates for prior differences based on epigraphical distance.

New method estimates log-determinant using trace powers, avoiding classical limitations.

problem Estimating log-determinant of large matrices efficiently and accurately.
method Interpolating moment-generating function and its derivative at zero using trace powers.
result No continuous estimator using finite moments can be uniformly accurate over unbounded conditioning.

Study on implied volatility of an affine jump-diffusion model.

problem Characterize implied volatility of an affine jump-diffusion model.
method Explicit moment generating function derived from solving ODEs; large deviation principle applied.
result Asymptotic behaviors of implied volatility in large-maturity and large-strike regimes characterized.

Proposes efficient calibration method for LIBOR Market Model with stochastic volatility.

problem Calibrating LIBOR Market Model with stochastic volatility.
method Derives analytical gradient of swaptions prices for DDSVLMM and uses it for gradient-based optimization.
result Analytical gradient-based calibration is highly competitive and efficient for DDSVLMM.

The iterative nature of the expectation maximization (EM) algorithm presents a challenge for privacy-preserving estimation, as each iteration increases the amount of noise needed. We propose a practical private EM algorithm that overcomes this challenge using two innovations: (1) a novel moment perturbation formulation…

2016-05-23abs ↗pdf ↗

We analyze the necessary and sufficient conditions for exact inference of a latent model. In latent models, each entity is associated with a latent variable following some probability distribution. The challenging question we try to solve is: can we perform exact inference without observing the latent variables, even w…

2019-01-28abs ↗pdf ↗

The paper analyzes multivariate payments in multi-state life insurance using Markovian state processes.

problem Analyzing joint effects of life annuities and death benefits in a multi-state framework.
method Introduces multivariate present value of future payments, derives differential equations and moment generating functions, and focuses on pair-wise covariances.
result Derives Hattendorff type results for pair-wise covariances in a disability model.

We improve bounds for stochastic processes, especially those with heavy tails.

problem Bounding the concentration of sub-ψψ processes with heavy tails.
method Variational approach to concentration, focusing on sub-Gaussian and other tail conditions.
result First dimension-free self-normalized empirical Bernstein inequality.

We propose an analytical approach to the computation of tail probabilities of compound distributions whose individual components have heavy tails. Our approach is based on the contour integration method, and gives rise to a representation of the tail probability of a compound distribution in the form of a rapidly conve…

2017-10-03abs ↗pdf ↗

Paper proves CLT for quantile SGD with constant learning rate.

problem Quantile estimation via SGD with non-smooth, non-strongly convex loss.
method Viewed as a Markov chain, derived stationary distribution, analyzed MGF, proved CLT.
result Centered and standardized stationary distribution converges to Gaussian as ηightarrow0η ightarrow0.

Maximal concentration bounds for stochastic approximation with heavy-tailed noise.

problem Analyzing the convergence of stochastic approximation algorithms under heavy-tailed Markovian noise.
method Novel Lyapunov function and black-box truncation argument.
result Tail behavior of the error can be sub-Gaussian, sub-Weibull, or lighter than any Pareto but heavier than any Weibull.

This work extracts stochastic dynamical systems with α\alpha-stable Lévy noise.

problem Extracting data-driven governing laws of dynamical systems with non-Gaussian noise.
method End-to-end deep learning approach for learning drift and diffusion coefficients for α\alpha-stable Lévy noise.
result Effectiveness of the method confirmed by numerical experiments.

DPFRL uses particle filters for decision making with complex visual observations.

problem Decision making with partial complex visual observations.
method Discriminative Particle Filter Reinforcement Learning (DPFRL) with a differentiable particle filter in the neural network policy.
result DPFRL outperforms state-of-the-art POMDP RL models in complex visual observation tasks.

The paper relaxes the stability condition to boost confidence in generalization for randomized learning algorithms.

problem The tension between uniform stability and L2L_2-stability in generalization bounds.
method Establishes in-expectation first moment generalization error bounds for L2L_2-stable randomized learning algorithms and uses subbagging to achieve near-tight exponential bounds.
result Improves generalization bounds for convex and non-convex optimization problems with SGD.

Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.

problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.

FFBO optimizes functions as inputs and outputs, improving on existing BO methods.

problem Optimizing functions as both inputs and outputs in complex systems.
method Function-on-function Gaussian process (FFGP) model with a separable operator-valued kernel, scalar upper confidence bound (UCB) acquisition function, and scalable functional gradient ascent algorithm (FGA).
result FFBO outperforms existing methods in synthetic and real-world data.

Chirped sinosoids and interferometric phase plots are functions that are not periodic, but are the composition of a smooth function and a periodic function. These functions functions factor into a pair of maps: from their domain to a circle, and from a circle to their codomain. One can easily imagine replacing the circ…

2015-01-25abs ↗pdf ↗