q-fin.CPNov 12, 2026

TAPES: Terminal Adjoint-Propagated Error Scheduling for Financial Diffusion Samplers

Authors: Yilie Huang

Organizations: Department of Applied Mathematics The Hong Kong Polytechnic University Kowloon, Hong Kong

Abstract

Financial diffusion samplers are often reused with a small number of function evaluations (NFE) inside scenario and risk pipelines, where numerical time-grid error can distort terminal quantities such as covariances, tails, and drawdown proxies. We study offline grid construction for a frozen probability-flow ODE: the score network, conditioning, Euler solver, report normalization, and deployment NFE remain fixed. TAPES (Terminal Adjoint-Propagated Error Scheduling) estimates signed local defects by Richardson comparisons, transports them through the remaining discrete flow and a terminal-report adjoint, and optimizes the squared norm of their sum before a capped direct refinement. We show that this transported signed sum is the first-order terminal-report error and quantify, under an aligned-defect model, the inefficiency of diagonal criteria. Across six budgets on a regime-switching simulation and chronologically held-out Mag7 contexts, TAPES gives the lowest design- and audit-report errors in all 24 dataset--budget--report rows within the reported five-pipeline panel. Cross-budget mean relative audit-error reductions are about 10--11% on Regime-SV and about 1% on Mag7, with Bonferroni intervals excluding zero; all displayed winners persist under a doubled-resolution reference, and a small Regime-SV Heun probe preserves the TAPES-first audit ordering. TAPES changes only the offline schedule and retains the prescribed deployment NFE; claims concern numerical fidelity to frozen generators.

Figures & tables

Explore similar work

Sep 18, 2026

Schedule optimization for tau-leaping in masked discrete diffusion

Masked diffusions are popular generative models for discrete distributions. Unlike standard autoregressive sampling, they reveal several coordinates in parallel, approximating each block's joint conditional law by a product of one-coordinate conditionals. The resulting procedure, usually called tau-leaping, reduces computational cost but introduces a factorization error (εfact\varepsilon_\text{fact}), even with perfectly learned predictors. We study the resulting tradeoff between generative accuracy and computational cost, focusing on how to choose a denoising schedule to minimize εfact\varepsilon_\text{fact} for a fixed sampling budget. To do so, we establish an exact integral representation of εfact\varepsilon_\text{fact} separating the schedule from the target's dependence structure, summarized by a dependence density ρρ. This representation yields recursive stationarity equations for optimal schedules and allows us to quantify how estimation errors in ρρ affect schedule selection. As the dimension NN and sampling budget grow, we characterize the optimal schedule and quantify the cost of random block sizes relative to a deterministic planner. We highlight a fundamental dichotomy: if ρρ converges uniformly to a strictly positive continuous profile as N→∞N\to\infty, schedule optimization can only improve the leading constant of εfact\varepsilon_\text{fact}, while if ρρ degenerates, schedule optimization can improve the asymptotic order. Examples based on stationary processes and exchangeable mixtures illustrate these regimes.
Oct 21, 2026

Density-Level Backward Error for Low-NFE Generative Flows

Low-NFE generative ODE sampling is constrained not only by solver order, but also by how a fixed budget of network evaluations is distributed along the flow. We develop a density-level backward-error framework that identifies the component of a solver's modified-equation defect that changes the evolving marginal, while excluding solenoidal trajectory distortion that is invisible in Wasserstein tangent geometry. The resulting residual induces a solver-order-aware compute-allocation rule and, through gauge freedom, an objective for selecting numerically favorable velocity representatives of the same density path. This separates our approach from schedule search driven by trajectory or endpoint surrogates and from higher-order solver design. Exact Gaussian and mixture models establish the mechanism, including cases where curvature-based allocation fails and continuum-optimal transport is not discretization-optimal. On a pretrained CIFAR-10 EDM probability-flow ODE, density-aware allocation consistently improves fixed-update Euler sampling in the low-NFE regime. Matched-seed convergence to a dense Euler reference confirms that the method accelerates approximation of the same high-NFE flow rather than changing the asymptotic sampler.
Jul 5, 2026

Asymptotic Preservation and Uniform Accuracy of Diffusion and Flow-Matching Samplers

Diffusion and Gaussian-interpolant flow-matching samplers approach data through a terminal noise floor ε\varepsilon, a singular limit for manifold-supported or rank-deficient data. We study two properties of a complete sampler specification, comprising its update rule, time grid, and terminal rule. Asymptotic preservation (AP) means a stable and consistent zero-noise discretization with a step count bounded independently of ε\varepsilon. Uniform accuracy (UA) of order pp means that, at numerical resolution hh, the endpoint W2W_2 error is O(hp)O(h^p) with a floor-independent constant. Bounded log-noise stepping fails AP because its step count diverges. Stopping a stable base solver at a positive switching scale aa and appending one map fitted to the analytic normal mode restores AP. On smooth compact boundaryless manifolds, the standard map has exact-input error O(a2−ε2)O(a^2-\varepsilon^2) and sharp zero-floor error Θ(a2)Θ(a^2). A base solver with a floor-uniform order-pp estimate on the resolved interval retains that order when a=O(hp/2)a=O(h^{p/2}), provided the terminal transfer factor remains bounded. Along exact trajectories, the posterior-mean identity D(x(σ),σ)=x(σ)−σx′(σ)D(x(σ),σ)=x(σ)-σx'(σ) cancels the linear terminal defect and enables higher-order fitted maps. A three-evaluation Hermite construction is uniformly third order for exact switching-scale input over 0≤ε≤a0\le\varepsilon\le a, and a seven-evaluation construction is fourth order at zero. We classify representative diffusion and flow-matching specifications by AP and UA. On EDM and Rectified Flow checkpoints, a paired decomposition separates base-integration from terminal-completion error and predicts held-out same-seed endpoint errors.