Modern Bayesian experimental design

T Rainforth, A Foster, DR Ivanova… - Statistical …, 2024 - projecteuclid.org
Bayesian experimental design (BED) provides a powerful and general framework for
optimizing the design of experiments. However, its deployment often poses substantial …

On Markov chain Monte Carlo methods for tall data

R Bardenet, A Doucet, C Holmes - Journal of Machine Learning Research, 2017 - jmlr.org
Markov chain Monte Carlo methods are often deemed too computationally intensive to be of
any practical use for big data applications, and in particular for inference on datasets …

Residual flows for invertible generative modeling

RTQ Chen, J Behrmann… - Advances in Neural …, 2019 - proceedings.neurips.cc
Flow-based generative models parameterize probability distributions through an invertible
transformation and can be trained by maximum likelihood. Invertible residual networks …

Heisenberg-limited ground-state energy estimation for early fault-tolerant quantum computers

L Lin, Y Tong - PRX Quantum, 2022 - APS
Under suitable assumptions, the quantum-phase-estimation (QPE) algorithm is able to
achieve Heisenberg-limited precision scaling in estimating the ground-state energy …

Optimal experimental design: Formulations and computations

X Huan, J Jagalur, Y Marzouk - Acta Numerica, 2024 - cambridge.org
Questions of 'how best to acquire data'are essential to modelling and prediction in the
natural and social sciences, engineering applications, and beyond. Optimal experimental …

Multilevel monte carlo methods

MB Giles - Acta numerica, 2015 - cambridge.org
Monte Carlo methods are a very general and useful approach for the estimation of
expectations arising from stochastic simulation. However, they can be computationally …

Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey

J Zhang - Wiley Interdisciplinary Reviews: Computational …, 2021 - Wiley Online Library
Uncertainty quantification (UQ) includes the characterization, integration, and propagation of
uncertainties that result from stochastic variations and a lack of knowledge or data in the …

Accelerating MCMC algorithms

CP Robert, V Elvira, N Tawn… - Wiley Interdisciplinary …, 2018 - Wiley Online Library
Markov chain Monte Carlo algorithms are used to simulate from complex statistical
distributions by way of a local exploration of these distributions. This local feature avoids …

Convergent policy optimization for safe reinforcement learning

M Yu, Z Yang, M Kolar, Z Wang - Advances in Neural …, 2019 - proceedings.neurips.cc
We study the safe reinforcement learning problem with nonlinear function approximation,
where policy optimization is formulated as a constrained optimization problem with both the …

Relaxing bijectivity constraints with continuously indexed normalising flows

R Cornish, A Caterini… - … on machine learning, 2020 - proceedings.mlr.press
We show that normalising flows become pathological when used to model targets whose
supports have complicated topologies. In this scenario, we prove that a flow must become …