Consistency of Learned Sparse Grid Quadrature Rules using NeuralODEs
Not on the map. Why?
Abstract (arXiv)
We prove consistency of a recently proposed scheme that evaluates expected values by composing a learned transport map with Clenshaw--Curtis sparse-grid quadrature on a tractable product source. Our analysis hinges on the structural fact that composition of a Ckmix-regular function -- which carries the fast quadrature rate m-k(log m)(d-1)(k+1) -- with a C1-diffeomorphism can only be guaranteed to be Ckmix itself, if the diffeomorphism is diagonal up to a permutation of coordinates. The fast rate is therefore available exclusively for product targets, and the analysis splits into two regimes. In the general regime of arbitrary targets, we learn the transport as the time-one flow of a ReLUk+1-neural ODE trained by maximum likelihood. The resulting flow lies in the isotropic space Ck and yields the rate m-k/d(log m)(d-1)(k/d+1), with raising the density smoothness k and the matched activation order k+1 mitigating the curse of dimensionality at the cost of harder optimization. In the diagonal regime of product targets, the Knothe--Rosenblatt map is itself diagonal and we estimate it pointwise via empirical quantile transport, a lightweight alternative that recovers the full mixed-regularity rate. In both regimes, the resulting LtI estimator is PAC (probably approximately correct) consistent. With high probability the numerical integral approximates the true value to arbitrary accuracy as both the sample size n and the quadrature budget m tend to infinity.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 53 references that are in the map. First posted on arXiv 2 Jul 2025.
Builds on
14 of 53 references.
References · 14
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2015Variational Inference with Normalizing Flowscited by 2,161
- 2016Density estimation using Real NVPcited by 2,029
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2018Adaptivity of deep ReLU network for learning in Besov and mixed smooth Besov spaces: optimal rate and curse of dimensionalitycited by 160
- 2022Simultaneous approximation of a smooth function and its derivatives by deep neural networks with piecewise-polynomial activationscited by 29
- 2023Distribution learning via neural differential equations: a nonparametric statistical perspectivecited by 22
- 2020A Convenient Infinite Dimensional Framework for Generative Adversarial Learningcited by 11
- 2023LU-Net: Invertible Neural Networks Based on Matrix Factorizationcited by 8
- 2024New advances in universal approximation with neural networks of minimal widthcited by 4
- 2025Distribution learning via neural differential equations: minimal energy regularization and approximation theorycited by 3
Built on by
Not cited yet.