Recursive Nested Filtering for Efficient Amortized Bayesian Experimental Design

Sahel Iqbal, Hany Abdulsamad, Sara Pérez-Vieites, Simo Särkkä, Adrien Corenflos
9/9/2024
stat.MLcs.LGstat.ME

No confident code implementation found for this paper.

Abstract

This paper introduces the Inside-Out Nested Particle Filter (IO-NPF), a novel, fully recursive, algorithm for amortized sequential Bayesian experimental design in the non-exchangeable setting. We frame policy optimization as maximum likelihood estimation in a non-Markovian state-space model, achieving (at most) $\mathcal{O}(T^2)$ computational complexity in the number of experiments. We provide theoretical convergence guarantees and introduce a backward sampling algorithm to reduce trajectory degeneracy. IO-NPF offers a practical, extensible, and provably consistent approach to sequential Bayesian experimental design, demonstrating improved efficiency over existing methods.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{iqbal2024recursive,
  title  = {Recursive Nested Filtering for Efficient Amortized Bayesian Experimental Design},
  author = {Sahel Iqbal and Hany Abdulsamad and Sara Pérez-Vieites and Simo Särkkä and Adrien Corenflos},
  year   = {2024},
  eprint = {2409.05354},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2409.05354v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2409.05354.svg)](https://codeofpaper.com/paper/2409.05354)

Discussion