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.

169,291 papers · 148 categories

Trend · papers per month

2.0%4.0%6.0%8.0% · May 202619922001200920182026
48 results for continuous-time diffusion

We solve continuous-time latent SDE identifiability using diffusion shifts.

problem Identifiability of latent SDEs in continuous-time time series.
method Environment-induced shifts in diffusion covariance for additive-noise latent SDEs.
result Two diagonal diffusion regimes with distinct variance ratios identify latent coordinates up to permutation and scaling.

Improved continuous-time consistency models for large-scale image generation.

problem Training instability and discretization errors in existing diffusion models.
method Unified theoretical framework, improved diffusion process, and network architecture.
result Trained continuous-time CMs at 1.5B parameters, achieving state-of-the-art FID scores.

New algorithm for continuous-time switching systems using variational inference.

problem Inference in time-series data with continuous-time switching systems.
method Developed a variational inference algorithm combining Gaussian process approximation and posterior inference for Markov jump processes.
result Bayesian latent state estimates and point estimates of unknown parameters for arbitrary points on the real axis.

RL approach for continuous-time mean-variance portfolio selection with empirical validation.

problem Continuous-time mean-variance portfolio selection in unknown market coefficients.
method Reinforcement learning for diffusion processes, sublinear regret bound derivation.
result RL strategy consistently outperforms model-based counterparts, especially in volatile markets.

We solve continuous-time reinforcement learning using distributional Hamilton-Jacobi-Bellman equations.

problem Predicting the distribution of returns in continuous-time, stochastic environments.
method We derive a distributional Hamilton-Jacobi-Bellman equation for Itô diffusions and Feller-Dynkin processes, and propose an algorithm based on a JKO scheme.
result We propose an online control algorithm that can be used to approximately solve the distributional HJB equation.

Study a continuous-time PA problem with private effort and consumption decisions.

problem Continuous-time Principal-Agent problem with private information.
method Proposes a new sufficient condition for solving the agent's problem directly.
result Directly yields a solution to the agent's problem without verification.

New algorithm learns value and advantage functions for continuous-time Markov processes without structural assumptions.

problem Learning value and advantage functions for continuous-time Markov processes without structural assumptions.
method Proposes Sobolev-prox fitted qq-learning algorithm based on Hilbert-space positive definiteness and boundedness properties of Bellman operators.
result Identifies ellipticity as a key structural property enabling reinforcement learning for Markov diffusions.

Unified discrete diffusion for categorical data simplifies training and sampling.

problem Training and sampling in discrete diffusion models for categorical data.
method Mathematical simplifications and elegant unification of discrete-time and continuous-time discrete diffusion.
result Unified Simplified Discrete Denoising Diffusion (USD3) outperforms SOTA baselines.

Continuous time framework for discrete data denoising models.

problem Efficient training and sampling for discrete data denoising models.
method Formulated as Continuous Time Markov Chains (CTMCs), efficient training using continuous time ELBO, high-dimensional CTMC simulation, novel theoretical error bound.
result Continuous time treatment enables novel theoretical error bound between generated and true data distributions.

Study improves sampling efficiency of diffusion models using RL and PDEs.

problem Training neural stochastic differential equations without access to target samples.
method Proves equivalences between RL methods and PDEs, uses coarse time discretization.
result Improves sample efficiency and reduces computational cost.

Paper establishes a density formula for diffusion models, linking target density to score function.

problem Lack of theoretical foundation for optimizing DDPMs using ELBO.
method Developed a density formula for continuous-time diffusion processes, revealing the connection between target density and score function.
result The minimizer of the ELBO objective for DDPMs nearly coincides with the true objective, providing a theoretical foundation.

This primer explains diffusion models in general state spaces.

problem Diffusion models in general state spaces are not well-introduced.
method Develops discrete-time and continuous-time views of diffusion models, deriving Fokker-Planck and master equations.
result Unified understanding of diffusion models across continuous and discrete domains.

Study on policy gradient for stochastic bandits using diffusion approximation.

