REVIEW 4 cited by
posteriordb: Testing, Benchmarking and Developing Bayesian Inference Algorithms
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
posteriordb: Testing, Benchmarking and Developing Bayesian Inference Algorithms
read the original abstract
The generality and robustness of inference algorithms is critical to the success of widely used probabilistic programming languages such as Stan, PyMC, Pyro, and Turing.jl. When designing a new general-purpose inference algorithm, whether it involves Monte Carlo sampling or variational approximation, the fundamental problem arises in evaluating its accuracy and efficiency across a range of representative target models. To solve this problem, we propose posteriordb, a database of models and data sets defining target densities along with reference Monte Carlo draws. We further provide a guide to the best practices in using posteriordb for model evaluation and comparison. To provide a wide range of realistic target densities, posteriordb currently comprises 120 representative models and has been instrumental in developing several general inference algorithms.
Forward citations
Cited by 4 Pith papers
-
Divide, Interact, Sample: The Two-System Paradigm
A two-system paradigm unifies disparate Monte Carlo approaches by having two particle subsystems interact symmetrically, yielding new overdamped and underdamped Langevin samplers that show higher ESS per gradient and ...
-
AI4BayesCode: From Natural Language Descriptions to Validated Modular Stateful Bayesian Samplers
AI4BayesCode generates validated modular stateful MCMC samplers from natural language Bayesian model descriptions via LLM translation, modular blocks, and recursive stateful composition.
-
AI4BayesCode: From Natural Language Descriptions to Validated Modular Stateful Bayesian Samplers
A new LLM-based system generates and validates runnable modular MCMC samplers directly from natural-language Bayesian model descriptions, reporting success on 120 of 132 benchmark models.
-
RefineStat: Efficient Exploration for Probabilistic Program Synthesis
RefineStat improves small language model performance on probabilistic program synthesis by adding semantic constraint enforcement and diagnostic-aware refinement, producing syntactically and statistically reliable cod...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.