Pith. sign in

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

arxiv 2407.04967 v1 pith:DWAY2UTE submitted 2024-07-06 stat.CO

classification stat.CO
keywords inferenceposteriordbalgorithmsmodelstargetcarlodensitiesdeveloping
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Is Retrieval All You Need? Assessment and Emergence of Novelty in Protein Structure Generation

    q-bio.BM 2026-08 conditional novelty 7.0 of 10

    Full-chain structural novelty is not evidence of fold invention, because generated backbones mostly contain known domains and a zero-training retrieval baseline reproduces the same novelty profile.

  2. Diffeomorphic Markov Chain Monte Carlo: fast mixing for heavy-tailed distributions

    stat.CO 2026-08 conditional novelty 7.0 of 10

    DCS pulls heavy-tailed targets back to a Euclidean ball and proves uniform ergodicity for any polynomial tail, with O(d^3) Hit-and-Run mixing for Student-t targets.

  3. MCBench: A Benchmark Suite for Monte Carlo Sampling Algorithms

    stat.CO 2025-01 conditional novelty 6.0 of 10

    MCBench is a modular Julia benchmark suite that scores Monte Carlo samplers by comparing their samples against IID reference samples using metrics like sliced Wasserstein distance and maximum mean discrepancy.

  4. Disentangling impact of capacity, objective, batchsize, estimators, and step-size on flow VI

    cs.LG 2024-12 conditional novelty 6.0 of 10

    A careful ablation shows normalizing-flow variational inference with large capacity and large batchsize matches turnkey HMC, so complex objectives and estimators are unnecessary.

Pith tools