problem Improving policy gradient methods for stochastic bandits with optimal regret bounds.
method Continuous-time diffusion approximation of policy gradient with learning rate analysis.
result Proved optimal regret bound of O(klog(k)log(n)/η)O(k \log(k) \log(n) / η) for η=O(Δ2/log(n))η= O(Δ^2/\log(n)).

New algorithm maximizes adoption of multiple products in social networks with limited resources.

problem Maximizing adoption of multiple products in social networks with user attention, budget, and time constraints.
method Formulated as submodular maximization task in continuous-time diffusion model under matroid and multiple knapsack constraints. Proposed randomized algorithm estimating user influence and adaptive threshold greedy algorithm achieving good approximation factor.
result Achieves state-of-the-art effectiveness and scalability in maximizing adoption of multiple products.

Study optimal stopping for diffusion processes with unknown primitives, applying RL and martingale methods.

problem Optimal stopping for diffusion processes with unknown model primitives.
method Continuous-time reinforcement learning framework, variational inequality formulation, stochastic optimal control, entropy regularizer, semi-analytical optimal Bernoulli distribution, policy improvement theorem, policy iterations.
result Demonstrated high accuracy in learning value functions and characterizing free boundaries for various optimal stopping problems.

This paper tackles online estimation of diffusion process parameters.

problem Estimating parameters of partially observed diffusion processes online.
method Stochastic gradient ascent on incomplete-data log-likelihood.
result Convergence of the algorithm proved under ergodicity conditions.

LLapDiff models irregular multivariate time series without step-by-step integration.

problem Trade-off between discrete and continuous methods for long-horizon forecasting.
method Generative framework that models target as a low-dimensional latent trajectory, guided by modal parameterization and Laplace domain poles.
result Improves long-horizon forecasting over baselines and supports missing-value imputation.

Unified q-learning for mean-field jump-diffusion models with unobservable population distribution.

problem Continuous-time q-learning in mean-field jump-diffusion models with unobservable population distribution.
method Proposed decoupled Iq-function for unified policy evaluation in MFG and MFC problems; unified q-learning algorithm based on test policies and averaged martingale orthogonality condition.
result Unified policy evaluation rule for MFG and MFC problems based on decoupled Iq-function.

Recently, Ross showed that it is possible to recover an objective measure from a risk-neutral measure. His model assumes that there is a finite-state Markov process X that drives the economy in discrete time. Many authors extended his model to a continuous-time setting with a Markov diffusion process X with state space…

2014-10-08abs ↗pdf ↗

SDPM models survival analysis without parametric assumptions, achieving competitive performance.

problem Estimating survival distributions from censored data with flexibility and accuracy.
method Generative model using denoising diffusion, avoiding parametric assumptions and discretization.
result SDPM achieves competitive predictive performance across various metrics.

Develops diffusion models for time-varying correlation on the circle.

problem Time-varying correlation modeling on the circle.
method Stochastic processes on the unit circle, specifically Brownian motion and von Mises diffusion.
result Derives an accurate analytical approximation to the transition density of the von Mises diffusion.

Study optimal strategy for maximizing exponential utility in financial market with linear price impact.

problem Maximizing exponential utility in financial market with linear price impact.
method Purely probabilistic approach using duality.
result Computed optimal portfolio strategy and value for Ornstein-Uhlenbeck process.

Faster sampling in discrete diffusion models with predetermined transition time.

problem Efficiency in sampling discrete diffusion models.
method Discrete Non-Markov Diffusion Models (DNDM) with predetermined transition time.
result Significantly reduces the number of function evaluations for faster sampling.

Bayesian inference for stochastic differential equations using Wishart diffusions.

problem Inferring stochastic differential equations for regression and dynamical modeling.
method Bayesian non-parametric approach with semi-parametric Wishart processes.
result Modeling diffusion in stochastic differential equations improves performance and avoids overfitting.

This paper develops a mathematical framework for the analysis of continuous-time trading strategies which, in contrast to the classical setting of continuous-time mathematical finance, does not rely on stochastic integrals or other probabilistic notions. Our purely analytic framework allows for the derivation of a path…

