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

87173260346 · Jun 202019922001200920172026
48 results for Markovian Approximation

Paper establishes convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.

problem Analyzing convergence rates and concentration bounds for stochastic approximation and reinforcement learning with Markovian noise.
method Novel discretization of the mean ODE of stochastic approximation algorithms using intervals with diminishing length.
result First almost sure convergence rate and maximal concentration bound with exponential tails for contractive stochastic approximation algorithms with Markovian noise.

We develop a Markovian approximation for SVV models to compute hedging strategies.

problem Computing optimal hedging strategies for SVV models with non-Markovian noise.
method Develop a Markovian approximation of the Volterra noise kernel to compute hedging strategies.
result Error estimates for the approximation of volatility, prices, and optimal hedge.

We simplify a complex volatility model to make it easier to price options.

problem The rough Bergomi model's non-Markovian nature complicates option pricing.
method We approximate the rBergomi model with a Bergomi model that is Markovian.
result The rBergomi model can be effectively approximated by a Markovian model.

This work analyzes nonexpansive stochastic approximations with Markovian noise, proving convergence in reinforcement learning.

problem Applying stochastic approximation to reinforcement learning settings with nonexpansive operators.
method Investigates nonexpansive stochastic approximations with Markovian noise, providing asymptotic and finite sample analysis.
result First-time proof of convergence for classical tabular average reward temporal difference learning.

Paper derives convergence rates and confidence intervals for LSA with Markovian noise.

problem Analyzing convergence rates and constructing confidence intervals for LSA with Markovian noise.
method Derives non-asymptotic Berry-Esseen bounds and multiplier block bootstrap procedure.
result Provides O(n1/4)\mathcal{O}(n^{-1/4}) convergence rates and guarantees consistent inference.

Paper analyzes CLT for TTSA with Markovian noise, broadening its applications.

problem Analyzing asymptotic behavior of TTSA under Markovian noise.
method Central Limit Theorem applied to TTSA with Markovian noise.
result Uncovered coupled dynamics of TTSA influenced by Markov chain.

State spaces of multifactor approximations of nonnegative Volterra processes are linear transformations of the nonnegative orthant.

problem Characterizing state spaces of multifactor approximations of nonnegative Volterra processes.
method Explicit linear transformation of the nonnegative orthant.
result State spaces of multifactor approximations of nonnegative Volterra processes are given by explicit linear transformation of the nonnegative orthant.

Sparse Markovian Gaussian processes improve probabilistic model inference for large datasets.

problem Efficient inference for large-scale time series data.
method Combining inducing variables with Kalman filter-like recursions for linear scaling.
result General site-based approach for approximating non-Gaussian likelihoods.

Study on bias and extrapolation in LSA with Markovian data, showing bias reduction with Richardson-Romberg extrapolation.

problem Bias in LSA with constant stepsizes and Markovian data.
method Viewing LSA as a Markov chain, proving convergence and bias expansion, and applying Richardson-Romberg extrapolation.
result Bias is proportional to the stepsize up to higher order terms, and Richardson-Romberg extrapolation reduces the bias.

Study on statistical inference for nonlinear stochastic approximation with Markovian data.

problem Statistical inference for nonlinear stochastic approximation algorithms with Markovian data.
method Established a functional central limit theorem for the partial-sum process of the target parameter estimate, providing asymptotic pivotal statistics for constructing confidence intervals.
result Valid and efficient asymptotic inference method for nonlinear stochastic approximation algorithms with Markovian data.

Study on bias of constant-step stochastic approximation with Markovian noise.

problem Understanding the bias in stochastic approximation algorithms with Markovian noise.
method Infinitesimal generator comparisons to analyze bias, Lyapunov equation for time-averaged bias, Richardson-Romberg extrapolation for bias reduction.
result Bias of the algorithm is of order O(α)O(α) and time-averaged bias is αV+O(α2)αV + O(α^2), where VV is a constant.

Paper analyzes finite-time performance of SA in RL with Markovian noise.

