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

1345 · Oct 202519922001200920172026
48 results for time-discretization

New methods for inferring, predicting, and estimating continuous-time, discrete-event processes.

problem Inferring, predicting, and estimating entropy rate of continuous-time, discrete-event processes.
method Bayesian structural inference extended with neural networks.
result Methods are competitive for prediction and entropy-rate estimation with state-of-the-art.

Efficient deep policy gradient method for continuous-time control problems.

problem Optimal control in continuous time with fine time discretization.
method Multi-scale deep policy gradient method with varying time discretization.
result Targeted efficiency in computational resources achieved through multi-scale approach.

New insights into RL efficiency from managing time discretization.

problem The impact of time discretization on RL methods in continuous-time systems.
method Analysis of Monte-Carlo policy evaluation for LQR systems.
result An optimal choice of temporal resolution for a given data budget improves policy evaluation efficiency.

Despite remarkable successes, Deep Reinforcement Learning (DRL) is not robust to hyperparameterization, implementation details, or small environment changes (Henderson et al. 2017, Zhang et al. 2018). Overcoming such sensitivity is key to making DRL applicable to real world problems. In this paper, we identify sensitiv…

2019-01-28abs ↗pdf ↗

We generalize the primal-dual methodology, which is popular in the pricing of early-exercise options, to a backward dynamic programming equation associated with time discretization schemes of (reflected) backward stochastic differential equations (BSDEs). Taking as an input some approximate solution of the backward dyn…

2013-10-14abs ↗pdf ↗

We constructively prove the existence of time-discrete consumption processes for stochastic money accounts that fulfill a pre-specified positively homogeneous projection property (PHPP) and let the account always be positive and exactly zero at the end. One possible example is consumption rates forming a martingale und…

2007-11-27abs ↗pdf ↗

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.

Numerous empirical proofs indicate the adequacy of the time discrete auto-regressive stochastic volatility models introduced by Taylor in the description of the log-returns of financial assets. The pricing and hedging of contingent products that use these models for their underlying assets is a non-trivial exercise due…

2011-10-28abs ↗pdf ↗

New simulation method simplifies Heston model with Poisson conditioning for better accuracy and efficiency.

problem Computational expense in exact simulation schemes for Heston model.
method Proposes a new exact simulation scheme without modified Bessel function evaluations, leveraging conditional integrated variance simplification.
result Good performance in terms of accuracy, efficiency, and reliability compared to existing methods.

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.

Continuous time stochastic processes are useful models especially for financial and insurance purposes. The numerical simulation of such models is dependant of the time discrete discretization, of the parametric estimation and of the choice of a random number generator. The aim of this paper is to provide the tools for…

2010-01-12abs ↗pdf ↗

In this paper a simple, effective adaptation of Alternating Direction Implicit (ADI) time discretization schemes is proposed for the numerical pricing of American-style options under the Heston model via a partial differential complementarity problem. The stability and convergence of the new methods are extensively inv…

2013-08-31abs ↗pdf ↗

Deep reinforcement learning boosts commodities trading performance.

problem Improving algorithmic trading performance in commodities markets.
method Formulated as a stochastic dynamical system, employed actor-based and actor-critic-based policy gradient algorithms with CNN and LSTM function approximators.
result DRL models increase Sharpe ratio by 83% compared to buy-and-hold.

D2SRM solves complex PDEs using deep learning.

problem High-dimensional, Hessian-dependent fully nonlinear parabolic PDEs.
method Single scalar space-time network generating derivative-consistent approximations trained through residuals and penalties.
result Well-posedness and convergence theory established for globally Lipschitz equations.

Improved convergence rates for MFLD in various gradient estimators.

problem Proving convergence rates for mean-field Langevin dynamics with stochastic gradient updates.
method General framework for propagation of chaos, including finite-particle approximation, time-discretization, and stochastic gradient approximation.
result Improved convergence rates for SGD and SVRG settings.

Constructs approximate mean curvature flows for general varifolds.

problem Mean curvature flow for general initial data.
method Approximation of mean curvature flows using varifolds and iterated push-forwards.
result Approximate mean curvature flow converges to a spacetime Brakke flow under certain conditions.

Forward-Euler fails for simulating Wasserstein gradient flows with KL divergence.

problem Simulating Wasserstein gradient flows with forward-Euler discretization fails for KL divergence.
method Forward-Euler discretization for Wasserstein gradient flows with KL divergence.
result Forward-Euler discretization can be incorrect for Wasserstein gradient flows with KL divergence.

Multi-stage financial decision optimization under uncertainty depends on a careful numerical approximation of the underlying stochastic process, which describes the future returns of the selected assets or asset categories. Various approaches towards an optimal generation of discrete-time, discrete-state approximations…

2009-12-08abs ↗pdf ↗

Paper explores how Rectified Flow adapts to low-dimensional data.

problem Improving sampling efficiency in low-dimensional data.
method Investigates Rectified Flow's adaptation to low-dimensional support and introduces a stochastic version.
result Shows improved sampling efficiency with O(k/ε)O(k/\varepsilon) complexity.

New framework models time-uncertain point processes for better event prediction.

problem Uncertainty in event times in point processes.
method Formulated and discretized continuous-time Hawkes processes with time grid, enabling optimization methods for inference.
result Parameter recovery with O(1/k)O(1/k) convergence rate using gradient descent and VI.

Develops unbiased estimation method using underdamped Langevin dynamics.

problem Estimating expectations of non-negative Lebesgue density probability measures.
method Underdamped Langevin dynamics, time-discretized versions, doubly randomized estimation.
result Proves finite variance and expected/finite cost of the proposed estimator.

Continuous-time algorithms improve online learning performance.

problem Online learning with sequential data and minimizing overall regret.
method Extending discrete-time algorithms to continuous-time models for online linear optimization, adversarial bandit, and adversarial linear bandit.
result Optimal regret bounds are proven for continuous-time settings.

Monte Carlo simulations of diffusion processes often introduce bias in the final result, due to time discretization. Using an auxiliary Poisson process, it is possible to run simulations which are unbiased. In this article, we propose such a Monte Carlo scheme which converges to the exact value. We manage to keep the s…

2016-05-06abs ↗pdf ↗

In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we propose a multi-level l…

2013-03-06abs ↗pdf ↗

Market makers optimize trading with a new implicit scheme for complex inequalities.

problem Optimizing trading in a limit order book with stochastic and impulse control.
method Implicit numerical scheme coupled with policy iteration algorithm.
result Convergence to the unique viscosity solution of the HJBQVI.

PAGP uses physics-assisted Gaussian processes to solve and learn PDEs.

problem Solving and discovering unknown coefficients in PDEs with initial and boundary conditions.
method Physics-assisted Gaussian processes with continuous, discrete, and hybrid models.
result Effective in solving and discovering unknown coefficients in PDEs.

In this paper we investigate the effectiveness of Alternating Direction Implicit (ADI) time discretization schemes in the numerical solution of the three-dimensional Heston-Hull-White partial differential equation, which is semidiscretized by applying finite difference schemes on nonuniform spatial grids. We consider t…

2011-11-17abs ↗pdf ↗

SGLD proves geometric ergodicity via reflection coupling for nonconvex log-concave distributions.

problem Proving geometric ergodicity of SGLD in nonconvex, log-concave settings.
method Reflection coupling technique to handle SGLD's time discretization and minibatch issues.
result SGLD has an invariant distribution and geometric ergodicity in W1W_1 distance.

Paper develops a continuous-time framework for financial markets without stochastic calculus.

problem Developing continuous-time financial models without stochastic calculus.
method A general framework using conditional topologies and pseudo-distance topologies.
result No-arbitrage conditions hold in continuous time if and only if they hold in discrete time.

Improved sampling method using regularized Stein Variational Gradient Flow.

problem Improving the accuracy of sampling methods in machine learning.
method Proposed Regularized Stein Variational Gradient Flow to interpolate between SVGD and Wasserstein Gradient Flow.
result Established theoretical properties and provided preliminary numerical evidence of improved performance.

TriTPP models enable faster and more flexible event data modeling.

problem Inflexibility and slow sampling in traditional TPP models.
method Triangular Maps and Normalizing Flows for parallel sampling and likelihood computation.
result TriTPP models achieve orders of magnitude faster sampling while maintaining flexibility.