Skip to main content
Search

# Simulation-Based Inference

10 related articles

Subscribe to updates
  1. arXiv

    Bacterial genome hotspots no longer rest on a few summary statistics: neural posterior estimation separates recombination from mutation rates and assigns hotspot probabilities

    Recombination and mutation rates vary along bacterial genomes, the two signals overlap, and clonal relationships confound inference, while earlier methods often assumed a constant mutation rate or relied on a small set of summary statistics. This work trains a simulator-based neural posterior estimator conditioned on a fixed clonal genealogy to infer local recombination and mutation rates for each gene segment, then applies a circular posterior-propagated Difference-of-Gaussians detector that carries posterior uncertainty into hotspot calls. On simulated data the inferred rates track the true values and credible intervals narrow as gene length grows; candidate hotspots are reported for three real datasets in the Bacillus cereus group, Staphylococcus aureus and Escherichia coli.

  2. arXiv

    EMRI frequency tracks skip waveform generation: harmonic pairs identified 98% of the time among physical candidates, parameter volume cut by up to four more orders

    Extreme mass ratio inspirals (EMRIs) have long, multi-harmonic waveforms that make search and parameter estimation expensive. This work trains simulation-based inference networks directly on frequency tracks from a time-frequency search: harmonic pairs are identified correctly in 98% of cases among physically plausible candidates, and sequential inference shrinks the intrinsic-parameter prior volume, with a detection-statistic refinement cutting up to four further orders of magnitude so heavily masked tracks approach the precision of the least-masked cases.

  3. arXiv

    Chemical reaction networks stop refitting per dataset: one training run, then model choice and rate constants in seconds

    A single amortized neural architecture now handles reaction-pathway discrimination and rate-constant estimation together, so new experimental data needs only a forward pass to yield posterior model probabilities and parameter posteriors.

  4. arXiv

    One photo pins only one direction: a shared transport-map likelihood cuts hundreds of forward solves per posterior in hierarchical inversion

    In hierarchical Bayesian inversion, putting the forward model inside the likelihood means every posterior evaluation costs one forward solve per cell. A triangular transport-map likelihood trained once per design now serves every cell, and is used to infer contact angle and capillary length from photographs of a hole in a thin liquid film. At a synthetic validation design the map's posteriors agree with direct sampling in the wetting properties and pass simulation-based calibration; a single posterior needs several hundred times fewer forward-model evaluations than a gradient-free ensemble sampler, and further posteriors at the same design add no forward solve.

  5. arXiv

    DES Year 3 shear data get their first integrated three-point cosmology, and adding it to two-point statistics roughly doubles the figure of merit

    Weak-lensing shear data from the third year of the Dark Energy Survey (DES Y3) have been analysed cosmologically with the integrated three-point correlation function (i3PCF), a higher-order statistic that correlates local aperture mass with surrounding shear, and for the first time a three-point shear statistic on survey data is treated with fully simulation-based inference. Jointly with the two-point correlation functions, the i3PCF is detected at a signal-to-noise ratio of 12.8, and the figure of merit in the Ωm–S8–w space roughly doubles over two-point statistics alone, with the gain coming from angular scales where baryonic effects are subdominant.

  6. arXiv

    Phylogenetic posteriors get an iterative generative model: it matches IQ-Tree on simple data and beats it on complex evolution

    Posterior inference over phylogenetic trees has depended on likelihoods, which become intractable once real processes such as insertions, deletions or site selection are modeled. This family of conditional generative models builds a tree step by step, bottom-up, middle-out or top-down, and is trained with a discrete diffusion objective; on real and synthetic data it recovers MCMC posteriors more closely than the prior simulation-based method Phyloformer 2, matches IQ-Tree on simple data, and is reliably more accurate on more realistic complex models.

  7. bioRxiv

    Fox skips tree building for host-symbiont coevolution: reading paired alignments directly, it runs over three orders of magnitude faster than an ABC baseline

    Estimating the frequencies of host-symbiont coevolution events used to require reconstructing a host tree and then reconciling the symbiont tree against it, so tree-inference error propagated into the result. Fox instead uses a transformer to output the relative frequencies of cospeciation, host switching, loss and duplication directly from the host and symbiont multiple sequence alignments and their mapping, paying the simulation cost once at training time and processing each new system in a single forward pass. On the independent simulator treeducken, Fox reached a mean absolute error of 0.060 on the 92 datasets AmoCoala completed, against 0.131 for AmoCoala, while running more than three orders of magnitude faster.

  8. arXiv

    Simulators run but likelihoods do not: an anytime-valid confidence sequence for parameters, with neural scores near exact ratios

    For models that can be simulated but whose likelihood cannot be evaluated, SLICE treats fresh simulations under each candidate parameter as references, normalizes the observed score into a conditional e-value, and multiplies these factors into a test martingale that is inverted into an anytime-valid confidence sequence. Validity holds for any positive predictable score, while the score only sets how fast the sequence shrinks; on synthetic benchmarks, a semi-synthetic audit of model routing in an LLM API, and OGLE-IV microlensing data, amortized neural ratio scores come close to exact likelihood ratios and application-specific scores.

  9. arXiv

    Simulation-based inference stops training only the posterior net: summary statistics take the lead, and training size grows only polynomially in observation dimension

    A simulation-based inference framework jointly learns a low-dimensional summary statistic and an amortized posterior estimator with non-asymptotic guarantees: in exponential-family and smooth-model settings, the training size needed for a target accuracy grows only polynomially with observation dimension, not exponentially as in classical nonparametric conditional distribution estimation.

  10. arXiv

    Expectations under a product of densities now need no density: one regression merges component samples, error 0.0001 on HIGGS

    Expectations under a product of densities become a regression on a consensus and a discrepancy: using only Monte Carlo draws from each component and no density evaluations, the method estimates arbitrary expectations. On 11 million simulated HIGGS collision events, PMC-MLP reaches an estimation error of 0.0001 with 0.1092 minutes of merge time, about 10% of full-data MCMC runtime; in a privacy-restricted respiratory clinical trial, every PMC variant merges more cheaply than GBF.

You’re all caught up