problem Finite-time analysis of linear two-timescale stochastic approximation with Markovian noise.
method Finite-time analysis of linear two-timescale SA with Markovian noise, considering both transient and steady-state terms.
result No discrepancy in convergence rate between Markovian and martingale noise; transient term is o(1/kc)o(1/k^c) and steady-state term is O(1/k){\cal O}(1/k).

Paper examines constant stepsize in LSA for Markovian data inference.

problem Improving statistical inference with constant stepsize in LSA for Markovian data.
method Established CLT, used averaged LSA iterates, applied Richardson-Romberg extrapolation.
result Constant stepsize leads to better CI coverage, especially with limited data.

We analyze SA with Markovian data and nonlinear updates, overcoming prior limitations.

problem Analyzing stochastic approximation with Markovian data and nonlinear updates.
method Fine-grained analysis of SA iterates and Markovian data, leveraging smoothness and recurrence properties.
result Established weak convergence and precise asymptotic bias of SA iterates.

This study improves convergence of two-timescale SA under Markovian noise in reinforcement learning.

problem Stability and convergence of two-timescale stochastic approximations under Markovian noise.
method Introduced a new control strategy for the fast timescale parameter.
result Established almost sure convergence of TDC with eligibility traces under off-policy learning with linear function approximation.

New bounds for SA with arbitrary norm contractions and Markovian noise.

problem Finite-time analysis of two-time-scale stochastic approximation with arbitrary norm contractions and Markovian noise.
method Use of generalized Moreau envelope for arbitrary norm contractions and solutions of Poisson equation for Markovian noise.
result Mean square error decays at rates of O(1/n2/3)O(1/n^{2/3}) and O(1/n)O(1/n) under different conditions.

Unified analytical tool for non-Markovian jump processes.

problem Analyzing history-dependent jump processes with non-Markovian behavior.
method Developed a standard form of master equations using Laplace-space embedding and asymptotic solution.
result Unified analytical toolset for general non-Markovian processes, leading to the GLE approximation.

Paper analyzes Greedy-GQ for reinforcement learning with Markovian noise.

problem Analyzing Greedy-GQ for reinforcement learning with Markovian noise.
method Develops finite-sample analysis for Greedy-GQ with linear function approximation under Markovian noise.
result Provides theoretical justification for choosing stepsizes for faster convergence.

The ADO-Heston model approximates market implied skew in vanilla options.

problem Reproduce market implied skew in vanilla options using a Markovian approximation.
method Derived characteristic function under risk-neutral and real measures, chose market price of risk, found closed form for log-price CF and implied skew.
result The ADO-Heston model can approximate the vanilla implied skew at small TT but not exactly as rough volatility models.

Paper provides exponential convergence guarantees for Iterative Markovian Fitting.

problem Addressing the Schrödinger Bridge problem in computational optimal transport and generative modeling.
method Develops non-asymptotic exponential convergence guarantees for Iterative Markovian Fitting.
result First non-asymptotic exponential convergence guarantees for IMF under mild structural assumptions.

Paper analyzes convergence of Adam-type RL algorithms under Markovian sampling.

problem Theoretical convergence analysis of Adam-type RL algorithms.
method Develops techniques for analyzing convergence under Markovian sampling.
result PG-AMSGrad and TD-AMSGrad converge to stationary points or global optima at specified rates.

The paper analyzes convergence rates for stochastic approximation and reinforcement learning.

problem Establishing almost sure convergence rates for stochastic approximation and reinforcement learning under Markovian noise.
method A novel Lyapunov drift construction that applies a Poisson-equation based correction for Markovian noise to the Moreau-envelope smoothing for contractive mappings.
result Almost sure convergence rates for specific learning rates are derived, with rates arbitrarily close to o(n12η)o(n^{1 - 2η}) and o(n1)o(n^{-1}).

The paper develops methods to price options under rough volatility models using BSPDEs.

problem Pricing options in models with non-Markovian dynamics.
method Backward stochastic partial differential equations (BSPDEs) and deep learning for numerical approximations.
result Existence and uniqueness of weak solutions for general nonlinear BSPDEs.

A new model for S&P 500 and VIX options pricing and calibration.

