Methods › General › Approximate Inference › ABC

Approximate Bayesian Computation

ABC

131 papers tagged archive 2025-07-28

Introduced by Sourabh Kulkarni et al. in Accelerating Simulation-based Inference with Emerging AI Hardware

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Class of methods in Bayesian Statistics where the posterior distribution is approximated over a rejection scheme on simulations because the likelihood function is intractable.

Different parameters get sampled and simulated. Then a distance function is calculated to measure the quality of the simulation compared to data from real observations. Only simulations that fall below a certain threshold get accepted.

Image source: Kulkarni et al.

Paper

Source in the archive: Accelerating Simulation-based Inference with Emerging AI Hardware, a link on www.umass.edu (archive link, not checked and not linked: not a paper host this site links to).

In Syntology repository known, no verified implementation (declared_code; repositories: 2 listed of 2 in the graph, strongest link: official). The lookup matched a different name in Syntology's graph, 'Attribution by Customization (AbC)' (resolution: alias); this answer is about that name. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2306.09345) is about this method is not checked.

From the lookup's note on this name: The same name also belongs to the paper “ABC: A Big CAD Model Dataset For Geometric Deep Learning” (arXiv:1812.06216, 699 citations), which the lookup finds cited far more than the paper this answer is about (58 citations), so this answer may be about a different sense of the name. For arXiv:1812.06216: its page on this site · ask the lookup about it.

Origin paper of this answer, arXiv:2306.09345 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 131 · with a code link: 46 · where Syntology ran a sample: 11 (9 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (11 of 131 tagged: 9 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)

Page 1 of 2: papers 1 to 100 of 131, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 126 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Bayesian Inference8
Music Generation6
Language Modeling5
Language Modelling5
Classification4
Contrastive Learning4
Diversity4
Large Language Model4
Model Selection4
Retrieval4
Surface Reconstruction4
CAD Reconstruction3
Data Augmentation3
Decision Making3
Density Estimation3
GPU3
Information Retrieval3
Management3
Music Information Retrieval3
Point cloud reconstruction3

Usage over time archive 2025-07-28

Papers per year tagged with ABC: 2018 to 2025, peak 33 33 0 2018: 1 paper 2018 2019: 0 papers 2019 2020: 4 papers 2020 2021: 33 papers 2021 2022: 17 papers 2022 2023: 28 papers 2023 2024: 31 papers 2024 2025: 17 papers 2025
Papers per year the archive tags with this method, by the paper's archive date (131 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Approximate Inference

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections