AI & ML
Sparse Probabilistic Richardson Extrapolation
arXiv stat.CO0 views
arXiv:2604.02072v2 Announce Type: replace-cross Abstract: Almost every numerical task can be cast as extrapolation with respect to the fidelity or tolerance parameters of a consistent numerical method. This perspective enables probabilistic uncertainty quantification and optimal experimental design functionality to be deployed, and also unlocks the potential for the convergence of numerical methods to be accelerated. Recent work established Probabilistic Richardson Extrapolation as a proof-of-concept, demonstrating how parallel multi-fidelity simulation can be used to accelerate simulation from a whole-heart model. However, the number of simulations was required to increase super-exponentially in $d$, the number of tolerance parameters appearing in the numerical method. This paper develops a refined notion of 'extrapolation dimension', drastically reducing this simulation requirement when multiple tolerance parameters feature in the numerical method. Sparsity-exploiting methodology is developed that is simultaneously simpler and more powerful compared to earlier work, and this is accompanied by sharp theoretical guarantees and substantial empirical support.
Source:https://arxiv.org/abs/2604.02072PreviousDynamic Bayesian Predictive Stacking via Markovian Spatiotemporal PropagationNextHypergraph Generation via Structured Stochastic Diffusion
Related posts
Hypergraph Generation via Structured Stochastic Diffusion
0arXiv stat.CO
Dynamic Bayesian Predictive Stacking via Markovian Spatiotemporal Propagation
0arXiv stat.CO
Coherent forecast combination for linearly constrained multiple time series
0arXiv stat.CO
New optimisations for exact, scalable 2D Gaussian process inference, with applications to astronomical time-series
0arXiv stat.CO
A tractable transition function for the Wright-Fisher diffusion with selection via gamma duality
0arXiv stat.CO
A Generalized Bayesian Approach to Clustering with Dimension Reduction
0arXiv stat.CO