Searcharxiv⌕ Search

arXiv subjects

Nian Yao

Publications and source records attributed to Nian Yao.

8 recordsLinked to original sources
arXiv2026

Accelerating Langevin Monte Carlo Sampling: A Large Deviations Analysis

Langevin algorithms are popular Markov chain Monte Carlo methods that are often used to solve high-dimensional large-scale sampling problems in machine learning. The most classical Langevin Monte Carlo algorithm is based on the overdamped Langevin dynamics. There are many variants of Langevin dynamics that often show superior performance in practice. In this paper, we provide a unified approach to study the acceleration of the variants of the overdamped Langevin dynamics through the lens of large deviations theory. Numerical experiments using both synthetic and real data are provided to illustrate the efficiency of these variants.

math.PR↗
arXiv2025

High-Order Langevin Monte Carlo Algorithms

Langevin algorithms are popular Markov chain Monte Carlo (MCMC) methods for large-scale sampling problems that often arise in data science. We propose Monte Carlo algorithms based on the discretizations of $P$-th order Langevin dynamics for any $P\geq 3$. Our design of $P$-th order Langevin Monte Carlo (LMC) algorithms is by combining splitting and accurate integration methods. We obtain Wasserstein convergence guarantees for sampling from distributions with log-concave and smooth densities. Specifically, the mixing time of the $P$-th order LMC algorithm scales as $O\left(d^{\frac{1}{R}}/ε^{\frac{1}{2R}}\right)$ for $R=4\cdot 1_{\{ P=3\}}+ (2P-1)\cdot 1_{\{ P\geq 4\}}$, which has a better dependence on the dimension $d$ and the accuracy level $ε$ as $P$ grows. Numerical experiments illustrate the efficiency of our proposed algorithms.

stat.ML↗
arXiv2025

Scaling limits for INAR$(\infty)$ processes

In this paper, we study law of large numbers, central limit theorem, large and moderate deviations for INAR($\infty$) processes, which as a special case, includes both discrete-time linear Hawkes process and INAR(1) process in the literature. Our results recover existing results on large and moderate deviations for the discrete-time Hawkes process as studied in \cite{Wang2} and for the INAR(1) process as in \cite{Yu}.

math.PR↗
arXiv2020

Asymptotic Smiles for an Affine Jump-Diffusion Model

In this paper, we study the asymptotic behaviors of implied volatility of an affine jump-diffusion model. Let log stock price under risk-neutral measure follow an affine jump-diffusion model, we show that an explicit form of moment generating function for log stock price can be obtained by solving a set of ordinary differential equations. A large-time large deviation principle for log stock price is derived by applying the Gärtner-Ellis theorem. We characterize the asymptotic behaviors of the implied volatility in the large-maturity and large-strike regime using rate function in the large deviation principle. The asymptotics of the Black-Scholes implied volatility for fixed-maturity, large-strike and fixed-maturity, small-strike regimes are also studied. Numerical results are provided to validate the theoretical work.

q-fin.MF↗
arXiv2017

Optimal excess-of-loss reinsurance and investment problem for an insurer with default risk under a stochastic volatility model

In this paper, we study an optimal excess-of-loss reinsurance and investment problem for an insurer in defaultable market. The insurer can buy reinsurance and invest in the following securities: a bank account, a risky asset with stochastic volatility and a defaultable corporate bond. We discuss the optimal investment strategy into two subproblems: a pre-default case and a post-default case. We show the existence of a classical solution to a pre-default case via super-sub solution techniques and give an explicit characterization of the optimal reinsurance and investment policies that maximize the expected CARA utility of the terminal wealth. We prove a verification theorem establishing the uniqueness of the solution. Numerical results are presented in the case of the Scott model and we discuss economic insights obtained from these results.

q-fin.PM↗
arXiv2007

Transportation-information inequalities for Markov processes

In this paper, one investigates the following type of transportation-information $T_cI$ inequalities: $α(T_c(ν,μ))\le I(ν|μ)$ for all probability measures $ν$ on some metric space $(\XX, d)$, where $μ$ is a given probability measure, $T_c(ν,μ)$ is the transportation cost from $ν$ to $μ$ with respect to some cost function $c(x,y)$ on $\XX^2$, $I(ν|μ)$ is the Fisher-Donsker-Varadhan information of $ν$ with respect to $μ$ and $α: [0,\infty)\to [0,\infty]$ is some left continuous increasing function. Using large deviation techniques, it is shown that $T_cI$ is equivalent to some concentration inequality for the occupation measure of a $μ$-reversible ergodic Markov process related to $I(\cdot|μ)$, a counterpart of the characterizations of transportation-entropy inequalities, recently obtained by Gozlan and Léonard in the i.i.d. case . Tensorization properties of $T_cI$ are also derived.

math.PR↗