CORTEXA
← Browse
arxivcs.LGmath.NA2026-07-05

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

Shiheng Zhang

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 $p$ means that, at numerical resolution $h$, the endpoint $W_2$ error is $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 $a$ 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(a^2-\varepsilon^2)$ and sharp zero-floor error $Θ(a^2)$. A base solver with a floor-uniform order-$p$ estimate on the resolved interval retains that order when $a=O(h^{p/2})$, provided the terminal transfer factor remains bounded. Along exact trajectories, the posterior-mean identity $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\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.

View free PDFSource page

Related papers

arxivstat.MLcs.LGmath.NAstat.CO2026-07-24

Convergence analysis of a family of Zermelo-type iterations for the Bradley--Terry model

Ruijian Han, Ding Lu, Yiming Xu

Zermelo's algorithm is a classical method for computing the maximum likelihood estimator in the Bradley--Terry (BT) model, but its convergence can be slow in practice. To accelerate computation, Newman introduced a family of Zermelo-type fixed-point iterations parameterized by $α…

View free PDFSource page
arxivcs.LGeess.SPmath.NA2026-07-24

Remedying Coarsening-Based GNN Training under Heterophily via Adaptive Complementary Enhancement

Guoming Li, Jian Yang, Xukun Wang, Zixiao Wang, Shangsong Liang, Yifan Chen

Coarsening-based training for graph neural networks (GNNs), i.e.\ training on coarsened graphs rather than the original large ones, has become a promising direction for scaling GNNs to massive graphs. However, prior work has been evaluated almost exclusively on \textit{homophilic…

View free PDFSource page
arxivstat.MLcs.LGmath.NAmath.ST2026-07-31

Simple-regret rates and minimax optimality of fixed-prior expected improvement in Matérn and squared-exponential RKHSs

Emmanuel Vazquez, Sébastien Petit

We study the expected improvement (EI) policy for minimizing a deterministic objective function $f$ on a nonempty compact set $\mathcal X \subset\mathbb R^d$. We assume that $f$ belongs to the RKHS $\mathcal H_k$ of a continuous positive-semidefinite kernel $k$ on $\mathcal X$. F…

View free PDFSource page
arxivcs.LGmath.NA2026-07-31

Freeze, Then Select: Structured Field Adapters and Stability-Validated Weak Selection for PDE Discovery from Sparse Observations

Juncheng Zhong, Chenghuang Shen, Jianfeng Liu, Zhengdong Xiao, Longjiu Luo, Qianrong Wang, et al.

PDE discovery from sparse observations requires reconstructing a continuous field and selecting the correct differential terms. Our analysis of optimization paths in coupled neural PDE discovery reveals three behaviors: the exact support can persist to the end of training, appear…

View free PDFSource page
arxivcs.LGmath.NA2026-07-22

PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs

Amirhossein Sadr, Nima Soltani, Vahideh Moghtadaiee, Aida Pakniyat, Dara Rahmati, Saeid Gorgin

Physics-informed learning of partial differential equations (PDEs) has been dominated by multilayer perceptrons (MLPs), whose spectral bias and dense parameterization limit both accuracy and interpretability. Kolmogorov Arnold Networks (KANs) mitigate these limitations because th…

View free PDFSource page