Masking diffusion outperforms other discrete diffusion models by incorporating jump times into the model.
problem Improving the performance of discrete diffusion models.
method Conditioning on the jump schedule of discrete Markov processes.
result Schedule-conditioned discrete diffusion (SCUD) models outperform classical and masking diffusion models.
Paper proposes a new method for training diffusion models using Markov operators.
problem Training efficiency and accuracy in diffusion models.
method Operator-informed score matching using spectral decomposition of Markov operators.
result Improved score matching for both low and high-dimensional distributions.
This work extends ME-RL using diffusion models to sample optimal policies.
problem Sampling from the optimal policy trajectory distribution in ME-RL.
method Introducing Diffusion-Augmented Markov Decision Processes (DA-MDPs) to minimize reverse KL divergence.
result DA-MDPs enable seamless integration into various ME-RL methods and outperform baselines.
Proposes MLEs for MMJDM with EM-algorithm.
problem Estimating stock prices with varying drift and volatility.
method EM-algorithm for MLEs of MMJDM.
result Validated with simulated data and fitted to Amazon and Netflix stock prices.
Optimizes control of hybrid systems with multiple switching processes.
problem Optimal control of hybrid systems with multiple Markov switching processes.
method Combines two separate Markov chains into one synthetic chain, derives HJB equations, and solves the portfolio choice problem.
result Derives explicit solutions and value functions for the optimal control problem.
The paper explores how mixing and diffusion mechanisms can enhance privacy in data processing.
problem Enhancing privacy guarantees of data mechanisms through post-processing.
method The study uses Markov operators and coupling arguments to analyze privacy amplification.
result The introduction of a new family of diffusion-based mechanisms that are closed under post-processing.
This study bridges discrete and continuous state spaces using the Ehrenfest process and diffusion models.
problem Understanding the relationship between discrete and continuous state spaces in stochastic processes.
method Investigates time-continuous Markov jump processes on discrete state spaces and their correspondence to state-continuous diffusion processes.
result The time-reversal of the Ehrenfest process converges to the time-reversed Ornstein-Uhlenbeck process, bridging discrete and continuous state spaces.
The paper analyzes the trade-off between computational savings and statistical error in approximating diffusions and Markov chains.
problem The trade-off between computational savings and statistical error in approximating diffusions and Markov chains.
method Develops general results on the Wasserstein distance between equilibrium distributions of two diffusions, and applies these results to derive finite-sample error bounds for approximate Langevin dynamics and zig-zag sampling.
result Characterizes the computational-statistical trade-off and provides insights into when approximate methods can lead to more accurate samples.
Deep model learns graph structure with context diffusion.
problem Processing structured graph data efficiently.
method Constructive deep architecture with probabilistic models.
result Generative approach improves graph structure classification.
The paper proposes a method to approximate posterior distributions of diffusion and jump processes from discrete observations.
problem Reconstructing posterior measures over trajectories of diffusion and jump processes from discrete observations.
method Variational approximate inference applied to Bayesian framework for diffusion processes, extended to Markov jump processes.
result The method provides computationally efficient approximations for inverse problems in diffusion and jump processes.
Method calculates Parisian stopping times and option prices using Markov chains.
problem Computing distribution and pricing of Parisian stopping times under Markov processes.
method Continuous-time Markov chain approximation to solve for distribution and convergence analysis.
result Sharp convergence rate and efficient method for diffusion and jump models.
RML improves generative modeling of complex distributions.
problem Learning complex distributions in applications.
method RML defines a forward process to a known distribution, then learns a reverse Markov process.
result RML efficiently captures complex distributions in simulations and climate data.
Paper introduces DMPMs for efficient discrete data generation with sharp convergence bounds.
problem Efficient generation of discrete data with theoretical guarantees.
method Discrete Markov Probabilistic Models (DMPMs) operating in bit space with time-reversal process.
result Sharp convergence bounds established under minimal assumptions, competitive performance in discrete data generation.
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.
In this paper we propose a semi-Markov modulated model of interest rates. We assume that the switching process is a semi-Markov process with finite state space E and the modulated process is a diffusive process. We derive recursive equations for the higher order moments of the discount factor and we describe a Monte Ca…
The paper sets criteria for no arbitrage in complex financial models.
problem Determining conditions for the absence of arbitrage in financial markets.
method Established deterministic conditions for no arbitrage, NUPBR, and NFLVR in diffusion market models.
result Provided criteria in terms of scale function and speed measure.
We show by explicit closed form calculations that a Hurst exponent H that is not 1/2 does not necessarily imply long time correlations like those found in fractional Brownian motion. We construct a large set of scaling solutions of Fokker-Planck partial differential equations where H is not 1/2. Thus Markov processes, …
Study on Mirror Langevin diffusions for convergence rates and Markov chain approximations.
problem Convergence rates and approximations for Mirror Langevin diffusions.
method Lyapunov function methods, Poincaré and log-Sobolev inequalities, Gibbs sampler, Sinkhorn Markov chain.
result Sufficient conditions for exponential convergence of Mirror Langevin diffusions and a guaranteed convergence rate for the Markov chain approximation.
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 q-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.
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.
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.
Paper develops models for better HFT and algorithmic trading.
problem Inaccurate LOB dynamics in financial markets.
method Semi-Markov and Hawkes jump-diffusion models for LOB dynamics.
result Improved trading strategies through precise model application.
In this paper we present an algorithm for pricing barrier options in one-dimensional Markov models. The approach rests on the construction of an approximating continuous-time Markov chain that closely follows the dynamics of the given Markov model. We illustrate the method by implementing it for a range of models, incl…
Study optimal portfolio selection in a complex market with jumps and regime shifts.
problem Optimal portfolio selection in a market with jumps and regime shifts.
method Modeling a market with Lévy processes and regime switching, using various securities to complete the market, solving the portfolio selection problem for power and logarithmic utilities.
result Conditions for asymptotic-arbitrage-free market and solutions for optimal portfolio selection.
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.
Develops RL for optimal market-making in non-Markov processes.
problem Optimal market-making in non-Markov price processes.
method Deep reinforcement learning with Soft Actor-Critic (SAC) algorithm.
result Optimal strategy for market-making in semi-Markov and Hawkes Jump-Diffusion dynamics.
Using results from our companion article [arXiv:1112.4824v2] on a Schauder approach to existence of solutions to a degenerate-parabolic partial differential equation, we solve three intertwined problems, motivated by probability theory and mathematical finance, concerning degenerate diffusion processes. We show that th…
Unified approach to denoising Markov models for efficient sampling.
problem Designing efficient sampling algorithms for complex distributions.
method Mathematical foundation using measure transport and nonequilibrium statistical mechanics.
result Unified variational objective and backward generator construction.
Generative Fractional Diffusion Models improve image diversity and quality.
problem Diffusion models struggle with diversity, mode-collapse, and slow convergence.
method Replaces light-tailed BM with fractional Brownian motion (fBM) and its Markov approximation (MA-fBM).
result GFDM achieves greater diversity and quality in image generation.
New method uses diffusions to measure sample quality in multivariate targets.
problem Measuring convergence to multivariate continuous targets.
method Ito diffusions and explicit multivariate Stein factor bounds.
result Established near-linear relationship between diffusion Stein discrepancies and Wasserstein distances.
Study of Markov-modulated affine processes for richer models in finance.
problem Richer models in various applications.
method Martingale problem approach, characteristic function derivation, mathematical properties study.
result Existence and characteristic function of Markov-modulated affine processes.
Derives conditions for no arbitrage in financial markets with stochastic or diffusion models.
problem Existence and absence of arbitrage in financial markets with stochastic or diffusion models.
method Integral tests, martingale and strict local martingale properties of stochastic exponentials, Markov switching models.
result Conditions for the existence of minimal martingale measure and its preservation under Markov switching.
Proposes HMHP for joint modeling of user-topic interactions.
problem Complex interactions between users, topics and time on social media.
method Hidden Markov Hawkes Process (HMHP) incorporating topical Markov Chains.
result HMHP outperforms state-of-the-art models in generalization and accuracy.
New method simulates sticky boundaries in multidimensional diffusions.
problem Simulating sticky boundaries in multidimensional diffusions.
method Approximate sticky diffusion by a Markov chain, using either finite difference or matching local moments.
result Validates both construction methods for first-order simulation schemes.
New self-exciting random evolutions (SEREs) for modeling traffic and transport processes.
problem Modeling self-exciting and clustering effects in traffic and transport processes.
method Introducing a new process based on a superposition of a Markov chain and a Hawkes process, and constructing self-exciting random evolutions (SEREs).
result Developed new models and limit theorems for SEREs, including averaging and diffusion approximation.
The paper analyzes sampling and estimation on manifolds using Langevin diffusion.
problem Sampling and estimation on compact Riemannian manifolds.
method Discretization of Langevin diffusion with error bounds derived.
result First-order error bounds for bias and variance in estimators.
In this paper a new dissimilarity measure to identify groups of assets dynamics is proposed. The underlying generating process is assumed to be a diffusion process solution of stochastic differential equations and observed at discrete time. The mesh of observations is not required to shrink to zero. As distance between…
QTD integrates quantization with diffusion for efficient data generation.
problem Challenges in continuous diffusion models, especially long-range transitions and biases.
method Quantized Transition Diffusion (QTD) integrates data quantization with discrete diffusion dynamics.
result QTD achieves efficient data generation with minimal score evaluations.
Neural network approximates diffusion bridges for efficiency and robustness.
problem Efficient simulation of conditioned diffusion processes, especially rare events and multimodal distributions.
method Trains a neural network to approximate bridge dynamics, eliminating MCMC and score modeling.
result Efficient sampling of conditioned diffusion bridges at comparable cost to unconditioned process.
New theory improves diffusion models' convergence rates.
problem Understanding and optimizing diffusion models for faster data generation.
method Developed non-asymptotic theory for diffusion models with minimal assumptions.
result Established convergence rates for two diffusion models.
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 …
Unified framework for pricing various debt securities.
problem Pricing of different types of debt securities under general short-rate processes.
method Unifying framework using continuous-time Markov chain approximations and bi-dimensional diffusion processes.
result Closed-form matrix expressions and efficient algorithms for pricing various debt securities.
Generative models using PDMPs with explicit jump rates and kernels.
problem Creating efficient generative models for complex data distributions.
method Piecewise deterministic Markov processes (PDMPs) with explicit expressions for jump rates and kernels.
result Efficient training and simulation methods for PDMP-based generative models.
Paper reviews methods for conditional sampling in generative diffusion models.
problem Extending generative diffusion models to sample from conditional distributions.
method Review of existing computational approaches to conditional sampling.
result Highlight key methodologies for constructing conditional generative samplers.
Bayesian inference for biochemical reaction networks using jump-diffusion approximations.
problem Estimating hidden quantities in poorly characterized biochemical processes.
method Developed a Bayesian inference algorithm based on Markov chain Monte Carlo and sequential Monte Carlo methods.
result Numerical evaluation of the algorithm for a partially observed multi-scale birth-death process.
SGLDiff approximates Bayesian posterior distributions with subsampling error.
problem Approximating Bayesian posterior distributions in large-scale data settings.
method Stochastic Gradient Langevin Diffusion (SGLDiff) with subsampling.
result The Wasserstein distance between the posterior and SGLDiff's limiting distribution is bounded by a fractional power of the mean waiting time.
The paper uses diffusion processes to analyze SGD for nonconvex optimization problems.
problem Understanding the global dynamics of nonconvex optimization methods.
method Analytic paradigm based on diffusion processes.
result Characterizes the global dynamics of SGD for tensor decomposition of ICA.
The paper proves formulas for solving certain types of stochastic problems.
problem Solving boundary value and obstacle problems for degenerate elliptic and parabolic equations.
method Uses Feynman-Kac formulas for a general Markov diffusion process with degenerate elliptic generator.
result Provides unique solutions for smooth and non-smooth cases under Dirichlet boundary conditions.