COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Low-rank tensor approximation for sampling high dimensional distributions
Low-rank tensor approximation for sampling high dimensional distributionsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. UNQW04 - UQ for inverse problems in complex systems High-dimensional distributions are notoriously difficult to sample from, particularly in the context of PDE -constrained inverse problems. In this talk, we will present general purpose samplers based on low-rank tensor surrogates in the tensor-train (TT) format, a methodology that has been exploited already for many years for scalable, high-dimensional function approximations in quantum chemistry. In the Bayesian context, the TT surrogate is built in a two stage process. First we build a surrogate of the entire PDE solution in the TT format, using a novel combination of alternating least squares and the TT cross algorithm. It exploits and preserves the block diagonal structure of the discretised operator in stochastic collocation schemes, requiring only independent PDE solutions at a few parameter values, thus allowing the use of existing high performance PDE solvers. In a second stage, we approximate the high-dimensional posterior density function also in TT format. Due to the particular structure of the TT surrogate, we can build an efficient conditional distribution method (or Rosenblatt transform) that only requires a sampling algorithm for one-dimensional conditionals. This conditional distribution method can also be used for other high-dimensional distributions, not necessarily coming from a PDE -constrained inverse problem. The overall computational cost and storage requirements of the sampler grow linearly with the dimension. For sufficiently smooth distributions, the ranks required for accurate TT approximations are moderate, leading to significant computational gains. We compare our new sampling method with established methods, such as the delayed rejection adaptive Metropolis (DRAM) algorithm, as well as with multilevel quasi-Monte Carlo ratio estimators. This is joint work with Sergey Dolgov (Bath), Colin Fox (Otago) and Karim Anaya-Izquierdo (Bath). This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsjohn's list Innovation Forum CIMR Professional Development Series by the postdoc committeOther talksGenomics and Evolutionary Genetics Club Childhood adversity and chronic disease: risks, mechanisms and resilience Questions of Morality in Global Health- An interdisciplinary conference Public Lecture: Development of social behaviour in children from infancy: neurobiological, relational and situational interactions Easter 2018 SynBio Forum: Chris Voigt and Somenath Bakshi Making a Crowdsourced Task Attractive: Measuring Workers Pre-task Interactions |