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.
Neural Ordinary Differential Equation (Neural ODE) has been proposed as a continuous approximation to the ResNet architecture. Some commonly used regularization mechanisms in discrete neural networks (e.g. dropout, Gaussian noise) are missing in current Neural ODE networks. In this paper, we propose a new continuous ne…
Stochastic regularization of neural networks (e.g. dropout) is a wide-spread technique in deep learning that allows for better generalization. Despite its success, continuous-time models, such as neural ordinary differential equation (ODE), usually rely on a completely deterministic feed-forward operation. This work pr…
This work provides a semi-analytic approximation method for decoupled forwardbackward SDEs (FBSDEs) with jumps. In particular, we construct an asymptotic expansion method for FBSDEs driven by the random Poisson measures with σ-finite compensators as well as the standard Brownian motions around the small-variance limit …
In this paper we derive a scaling limit for an infinite dimensional limit order book model driven by Hawkes random measures. The dynamics of the incoming order flow is allowed to depend on the current market price as well as on a volume indicator. With our choice of scaling the dynamics converges to a coupled SDE-ODE s…
A new asymptotic expansion scheme for backward SDEs (BSDEs) is proposed.The perturbation parameter is introduced just to scale the forward stochastic variables within a BSDE. In contrast to the standard small-diffusion asymptotic expansion method, the dynamics of variables given by the forward SDEs is treated exactly. …
There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al. introduced a sampling-based class of methods that are 'well-calibrated' in a specific sense. But the computational c…
GLASS Flows improves flow and diffusion model performance by optimizing sampling efficiency.
problem Efficiency bottleneck in sampling Markov transitions for flow and diffusion models.
method Introduces GLASS Flows, a new sampling paradigm that simulates a 'flow matching model within a flow matching model' to sample Markov transitions efficiently.
result Eliminates the trade-off between stochastic evolution and efficiency in large-scale text-to-image models.
CT-OT Flow estimates continuous-time dynamics from discrete snapshots.
problem Estimating continuous-time dynamics from temporally aggregated snapshots with noisy or uncertain timestamps.
method Two-stage framework: aligning neighboring intervals via partial optimal transport (POT) and reconstructing a continuous-time distribution through temporal kernel smoothing.
result Reduces distributional and trajectory errors compared with existing methods across synthetic and real datasets.
Neural Ordinary Differential Equations (N-ODEs) are a powerful building block for learning systems, which extend residual networks to a continuous-time dynamical system. We propose a Bayesian version of N-ODEs that enables well-calibrated quantification of prediction uncertainty, while maintaining the expressive power …
A novel score-based method solves high-dimensional Fokker-Planck equations with improved accuracy and speed.
problem High-dimensional Fokker-Planck equations suffer from the curse of dimensionality, leading to numerical errors and slow sampling.
method Score-based Physics-Informed Neural Networks (PINNs) that fit the score function in SDEs, using three methods: Score Matching, Sliced Score Matching, and Score-PINN.
result The score-based method outperforms traditional Monte Carlo and vanilla PINNs in high-dimensional settings, offering faster sampling and reduced errors.
We introduce the geodesic walk for sampling Riemannian manifolds and apply it to the problem of generating uniform random points from polytopes in R^n specified by m inequalities. The walk is a discrete-time simulation of a stochastic differential equation (SDE) on the Riemannian manifold equipped with the metric induc…
Reflected Diffusion Models improve on score-based models by incorporating data constraints.
problem Numerical error in score-based models leads to unnatural samples.
method Reverses a reflected stochastic differential equation on data support, learning perturbed score function through generalized score matching loss.
result Improves sample quality and fidelity without architectural modifications.
The one-dimensional SDE with non Lipschitz diffusion coefficient dXt=b(Xt)dt+σXtγdBt,X0=x,γ<1 is widely studied in mathematical finance. Several works have proposed asymptotic analysis of densities and implied volatilities in models involving instances of this equation, based on a careful i…