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

118235353470 · Jun 202019922001200920172026
48 results for continuous-time Markov processes

Study approximates financial market with discrete-time models.

problem Approximating continuous-time financial market models with discrete-time.
method Constructs discrete-time market models with Markov switching and proves convergence.
result Discrete-time models converge to continuous-time Black-Scholes model with Markov switching.

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.

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.

Logarithmic regret for continuous-time reinforcement learning.

problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.

New model for insurance states using Markov jump processes with non-countable state space.

problem Modeling insurance states with non-countable state spaces.
method Developed a new Thiele's differential equation for continuous time rehabilitation rates.
result Allows for consistent calculation of reserves in disability insurance.

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.

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 ↗

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…

2009-08-27abs ↗pdf ↗

We solve a continuous-time game-theoretic problem for Kihlstrom-Mirman preferences.

problem Dynamic inconsistency in preferences due to multiattribute utility theory.
method Formalized an equilibrium control theory for continuous-time Markov processes.
result Equilibrium strategy and value function as solution to extended HJB system.

Efficiently infers coupled hidden Markov models with noisy discrete observations.

problem Intractable inference for coupled continuous-time Markov chains with discrete observations.
method Latent Interacting Particle Systems, look-ahead functions, twisted Sequential Monte Carlo sampling.
result Demonstrated effectiveness on latent SIRS model and wildfire spread dynamics.

New CTBNs with clocks allow for non-exponential survival times.

problem Modeling phenomena with non-exponential survival times in continuous time.
method Introduced node-wise clocks to construct graph-coupled semi-Markov chains, enabling non-exponential survival times without auxiliary states.
result Parameter and structure inference algorithms provided, demonstrating advantages over current CTBN extensions.

DQNs can approximate optimal Q-functions with high accuracy on compact sets.

problem Approximating optimal Q-functions in continuous-time Markov Decision Processes.
method Stochastic control, FBSDEs, residual network approximation theorems, large deviation bounds, viscosity solutions.
result DQNs can approximate optimal Q-functions on compact sets with arbitrary accuracy and high probability.

New entropy flow method extends generalization bounds for all Markov algorithms.

problem Understanding generalization error for Markov algorithms.
method Unified framework using continuous-time approximation and modified logarithmic Sobolev inequalities.
result Established new connections between generalization error and ergodic properties of Markov processes.

Fluid approximations have seen great success in approximating the macro-scale behaviour of Markov systems with a large number of discrete states. However, these methods rely on the continuous-time Markov chain (CTMC) having a particular population structure which suggests a natural continuous state-space endowed with a…

2019-01-31abs ↗pdf ↗

Paper approximates rough stochastic local volatility models for efficient computation.

problem No unified method for rough stochastic local volatility models.
method Semimartingale and continuous-time Markov chain approximation.
result Fast CTMC algorithm with weak convergence proved.

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 Bayesian networks (CTBNs) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cyclic) dependency graph over a set of variables, each of which represents a finite state continuous time Markov process whose transition model is…

2012-10-19abs ↗pdf ↗

We consider models of the population or opinion dynamics which result in the non-linear stochastic differential equations (SDEs) exhibiting the spurious long-range memory. In this context, the correspondence between the description of the birth-death processes as the continuous-time Markov chains and the continuous SDE…

2019-04-30abs ↗pdf ↗

In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a Hamiltonian Monte Carlo algorithm using a continuous time Markov jump process, and ar…

2015-09-13abs ↗pdf ↗

In this paper we consider long-run risk sensitive average cost impulse control applied to a continuous-time Feller-Markov process. Using the probabilistic approach, we show how to get a solution to a suitable continuous-time Bellman equation and link it with the impulse control problem. The optimal strategy for the und…

2019-12-05abs ↗pdf ↗

New method infers hidden states in continuous-time phenomena better than traditional models.

problem Traditional HSMM's are limited to discrete time grids and cannot handle irregularly spaced data.
method Formulated integro-differential forward and backward equations for CTSMC's, introduced scalable Viterbi-type algorithm.
result Efficiently solved equations for posterior marginals and path estimates.

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.

We study a portfolio selection problem in a continuous-time Itô-Markov additive market with prices of financial assets described by Markov additive processes which combine Lévy processes and regime switching models. Thus the model takes into account two sources of risk: the jump diffusion risk and the regime switching …

2018-06-09abs ↗pdf ↗

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 ↗

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.

A new RG approach connects discrete and continuous time descriptions of Gaussian processes.

problem Discretization of continuous stochastic processes for accurate simulation or model inference.
method Renormalization Group (RG) approach for Gaussian time series generated by auto-regressive models.
result RG fixed points correspond to discretizations of linear SDEs, providing insights into process accuracy.

Paper solves POMDPs in continuous time and discrete spaces.

problem Optimal decision making in discrete state and action space systems under partial observability.
method Combining optimal filtering theory and deep learning to solve a Hamilton-Jacobi-Bellman equation.
result Derives a mathematical description and solution approach for continuous-time POMDPs.

In many fields observations are performed irregularly along time, due to either measurement limitations or lack of a constant immanent rate. While discrete-time Markov models (as Dynamic Bayesian Networks) introduce either inefficient computation or an information loss to reasoning about such processes, continuous-time…

2012-03-15abs ↗pdf ↗

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.