2016-02-16abs ↗pdf ↗

DYffusion improves diffusion models for spatiotemporal forecasting.

problem Challenges in generating stable and accurate forecasts for dynamic data.
method Leverages temporal dynamics in data, directly coupling it with diffusion steps.
result Improves computational efficiency and performs competitively on complex dynamics.

We consider the inverse problem of reconstructing the posterior measure over the trajec- tories of a diffusion process from discrete time observations and continuous time constraints. We cast the problem in a Bayesian framework and derive approximations to the posterior distributions of single time marginals using vari…

2015-12-18abs ↗pdf ↗

This study shows how DDPM can be represented by the OU process.

problem Designing optimal noise schedules for DDPM.
method Formal equivalence between DDPM and OU process, heuristic designs based on Fisher Information.
result Fisher-Information-motivated schedule corresponds to cosine noise schedule.

Continuous-time Kyle model shows privacy subsidy from noise-perturbed order flow.

problem Quantifying break-even fees for committed-AMM exchanges under privacy-aggregated information.
method Extended Nakamura's (2026) single-period result to continuous-time, observing order flow perturbed by Brownian noise.
result Cumulative privacy subsidy is identified as equivalent to Loss-Versus-Rebalancing in price observation gap.

Continuous-time flows unify inference and density estimation.

problem Efficient inference and robust density estimation for latent-variable models.
method Continuous-time flows (CTFs) as a diffusion-based framework for both tasks.
result CTFs achieve both inference and density estimation in a unified framework with theoretical guarantees.

The continuous-time random walk (CTRW) is a pure-jump stochastic process with several applications in physics, but also in insurance, finance and economics. A definition is given for a class of stochastic integrals driven by a CTRW, that includes the Ito and Stratonovich cases. An uncoupled CTRW with zero-mean jumps is…

2008-02-26abs ↗pdf ↗

Study on MMV in jump-diffusion models resolves MV's non-monotonicity issues.

problem Non-monotonicity and free cash flow stream problems in MV preferences.
method Explicit solution for MMV preferences in jump-diffusion models, proving non-negative potential measures.
result MMV resolves MV's non-monotonicity and free cash flow stream issues.

Discrete diffusion models improve data generation for discrete data like language and graphs.

problem Adapting diffusion models to discrete state spaces for better data generation.
method Formulated as CTMCs, used uniformization of continuous Markov chains for sampling.
result Derive guarantees for sampling from any distribution on a hypercube, aligning with state-of-the-art achievements.

A new approach models exploration in continuous-time RL using random measures.

problem Modeling exploration in continuous-time reinforcement learning.
method Random measure approach to control execution in continuous-time RL.
result Grid-sampling limit SDE can replace existing models for theoretical analysis and learning algorithms.

RL for jump-diffusions applies to financial portfolio selection and option hedging.

problem Optimizing control in systems with jump-diffusion dynamics.
method Entropy-regularized exploratory control with stochastic policies, using existing diffusion algorithms with modifications.
result RL algorithms and parameterizations are invariant to jumps in jump-diffusion systems.

We consider the exact path sampling of the squared Bessel process and some other continuous-time Markov processes, such as the CIR model, constant elasticity of variance diffusion model, and hypergeometric diffusions, which can all be obtained from a squared Bessel process by using a change of variable, time and scale …

2009-10-21abs ↗pdf ↗

New framework for policy gradient methods in continuous time reinforcement learning.

problem Addressing policy gradient methods for continuous time reinforcement learning.
method Control randomisation technique to derive policy gradient representation for various Markovian control problems.
result Demonstrated application to optimal switching problems in the energy sector.

Develops stability conditions for estimating affine jump-diffusions.

problem Ergodicity and consistency of parameter estimation for affine jump-diffusions.
method Establishes stochastic stability conditions and ergodicity under specific conditions.
result Proves strong laws of large numbers and functional central limit theorems for additive functionals.