arXiv Statistics ML
Deep adaptive design with an evidential bias criterion
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Jul 10
Bayesian Experimental Design via Score Matching
arXiv:2607. 08335v1 Announce Type: cross Abstract: Policy-based approaches to Bayesian experimental design (BED) allow the learning of deep policy networks that adaptively make intelligent design decisions based on previously collected data.
arXiv Machine Learning
Oct 19
Robust Experimental Design via Generalised Bayesian Inference
The paper introduces Generalised Bayesian Optimal Experimental Design (GBOED), extending generalised Bayesian inference to experimental design. It replaces the likelihood in Bayesian updates with a loss function, deriving a new acquisition function called Gibbs expected information gain. Empirical results show that GBOED improves robustness against outliers and mis-specified outcome noise distributions.
arXiv Machine Learning
Aug 14
Optimizing Likelihoods via Mutual Information: Bridging Simulation-Based Inference and Bayesian Optimal Experimental Design
arXiv:2502. 08004v2 Announce Type: replace-cross Abstract: Simulation-based inference (SBI) is a method to perform inference on a variety of complex scientific models with challenging inference (inverse) problems.
arXiv AI
Jul 7
JADAI: Jointly Amortizing Adaptive Design and Bayesian Inference
arXiv:2512. 22999v2 Announce Type: replace-cross Abstract: We consider problems of parameter estimation where design variables can be actively optimized to maximize information gain.
arXiv Machine Learning
Jul 21
Deep Adaptive Bayesian Screening
arXiv:2607. 16927v1 Announce Type: cross Abstract: We introduce Deep Adaptive Bayesian Screening (DABS), a method for performing adaptive factorial screening in high-dimensional discrete design spaces.
arXiv Statistics ML
Sep 11
Learning-Based Surrogate Method for Stochastic Optimization under Decision-Dependent Uncertainty with Adaptive Random Designs
The paper introduces a learning-based surrogate approach for stochastic optimization problems where uncertainty depends on the decision, modeled via a nonparametric regression. It constructs a surrogate that embeds iteratively updated Jacobian estimates, using an adaptive random design that focuses sampling near the current iterate to achieve dimension‑independent convergence of the Jacobian estimates. The resulting learning‑based stochastic prox‑linear (L‑SPL) algorithm demonstrates nonasymptotic convergence rates and outperforms existing methods in sample efficiency and objective value in numerical experiments.