Effortless, Simulation-Efficient Bayesian Inference using Tabular Foundation Models

• URL: http://arxiv.org/abs/2504.17660v1
• Date: Thu, 24 Apr 2025 15:29:39 GMT
• Title: Effortless, Simulation-Efficient Bayesian Inference using Tabular Foundation Models
• Authors: Julius Vetter, Manuel Gloeckler, Daniel Gedon, Jakob H. Macke,
• Abstract summary: We show how TabPFN can be used as pre-trained autoregressive conditional density estimators for simulation-based inference.<n>NPE-PF eliminates the need for inference network selection, training, and hyper parameter tuning.<n>It exhibits superior robustness to model misspecification and can be scaled to simulation budgets that exceed the context size limit of TabPFN.
• Score: 5.952993835541411
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulation-based inference (SBI) offers a flexible and general approach to performing Bayesian inference: In SBI, a neural network is trained on synthetic data simulated from a model and used to rapidly infer posterior distributions for observed data. A key goal for SBI is to achieve accurate inference with as few simulations as possible, especially for expensive simulators. In this work, we address this challenge by repurposing recent probabilistic foundation models for tabular data: We show how tabular foundation models -- specifically TabPFN -- can be used as pre-trained autoregressive conditional density estimators for SBI. We propose Neural Posterior Estimation with Prior-data Fitted Networks (NPE-PF) and show that it is competitive with current SBI approaches in terms of accuracy for both benchmark tasks and two complex scientific inverse problems. Crucially, it often substantially outperforms them in terms of simulation efficiency, sometimes requiring orders of magnitude fewer simulations. NPE-PF eliminates the need for inference network selection, training, and hyperparameter tuning. We also show that it exhibits superior robustness to model misspecification and can be scaled to simulation budgets that exceed the context size limit of TabPFN. NPE-PF provides a new direction for SBI, where training-free, general-purpose inference models offer efficient, easy-to-use, and flexible solutions for a wide range of stochastic inverse problems.

Related papers

• Robust Simulation-Based Inference under Missing Data via Neural Processes [6.32765579505162]
  We formalize the problem of missing data in SBI and demonstrate that naive imputation methods can introduce bias in the estimation of SBI posterior.<n>We also introduce a novel amortized method that addresses this issue by jointly learning the imputation model and the inference network within a neural posterior estimation framework.
  arXiv  Detail & Related papers  (2025-03-03T08:22:01Z)
• Meta-Statistical Learning: Supervised Learning of Statistical Inference [59.463430294611626]
  This work demonstrates that the tools and principles driving the success of large language models (LLMs) can be repurposed to tackle distribution-level tasks. We propose meta-statistical learning, a framework inspired by multi-instance learning that reformulates statistical inference tasks as supervised learning problems.
  arXiv  Detail & Related papers  (2025-02-17T18:04:39Z)
• sbi reloaded: a toolkit for simulation-based inference workflows [15.696312591547283]
  $texttsbi$ is a PyTorch-based package that implements Bayesian SBI algorithms based on neural networks. The $texttsbi$ toolkit enables scientists and engineers to apply state-of-the-art SBI methods to black-box simulators.
  arXiv  Detail & Related papers  (2024-11-26T11:31:47Z)
• Preconditioned Neural Posterior Estimation for Likelihood-free Inference [5.651060979874024]
  We show in this paper that the neural posterior estimator (NPE) methods are not guaranteed to be highly accurate, even on problems with low dimension. We propose preconditioned NPE and its sequential version (PSNPE), which uses a short run of ABC to effectively eliminate regions of parameter space that produce large discrepancy between simulations and data. We present comprehensive empirical evidence that this melding of neural and statistical SBI methods improves performance over a range of examples.
  arXiv  Detail & Related papers  (2024-04-21T07:05:38Z)
• Diffusion posterior sampling for simulation-based inference in tall data settings [53.17563688225137]
  Simulation-based inference ( SBI) is capable of approximating the posterior distribution that relates input parameters to a given observation. In this work, we consider a tall data extension in which multiple observations are available to better infer the parameters of the model. We compare our method to recently proposed competing approaches on various numerical experiments and demonstrate its superiority in terms of numerical stability and computational cost.
  arXiv  Detail & Related papers  (2024-04-11T09:23:36Z)
• Generalized Bayesian Inference for Scientific Simulators via Amortized Cost Estimation [11.375835331641548]
  We train a neural network to approximate the cost function, which we define as the expected distance between simulations produced by a parameter and observed data. We show that, on several benchmark tasks, ACE accurately predicts cost and provides predictive simulations that are closer to synthetic observations than other SBI methods.
  arXiv  Detail & Related papers  (2023-05-24T14:45:03Z)
• Validation Diagnostics for SBI algorithms based on Normalizing Flows [55.41644538483948]
  This work proposes easy to interpret validation diagnostics for multi-dimensional conditional (posterior) density estimators based on NF. It also offers theoretical guarantees based on results of local consistency. This work should help the design of better specified models or drive the development of novel SBI-algorithms.
  arXiv  Detail & Related papers  (2022-11-17T15:48:06Z)
• Neural Posterior Estimation with Differentiable Simulators [58.720142291102135]
  We present a new method to perform Neural Posterior Estimation (NPE) with a differentiable simulator. We demonstrate how gradient information helps constrain the shape of the posterior and improves sample-efficiency.
  arXiv  Detail & Related papers  (2022-07-12T16:08:04Z)
• HyperImpute: Generalized Iterative Imputation with Automatic Model Selection [77.86861638371926]
  We propose a generalized iterative imputation framework for adaptively and automatically configuring column-wise models. We provide a concrete implementation with out-of-the-box learners, simulators, and interfaces.
  arXiv  Detail & Related papers  (2022-06-15T19:10:35Z)
• SBI -- A toolkit for simulation-based inference [0.0]
  Simulation-based inference ( SBI) seeks to identify parameter sets that a) are compatible with prior knowledge and b) match empirical observations. We present $textttsbi$, a PyTorch-based package that implements SBI algorithms based on neural networks.
  arXiv  Detail & Related papers  (2020-07-17T16:53:51Z)
• Belief Propagation Reloaded: Learning BP-Layers for Labeling Problems [83.98774574197613]
  We take one of the simplest inference methods, a truncated max-product Belief propagation, and add what is necessary to make it a proper component of a deep learning model. This BP-Layer can be used as the final or an intermediate block in convolutional neural networks (CNNs) The model is applicable to a range of dense prediction problems, is well-trainable and provides parameter-efficient and robust solutions in stereo, optical flow and semantic segmentation.
  arXiv  Detail & Related papers  (2020-03-13T13:11:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.