A high-order recombination algorithm with adaptive scale selection for weak approximation of stochastic differential equations
math.PR, q-fin.CP
Submitted: 2026-11-11
Updated: 2026-11-11
Terminology
Sources
- SOBER: Highly Parallel Bayesian Optimization and Bayesian Quadrature over Discrete and Mixed Spaces
- A Quadrature Approach for General-Purpose Batch Bayesian Optimization via Probabilistic Lifting
- Carath'eodory Sampling for Stochastic Gradient Descent
- Markov Chain Approximations to Stochastic Differential Equations by Recombination on Lattice Trees
- ARCANE: Scalable high-degree cubature formulae for simulating SDEs without Monte Carlo error
- Greedy Recombination Interpolation Method (GRIM)
- Higher Order Lipschitz Greedy Recombination Interpolation Method (HOLGRIM)
- Efficient Neural SDE Training using Wiener-Space Cubature
- Preconditioning via Diagonal Scaling
Related papers
- Rank-One HCIZ Integrals and Multiplicative Convolutions
- Repeated averaging on random d-regular graphs
- Precise cover times for branching random walks on Hamming graphs: (iterated) logarithmic corrections
- Markov Chain CLTs: Resolving Open Problems
- Marked stable L'evy processes in Brownian local time
- A Sharp Refinement of Samuels' Inequality via Cap Moves