Source Distribution Estimation by Posterior Averaging

• URL: http://arxiv.org/abs/2609.02622v1
• Date: Wed, 02 Sep 2026 14:01:54 GMT
• Title: Source Distribution Estimation by Posterior Averaging
• Abstract summary: Simulation-based science often requires a distribution over simulator parameters whose push-forward reproduces a set of real observations.<n>Existing methods fit the source against a likelihood surrogate trained once from a fixed proposal prior.<n>We propose an E-step trains an amortized posterior on fresh simulations from the current source estimate, and an M-step refits the source to the average of that posterior over the observed data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Simulation-based science often requires a distribution over simulator parameters whose push-forward reproduces a set of real observations: this is the source distribution estimation (SDE) problem. Existing methods fit the source against a likelihood surrogate trained once from a fixed proposal prior. Their objective is therefore stated only in terms of the surrogate instead of the true simulator, which may fail for inaccurate areas in parameter space where the surrogate was never trained. We instead solve SDE by expectation maximization: an E-step trains an amortized posterior on fresh simulations from the current source estimate, and an M-step refits the source to the average of that posterior over the observed data. We give two parameterizations, (1) separate source and posterior flows and (2) a single shared conditional flow. We evaluate our method on three benchmark tasks under both broad and misspecified initial priors. Both improve on existing fixed surrogate approaches and on iterated variants of each, most clearly on Lotka--Volterra, where no baseline falls below 0.96 data-space C2ST while our methods reach 0.64-0.68 in three of four initial-prior settings.

Related papers

• No Free Lunch in Flow Surrogates under Time-Varying Boundary Conditions: A Two-Regime Study [0.48127184936824546]
  Flow surrogate validated on a simple regime is often taken as evidence that the approach will carry to a richer one.<n>We test this assumption on two transient flows under time-varying boundary conditions emulating the process startup.
  arXiv  Detail & Related papers  (2026-07-26T14:02:46Z)
• What Do Flow-Based Inverse Solvers Approximate? A Posterior-Transport View [31.082191748525137]
  We give a posterior-transport flow-based problem solving account.<n>We show that trajectory-guidance solvers can be read as the minimum-energy emphcorrection field needed to morph the unconditional source into the posterior.
  arXiv  Detail & Related papers  (2026-06-23T12:50:11Z)
• Proximal-IMH: Proximal Posterior Proposals for Independent Metropolis-Hastings with Approximate Operators [4.887201041798969]
  We introduce Proximal-IMH, a scheme that corrects samples from the approximate posterior through an auxiliary optimization problem.<n>For idealized settings, we prove that the proximal correction tightens the match between approximate and exact posteriors, thereby improving acceptance rates and mixing.<n>The method applies to both linear and nonlinear input-output operators and is particularly suitable for inverse problems where exact posterior sampling is too expensive.
  arXiv  Detail & Related papers  (2026-02-24T22:58:50Z)
• Bayesian Surrogate Training on Multiple Data Sources: A Hybrid Modeling Strategy [3.2926386146887796]
  We propose two novel approaches to integrate simulation data and real-world measurement data during surrogate training.<n>The first method trains separate surrogate models for each data source and combines their predictive distributions, while the second incorporates both data sources by training a single surrogate.
  arXiv  Detail & Related papers  (2024-12-16T15:27:28Z)
• Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transport [84.51977664336056]
  We propose a novel scalable approach for estimating the robust continuous barycenter.<n>Our method is framed as a min-max optimization problem and is adaptable to general cost functions.
  arXiv  Detail & Related papers  (2024-10-04T23:27:33Z)
• Sourcerer: Sample-based Maximum Entropy Source Distribution Estimation [5.673617376471343]
  We propose an approach which targets the maximum entropy distribution, i.e., prioritizes retaining as much uncertainty as possible.<n>Our method is purely sample-based - leveraging the Sliced-Wasserstein distance to measure the discrepancy between the dataset and simulations.<n>To demonstrate the utility of our approach, we infer source distributions for parameters of the Hodgkin-Huxley model from experimental datasets with thousands of single-neuron measurements.
  arXiv  Detail & Related papers  (2024-02-12T17:13:02Z)
• Calibrating Neural Simulation-Based Inference with Differentiable Coverage Probability [50.44439018155837]
  We propose to include a calibration term directly into the training objective of the neural model. By introducing a relaxation of the classical formulation of calibration error we enable end-to-end backpropagation. It is directly applicable to existing computational pipelines allowing reliable black-box posterior inference.
  arXiv  Detail & Related papers  (2023-10-20T10:20:45Z)
• DF2: Distribution-Free Decision-Focused Learning [30.288876294435294]
  Decision-focused learning (DFL) has emerged as a powerful approach for predict-then-optimize problems.<n>DFL faces three bottlenecks: model error, sample average approximation error, and approximation error.<n>We present DF2, the first decision-free learning method designed to mitigate these three bottlenecks.
  arXiv  Detail & Related papers  (2023-08-11T00:44:46Z)
• Uncertainty-guided Source-free Domain Adaptation [77.3844160723014]
  Source-free domain adaptation (SFDA) aims to adapt a classifier to an unlabelled target data set by only using a pre-trained source model. We propose quantifying the uncertainty in the source model predictions and utilizing it to guide the target adaptation.
  arXiv  Detail & Related papers  (2022-08-16T08:03:30Z)
• Source-Free Domain Adaptation via Distribution Estimation [106.48277721860036]
  Domain Adaptation aims to transfer the knowledge learned from a labeled source domain to an unlabeled target domain whose data distributions are different. Recently, Source-Free Domain Adaptation (SFDA) has drawn much attention, which tries to tackle domain adaptation problem without using source data. In this work, we propose a novel framework called SFDA-DE to address SFDA task via source Distribution Estimation.
  arXiv  Detail & Related papers  (2022-04-24T12:22:19Z)
• Leveraging Unlabeled Data to Predict Out-of-Distribution Performance [63.740181251997306]
  Real-world machine learning deployments are characterized by mismatches between the source (training) and target (test) distributions. In this work, we investigate methods for predicting the target domain accuracy using only labeled source data and unlabeled target data. We propose Average Thresholded Confidence (ATC), a practical method that learns a threshold on the model's confidence, predicting accuracy as the fraction of unlabeled examples.
  arXiv  Detail & Related papers  (2022-01-11T23:01:12Z)
• Batch Stationary Distribution Estimation [98.18201132095066]
  We consider the problem of approximating the stationary distribution of an ergodic Markov chain given a set of sampled transitions. We propose a consistent estimator that is based on recovering a correction ratio function over the given data.
  arXiv  Detail & Related papers  (2020-03-02T09:10:01Z)

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.