no code implementations • 5 Mar 2023 • Tiangang Cui, Sergey Dolgov, Olivier Zahm
We approximate the complicated target density by a composition of self-reinforced KR rearrangements, in which previously constructed KR rearrangements -- based on the same approximation ansatz -- are used to precondition the density approximation problem for building each new KR rearrangement.
no code implementations • 16 Feb 2023 • Kirandeep Kour, Sergey Dolgov, Peter Benner, Martin Stoll, Max Pfeffer
High-dimensional data in the form of tensors are challenging for kernel classification methods.
no code implementations • 5 Sep 2022 • Tiangang Cui, Sergey Dolgov, Robert Scheichl
We approximate the optimal importance distribution in a general importance sampling problem as the pushforward of a reference distribution under a composition of order-preserving transformations, in which each transformation is formed by a squared tensor-train decomposition.
1 code implementation • 8 Jun 2021 • Tiangang Cui, Sergey Dolgov, Olivier Zahm
We present a novel offline-online method to mitigate the computational burden of the characterization of posterior random variables in statistical learning.
no code implementations • 14 Jul 2020 • Tiangang Cui, Sergey Dolgov
The recent surge of transport maps offers a mathematical foundation and new insights for tackling this challenge by coupling intractable random variables with tractable reference random variables.
1 code implementation • 12 Feb 2020 • Kirandeep Kour, Sergey Dolgov, Martin Stoll, Peter Benner
An increasing amount of collected data are high-dimensional multi-way arrays (tensors), and it is crucial for efficient learning algorithms to exploit this tensorial structure as much as possible.
1 code implementation • 5 Aug 2019 • Sergey Dolgov, Dante Kalise, Karl Kunisch
For nonlinear dynamics, the effectiveness of the high-dimensional control synthesis method is assessed in the optimal feedback stabilization of the Allen-Cahn and Fokker-Planck equations with a hundred of variables.
Optimization and Control Numerical Analysis Numerical Analysis
1 code implementation • 21 Apr 2019 • Sergey Dolgov, Alexander Litvinenko, Dishi Liu
Combination of low-tensor rank techniques and the Fast Fourier transform (FFT) based methods had turned out to be prominent in accelerating various statistical operations such as Kriging, computing conditional covariance, geostatistical optimal design, and others.
Computation Numerical Analysis Methodology
1 code implementation • 27 Mar 2019 • Sergey Dolgov, Dmitry Savostyanov
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.
Numerical Analysis 15A69, 15A23, 65D05, 65F99
1 code implementation • 2 Oct 2018 • Sergey Dolgov, Karim Anaya-Izquierdo, Colin Fox, Robert Scheichl
We find that the importance-weight corrected quasi-Monte Carlo quadrature performs best in all computed examples, and is orders-of-magnitude more efficient than DRAM across a wide range of approximation accuracies and sample sizes.
Numerical Analysis Probability Statistics Theory Statistics Theory 65D15, 65D32, 65C05, 65C40, 65C60, 62F15, 15A69, 15A23