Structured filtering
From MaRDI portal
Abstract: A major challenge facing existing sequential Monte-Carlo methods for parameter estimation in physics stems from the inability of existing approaches to robustly deal with experiments that have different mechanisms that yield the results with equivalent probability. We address this problem here by proposing a form of particle filtering that clusters the particles that comprise the sequential Monte-Carlo approximation to the posterior before applying a resampler. Through a new graphical approach to thinking about such models, we are able to devise an artificial-intelligence based strategy that automatically learns the shape and number of the clusters in the support of the posterior. We demonstrate the power of our approach by applying it to randomized gap estimation and a form of low circuit-depth phase estimation where existing methods from the physics literature either exhibit much worse performance or even fail completely.
Recommendations
Cites work
- Estimating the dimension of a model
- High posterior density ellipsoids of quantum states
- How to best sample a periodic probability distribution, or on the accuracy of Hamiltonian finding strategies
- scientific article; zbMATH DE number 1666084 (Why is no real title available?)
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 5919872 (Why is no real title available?)
- scientific article; zbMATH DE number 3738710 (Why is no real title available?)
- scientific article; zbMATH DE number 2061729 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 3276287 (Why is no real title available?)
- On the Bernstein-von Mises theorem with infinite-dimensional parameters
- Optimal, reliable estimation of quantum states
- Quantum model averaging
- Robust online Hamiltonian learning
- Scikit-learn: machine learning in Python
- Sequential Monte Carlo Samplers
- The Planar k-Means Problem is NP-Hard
Cited in
(3)
This page was built for publication: Structured filtering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172384)