REVIEW 5 cited by
Elements of Sequential Monte Carlo
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
A core problem in statistics and probabilistic machine learning is to compute probability distributions and expectations. This is the fundamental problem of Bayesian statistics and machine learning, which frames all inference as expectations with respect to the posterior distribution. The key challenge is to approximate these intractable expectations. In this tutorial, we review sequential Monte Carlo (SMC), a random-sampling-based class of methods for approximate inference. First, we explain the basics of SMC, discuss practical issues, and review theoretical results. We then examine two of the main user design choices: the proposal distributions and the so called intermediate target distributions. We review recent results on how variational inference and amortization can be used to learn efficient proposals and target distributions. Next, we discuss the SMC estimate of the normalizing constant, how this can be used for pseudo-marginal inference and inference evaluation. Throughout the tutorial we illustrate the use of SMC on various models commonly used in machine learning, such as stochastic recurrent neural networks, probabilistic graphical models, and probabilistic programs.
Forward citations
Cited by 5 Pith papers
-
Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
MDA couples an LLM structure proposer with SMC-based Bayesian inference and value-of-information experiment design to identify mechanistic world models with fewer interventions than pure LLM agents.
-
Dynamic or Systematic? Bayesian model selection between dark energy and supernova biases
Bayesian evidence prefers a low-redshift supernova magnitude offset over dynamical dark energy when DES-5Y is combined with DESI BAO, but only under the assumption that Lambda CDM is correct.
-
Preference Optimization via Contrastive Divergence: Your Reward Model is Secretly an NLL Estimator
Sampling dispreferred completions proportionally to the current reward model, as in contrastive divergence, improves preference-optimization performance and is framed as NLL estimation.
-
The Radius of PSR J0437-4715 from NICER Data
Modeling NICER data with an added modulated nonthermal component yields a PSR J0437−4715 radius of 11.8–15.1 km and shows that omitting this component biases radius estimates.
-
Particle Gibbs without the Gibbs bit
m-PGibbs, a marginalized particle Gibbs algorithm, replaces the Gibbs parameter update with a conditional sequential Monte Carlo step and shows more robust mixing than PMMH for small particle numbers.
Discussion (0). Continue with ORCID to comment.