problem Calibrating and pricing S&P 500 and VIX options with a 4-factor path-dependent volatility model.
method Pathwise neural network approximation of VIX, leveraging Markovianity of the 4-factor model.
result The model accurately fits S&P 500 implied volatilities and reproduces VIX option smiles.

Optimal strategies are found for a repeated betting game using diffusion approximation.

problem Finding optimal strategies for a repeated betting game with i.i.d. outcomes.
method Constructing a diffusion approximation of the repeated game and analyzing the wealth share process.
result Necessary and sufficient conditions for the wealth share process to be transient or recurrent are derived.

This paper develops a Hoeffding inequality for the partial sums k=1nf(Xk)\sum_{k=1}^n f (X_k), where {Xk}kZ>0\{X_k\}_{k \in \mathbb{Z}_{> 0}} is an irreducible Markov chain on a finite state space SS, and f:S[a,b]f : S \to [a, b] is a real-valued function. Our bound is simple, general, since it only assumes irreducibility and finiteness…

2020-01-05abs ↗pdf ↗

Paper tackles non-Markovian control problems with new learning methods.

problem Non-Markovian stochastic control problems with unknown parameters.
method Off-model training and importance sampling for deep neural network approximation.
result Quantitative error bounds for adaptive learning under model uncertainty.

Rough volatility models are very appealing because of their remarkable fit of both historical and implied volatilities. However, due to the non-Markovian and non-semimartingale nature of the volatility process, there is no simple way to simulate efficiently such models, which makes risk management of derivatives an int…

2018-01-31abs ↗pdf ↗

Paper analyzes convergence of decentralized algorithms with noise and bias.

problem Finite time convergence analysis of decentralized stochastic approximation schemes.
method Separated iterates into consensual parts and consensus error; bounded consensus error in terms of stationarity.
result Decentralized SA scheme converges at O(logT/T){\cal O}(\log T/ \sqrt{T} ) rate.

Unified framework for finite-sample RL algorithms using Lyapunov theory.

problem Finite-sample convergence guarantees of asynchronous RL algorithms.
method Reformulate RL algorithms as Markovian SA, develop Lyapunov analysis.
result Mean-square error bounds and convergence for various RL algorithms.

The paper analyzes stability of random matrix products with Markovian noise.

problem Analyzing stability of random matrix products with Markovian noise.
method Using a super-Lyapunov drift condition and controlled growth of matrix-valued functions, the paper provides an exponential stability result for the p-th moment of random matrix product.
result Finite-time p-th moment bounds for linear stochastic approximation and TD learning algorithms.

A new method for online VI in SSMs using asymptotic contrast.

problem Lack of functionality for streaming data in standard VI methods for SSMs.
method Propose maximising an IWAE-type variational lower bound on the asymptotic contrast function using stochastic approximation.
result OSIWAE allows for online learning of model parameters and latent states.

Efficient simulation scheme for rough Heston model reduces computational cost.

problem Accurate and efficient simulation of the rough Heston model for option pricing.
method Weak simulation scheme based on Markovian approximations of the rough Heston process.
result The new scheme exhibits second order weak convergence with linear computational cost.

The paper provides mean-square error bounds for stochastic approximation algorithms.

problem Error bounds for recursive equations with Markovian disturbances.
method Analysis of mean-square error for stochastic approximation algorithms.
result Mean-square error achieves the optimal rate of O(1/n)O(1/n) under certain conditions.

New algorithm solves complex stopping problems with robust optimization.

problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.

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.

NO approximates non-Markovian BSDEs with polynomial scaling in 1/ε.

problem Complexity of NO approximations for structured families of BSDEs.
method Identifying structured families of non-Markovian BSDEs, informing NO's inductive bias.
result Polynomial scaling in 1/ε for NO approximations of BSDE solution operators.

We describe a Markov latent state space (MLSS) model, where the latent state distribution is a decaying mixture over multiple past states. We present a simple sampling algorithm that allows to approximate such high-order MLSS with fixed time and memory costs.

2017-11-08abs ↗pdf ↗