mlsanityData to 14 Oct 2026

Statistically Efficient Bayesian Sequential Experiment Design via Reinforcement Learning with Cross-Entropy Estimators

arXiv 2305.18435 ↗First posted 29 May 2023cs.LG stat.MEcited by 6

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning can learn amortised design policies for designing sequences of experiments. However, current amortised methods rely on estimators of expected information gain (EIG) that require an exponential number of samples on the magnitude of the EIG to achieve an unbiased estimation. We propose the use of an alternative estimator based on the cross-entropy of the joint model distribution and a flexible proposal distribution. This proposal distribution approximates the true posterior of the model parameters given the experimental history and the design policy. Our method overcomes the exponential-sample complexity of previous approaches and provide more accurate estimates of high EIG values. More importantly, it allows learning of superior design policies, and is compatible with continuous and discrete design spaces, non-differentiable likelihoods and even implicit probabilistic models.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 27 of its 50 references that are in the map. First posted on arXiv 29 May 2023.

Builds on

27 of 50 references.

References · 27

  1. 2015Continuous control with deep reinforcement learningcited by 3,407
  2. 2016Density estimation using Real NVPcited by 2,042
  3. 2017Deep Bayesian Active Learning with Image Datacited by 819
  4. 2019On Variational Bounds of Mutual Informationcited by 559
  5. 2019The frontier of simulation-based inferencecited by 502
  6. 2018Pyro: Deep Universal Probabilistic Programmingcited by 380
  7. 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 288
  8. 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
  9. 2018Deep Reinforcement Learning and the Deadly Triadcited by 174
  10. 2019Learning Likelihoods with Conditional Normalizing Flowscited by 172
  11. 2023Modern Bayesian Experimental Designcited by 125
  12. 2019Variational Bayesian Optimal Experimental Designcited by 116
15 more
  1. 2019Conditioning by adaptive sampling for robust designcited by 111
  2. 2021Deep Adaptive Design: Amortizing Sequential Bayesian Experimental Designcited by 106
  3. 2018Model-Based Active Explorationcited by 105
  4. 2017On Nesting Monte Carlo Estimatorscited by 83
  5. 2013Hidden Parameter Markov Decision Processes: A Semiparametric Regression Approach for Discovering Latent Task Parametrizationscited by 70
  6. 2021Implicit Deep Adaptive Design: Policy-Based Experimental Design without Likelihoodscited by 61
  7. 2019A Unified Stochastic Gradient Approach to Designing Bayesian-Optimal Experimentscited by 58
  8. 2020Bayesian Experimental Design for Implicit Models by Mutual Information Neural Estimationcited by 56
  9. 2023normflows: A PyTorch Package for Normalizing Flowscited by 56
  10. 2019ABCD-Strategy: Budgeted Experimental Design for Targeted Causal Structure Discoverycited by 52
  11. 2022Optimizing Sequential Experimental Design with Deep Reinforcement Learningcited by 46
  12. 2019BINOCULARS for Efficient, Nonmyopic Sequential Experimental Designcited by 35
  13. 2019Why Non-myopic Bayesian Optimization is Promising and How Far Should We Look-ahead? A Study via Rolloutcited by 23
  14. 2021Simpler, Faster, Stronger: Breaking The log-K Curse On Contrastive Learners With FlatNCEcited by 22
  15. 2022Flow-based Recurrent Belief State Learning for POMDPscited by 16

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 3; 2026: 3.

6 papers.