TL;DR
This paper introduces a parallel cross interpolation algorithm for high-dimensional integrals, demonstrating superior convergence and scalability over traditional Monte Carlo methods, with applications in quantum physics and statistical models.
Contribution
The paper presents a novel parallel cross interpolation method that adaptively samples functions for high-dimensional integration, outperforming Monte Carlo approaches in convergence and efficiency.
Findings
Strong superlinear convergence observed
Exponential convergence with multiple precision arithmetic
High scalability up to hundreds of processes
Abstract
We propose a parallel version of the cross interpolation algorithm and apply it to calculate high-dimensional integrals motivated by Ising model in quantum physics. In contrast to mainstream approaches, such as Monte Carlo and quasi Monte Carlo, the samples calculated by our algorithm are neither random nor form a regular lattice. Instead we calculate the given function along individual dimensions (modes) and use this data to reconstruct its behaviour in the whole domain. The positions of the calculated univariate fibers are chosen adaptively for the given function. The required evaluations can be executed in parallel both along each mode (variable) and over all modes. To demonstrate the efficiency of the proposed method, we apply it to compute high-dimensional Ising susceptibility integrals, arising from asymptotic expansions for the spontaneous magnetisation in two-dimensional Ising…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
