Bayesian Experimental Design via Score Matching

Angus Phillips; Gavin Kerrigan; Tom Rainforth

REVIEW 2 major objections 4 minor 228 references

Bayesian Experimental Design via Score Matching

T0 review · 2 major / 4 minor · reviewed 2026-07-10 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Score matching isolates EIG double intractability so policy training becomes singly intractable and reusable.

desk verdict Clean isolation of EIG double intractability into policy-independent score matching; additive NLE cost is real and the math holds. read the letter →

arxiv 2607.08335 v1 pith:4ZA2KO6P submitted 2026-07-09 stat.ML cs.LG

Angus Phillips , Gavin Kerrigan , Tom Rainforth This is my paper · ORCID

classification stat.MLcs.LG

keywords Bayesianexperimentaldesignexpectedinformationgainscorematchingpolicynetworksamortisedinferencereparameterisationmarginallikelihood

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Policy-based Bayesian experimental design trains networks that choose the next experiment from past data, but the expected information gain is doubly intractable, so every gradient step usually needs nested sampling or a co-trained variational model. That multiplies cost by the number of policies one wants to try and leaves little budget for restarts or architecture search. This paper shows the information gain itself depends only on the realised designs and data, not on the policy parameters. The double intractability therefore lives in two policy-independent scores of the marginal likelihood. Those scores can be learned once by ordinary regression (marginal score matching) and then plugged into a reparameterised gradient that is only singly intractable. The expensive step becomes additive rather than multiplicative, so many competitive policies can be trained under a fixed likelihood budget and the best one selected.

What carries the argument

Theorem 1 (reparameterised EIG gradient) isolates the intractable terms as the Stein score ∂/∂y log p(y|ξ) and Fisher score ∂/∂ξ log p(y|ξ); marginal score matching then regresses a shared network onto the conditional likelihood scores, recovering both targets without sampling the posterior.

What would settle it

Train the score network once, then train many policies under a matched likelihood budget; if the best-of-P ScoreBED policies systematically underperform best-of-P nested or co-trained baselines on the same tasks, or if measured EIG-gradient bias fails to fall with score error, the claim fails.

Watch

Extended reading notes

Core claim

The double intractability of the expected information gain can be separated from policy optimisation: first solve a single policy-independent score-matching problem for the Stein and Fisher scores of the marginal likelihood, then substitute the learned scores into a reparameterised EIG gradient that is only singly intractable. This converts the usual multiplicative likelihood cost into an additive cost and makes multi-policy training cheap.

Load-bearing premise

A score network trained only on samples from a hand-chosen design distribution must stay accurate on the trajectories later visited by trained policies, otherwise gradient bias ruins policy optimisation.

Editorial extensions

If this is right

Under a fixed likelihood budget one can train many policy restarts or architectures and simply keep the best, without re-paying the double-intractability cost.
Gradient bias, not variance, becomes the dominant error once outer-sample size is moderate; score-network capacity and training budget therefore control final policy quality.
The same two-stage pattern applies to any variational approximation of the marginal or posterior that is independent of the policy.
Static-design special cases drop the Fisher-score term, lowering bias and variance even without score matching.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Because the score targets live in design and observation space rather than parameter space, the method should scale more gracefully than nested posterior sampling when the latent dimension grows.
If the design sampler q(ξ) can be adapted online to the current policy support without destroying amortisation, the coverage assumption becomes far weaker.
The same score network could be reused across related models that share the same observation and design spaces, amortising design cost over a family of experiments.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The useful move here is simple: the information gain depends on the designs, not on how the policy chose them. They write the reparameterised EIG gradient (Theorem 1) so the only nested terms are the Stein and Fisher scores of the marginal p(y|ξ), train one score network on a policy-free MSM regression against the known conditional score, then plug it into a singly intractable policy gradient. Multiplicative nested cost becomes additive. That is new relative to PCE nesting and to co-trained variational bounds, and it is the right place to put the amortisation.

Math is solid. The static-design simplification is clean; the Lipschitz bound (Theorem 3) correctly ties score MSE to gradient error; Appendix C’s bias-variance split explains the plateaus they plot. Code is released. Experiments fix total likelihood evaluations, report both PCE lower and NMC upper bounds, and show that under the same budget they can train several competitive policies while baselines must thin their per-policy effort. On the high-dimensional location task SCOREBED is clearly best; on the dynamical systems it is competitive once they select among score seeds.

Soft spots are practical, not foundational. The score network is only as good as the design sampler q(ξ). Isotropic Gaussians collapse performance; they need scale hyperpriors or low-rank trajectories. On the non-Markovian dynamical systems the reparameterisation Jacobian becomes ill-conditioned under the trained policy, score MSE correlates with condition number, and early seeds produce unstable policies—hence the three-seed split. Absolute gains on the easier tasks are modest. None of this breaks the isolation argument when support is adequate; it just means the free parameters (sampler, architecture, budget split) still matter.

This is for people who actually train adaptive BED policies and care about likelihood budgets. It deserves a serious referee. I would engage with it and expect to cite the gradient form and the two-stage cost argument.

Referee Report

2 major / 4 minor

Summary. The paper proposes SCOREBED, a two-stage method for policy-based Bayesian experimental design. It first trains a policy-independent score network via marginal score matching (MSM, Eq. 6) to approximate the Stein and Fisher scores of the marginal p(y|ξ). These scores are then substituted into a reparameterised EIG gradient (Theorem 1 / Eq. 3), yielding a singly intractable estimator for policy SGD. The claim is that this isolates double intractability from policy learning, converting the usual multiplicative nested-sampling NLE cost into an additive cost and thereby enabling cheap multi-policy training (architecture search, restarts) under a fixed likelihood budget. Experiments on source location finding, three dynamical systems, and gravimetry compare against PCE, pre-trained and joint variational bounds, and IO-SMC2 under matched NLE budgets, reporting both lower and upper EIG bounds for P=1 and multi-restart protocols.

Significance. If the isolation argument holds in practice, SCOREBED is a useful engineering contribution for policy-based BED: amortising the hard nested terms once, then reusing them for many policy trainings, is a natural and previously under-exploited separation. Theorem 1 cleanly isolates the intractable scores; the static-design simplification and the Lipschitz error bound (Theorem 3 / Appendix B) are sound; the bias–variance analysis (Appendix C) explains the observed gradient plateaus. Code release, fixed-NLE protocols, and dual EIG bounds strengthen the empirical case. The main practical value is the ability to train multiple competitive policies without repeating the expensive nested work—an advantage that is real under the paper’s own budget accounting and that existing nested or co-trained methods do not share.

major comments (2)

[§3 / App. E.3] §3, Appendix D.4.1 and E.3: the central practical claim—that a single policy-independent score network yields usable gradients for later policies—rests on the support of the hand-chosen design sampler q(ξ). Table 14 shows that an isotropic Gaussian sampler collapses EIG to ~2.86 while scale-aware or low-rank samplers recover ~11. The paper documents the failure mode but does not give a systematic way to choose or validate q(ξ) for a new problem; without that, the additive-cost advantage is conditional on a non-trivial modelling choice that is currently problem-specific.
[§5.2 / App. E.5] §5.2 and Appendix E.5 (Figs. 5–7): on the dynamical systems the score-network stage is unstable (multiple seeds required; Jacobian condition numbers of trained policies correlate with score MSE). The multi-seed P=3/50 protocol mitigates this, but it means part of the “policy” budget is still spent on score restarts. The paper should quantify how much of the claimed additive saving survives when score training itself needs restarts, and whether the Lipschitz constant L in Theorem 3 becomes large enough on non-Markovian trajectories to make the error bound uninformative.

minor comments (4)

[§3] Clarify early that the “marginal” p(y|ξ) is not the policy-induced data distribution p(y;π_ϕ); the distinction is made in §3 but is easy to miss and is load-bearing for the policy-independence claim.
[Table 1] Table 1 / Fig. 1: for d=3,K=10, SCOREBED (P=1) slightly outperforms P=5; a short discussion of when extra restarts help versus when the score budget is still the bottleneck would help readers allocate NLE.
[App. A.2] Appendix A.2: the reparameterisation map g is deferred; a short explicit form for the common additive-noise case (already treated in A.3) would make the gradient expression easier to implement from the main text alone.
[§4] Related work: concurrent Huang et al. (2026a) is noted as complementary; a one-sentence comparison of what is amortised (belief representations vs. scores) would sharpen the positioning.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: EIG gradient isolation and MSM are derived from first principles; score regression targets known likelihood scores, not fitted EIG quantities.

full rationale

The load-bearing chain is: (i) IG depends on data/designs only, not on the policy that proposed them (Appendix A.1, design proposals cancel in the posterior); (ii) reparameterised differentiation of the mutual-information form of IT yields Theorem 1 / Eq. (3), isolating the Stein and Fisher scores of the design-conditional marginal p(y|ξ); (iii) the MSM objective (Eq. 6) is ordinary supervised regression of a network onto ∇_{y,ξ} log p(y|ξ,θ), which is available from the model likelihood, and whose unique minimiser is the true marginal score by the identity (Eq. 5); (iv) the learned scores are substituted into the gradient estimator, with ℓ2 gradient error bounded by Lipschitz constant times mean score error (Theorem 3 / Appendix B). None of these steps defines the target EIG or its gradient in terms of a fitted parameter, nor renames a fit as a prediction. Self-citations (Foster et al., Rainforth et al., Hyvärinen, Song et al.) supply background BED and score-matching tools; the central gradient expression and MSM construction are derived in-paper and validated against external baselines under fixed NLE budgets. Residual risks (support of q(ξ), Jacobian conditioning) are approximation/support assumptions, not circular reductions.

Assumptions & free parameters 3 free parameters · 4 assumptions · 1 invented entities

The central claim rests on standard measure-theoretic and reparameterisation assumptions of modern BED, plus the modelling restrictions needed for Stein/Fisher scores to exist, and on the practical claim that a score network trained under a fixed design distribution remains accurate on policy-induced trajectories. No new physical entities are postulated; free parameters are ordinary neural-network and sampling hyperparameters.

free parameters (3)

design sampling distribution q(ξ) (scale hyperpriors, temporal correlation, mixture weights)
Chosen by hand to cover regions expected under good policies; ablation shows isotropic Gaussian fails while random-scale or low-rank samplers succeed. Directly affects score accuracy on later policy trajectories.
score-network architecture and training budget (transformer depth, λ_y weighting, warmup-cosine schedule)
Capacity and loss weighting control residual score error, which bounds gradient bias via Theorem 3; budgets are adjusted to meet fixed NLE totals.
number of policy restarts P and allocation of NLE between score and policy stages
Determines how much of the claimed multi-policy advantage is realised; varied systematically but still a free experimental choice.

assumptions (4)

domain assumption Observations depend on the policy only through the realised designs (ignorability / Rubin 1976), so the posterior and the information gain are policy-independent given (y,ξ).
Stated and proved in Appendix A.1; required for the separation of intractabilities from the policy.
domain assumption Design and observation spaces are continuous and the data-generating process admits a differentiable reparameterisation, so Stein and Fisher scores exist and the reparameterised gradient (Eq. 3) is valid.
Explicitly listed under Applicability (§3); excludes discrete or non-reparameterisable models.
standard math The reparameterisation map ϕ ↦ (y,ξ) is almost-surely L-Lipschitz, allowing the ℓ₂ gradient error to be bounded by L times mean score error (Theorem 3).
Invoked via Rademacher’s theorem; needed for the formal guarantee that better scores yield better gradients.
domain assumption Explicit likelihood evaluations are available (or an implicit score-matching loss can be substituted).
Required for the MSM objective; SSM is mentioned as a fallback for implicit models.

invented entities (1)

Marginal score matching (MSM) objective and the SCOREBED two-stage procedure
purpose: Amortise the intractable marginal scores once, then reuse them for any number of policy trainings.
New algorithmic construct; independent evidence is the empirical multi-policy results and the gradient-bias analysis, not an external physical prediction.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Bayesian Experimental Design via Score Matching." pith.science (2026). https://pith.science/paper/4ZA2KO6P

@misc{pith2026260708335,
  author       = {Pith},
  title        = {Pith review of: Bayesian Experimental Design via Score Matching},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4ZA2KO6P}},
  note         = {Machine review of arXiv:2607.08335}
}

read the original 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. However, the training of such policies is often held back by a fundamental challenge: the double intractability of the expected information gain (EIG). This necessitates expensive or complex approximations that restrict the effort one can invest in optimising the policy itself. To address this, we show that the double intractability of the EIG can be isolated from the policy learning by first solving a score matching problem that is independent of the policy used, then using the learned score approximation to train the policy in a singly intractable manner. This turns the key multiplicative cost into an additive one and reduces the computational burden on the policy training itself, making it far cheaper to train the policy multiple times when needed, e.g. for architecture search, hyperparameter tuning, or avoiding local optima. In our experiments we train multiple competitive policies without inducing a multiplicative cost in likelihood evaluations, which can increase performance by allowing us to select the best policy even without performing hyperparameter or architecture searches.

Figures

Figures reproduced from arXiv: 2607.08335 by the authors.

**Figure 1.** Left: EIG vs NLE (P = 1) curves for each method on the d = 3, K = 10 location finding setting. Right: Comparing policy training curves for SCOREBED and PCE on the same problem. The exact NLE cost of each method is calculated in Appendix D.7 and the configurations of each baseline to respect the exact budget are detailed in Appendix D.8. In order to accommodate different numbers of policies P while respecting the s… view at source ↗

**Figure 3.** EIG lower bound versus EIG gradient squared-bias. [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗

**Figure 4.** Stability of SCOREBED with respect to score training. Each curve presents the final policy EIG under the P = 1 protocol against number of score training iterations. Left: d = 2, K = 2 location finding. Right: cart-pole. trajectories as low-rank projections of Gaussian noise, ξ = Φz, where Φ ∈ R T ×r is a time-basis matrix and z ∈ R r×d are Gaussian coefficients, zij ∼ N (0, s2 ) with an overall scale drawn randomly … view at source ↗

Figures from the paper (3 more)

**Figure 5.** Figure 5: Scatter plots showing correlation between EIG gradient bias and final policy performance, with points representing [PITH_FULL_IMAGE:figures/full_fig_p033_5.png]

**Figure 6.** Figure 6: Histograms showing the distribution of Jacobian condition number between the score training distribution and the [PITH_FULL_IMAGE:figures/full_fig_p033_6.png]

**Figure 7.** Figure 7: EIG gradient MSE curves for SCOREBED and PCE. PCE uses M = 19 and PCE∗ uses M = 199 inner samples on the location finding tasks, while PCE (P = 50) uses M = 7 and PCE (P = 1) uses M = 399 on the dynamical systems tasks. These values are chosen according to the fixed NL…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

228 extracted references · 228 canonical work pages

[1]

Proceedings of the 39th International Conference on Machine Learning , pages =

Transformer Neural Processes: Uncertainty-Aware Meta Learning Via Sequence Modeling , author =. Proceedings of the 39th International Conference on Machine Learning , pages =. 2022 , editor =

work page 2022
[2]

1972 , publisher=

Bayesian statistics: A review , author=. 1972 , publisher=

work page 1972
[3]

Telford, W. M. and Geldart, L. P. and Sheriff, R. E. , year=. Gravity Methods , booktitle=

work page
[4]

Proceedings of the 35th

Chen, Zhao and Badrinarayanan, Vijay and Lee, Chen-Yu and Rabinovich, Andrew , month = jul, year =. Proceedings of the 35th

work page
[5]

Vincent, Benjamin Thomas and Rainforth, Tom , month = oct, year =. The. doi:10.31234/osf.io/yehjb , abstract =

work page doi:10.31234/osf.io/yehjb
[6]

Durkan, Conor and Bekasov, Artur and Murray, Iain and Papamakarios, George , year =. Neural. Advances in

work page
[7]

Bradbury, James and Frostig, Roy and Hawkins, Peter and Johnson, Matthew and Leary, Chris and Maclaurin, Dougal and Necula, George and Paszke, Adam and VanderPlas, Jake and Wanderman-Milne, Skye and Zhang, Qiao , year =

work page
[8]

and Guan, Cong and Rainforth, Tom , month = oct, year =

Hedman, Marcel and Ivanova, Desi R. and Guan, Cong and Rainforth, Tom , month = oct, year =. Step-. Proceedings of the 42nd

work page

Show all 228 references

[9]

and Intes, Xavier and Bürkner, Paul-Christian and Radev, Stefan T

Bracher, Niels and Kühmichel, Lars and Ivanova, Desi R. and Intes, Xavier and Bürkner, Paul-Christian and Radev, Stefan T. , month = dec, year =. doi:10.48550/arXiv.2512.22999 , abstract =

doi arXiv
[10]

Sutton, Richard S and McAllester, David and Singh, Satinder and Mansour, Yishay , year =. Policy. Advances in
[11]

Information

Barber, David and Agakov, Felix , year =. Information. Advances in
[12]

International Journal for Uncertainty Quantification , author =

Gradient-based stochastic optimization methods in. International Journal for Uncertainty Quantification , author =. doi:10.1615/Int.J.UncertaintyQuantification.2014006730 , abstract =

doi
[15]

Bayesian

Iollo, Jacopo and Heinkelé, Christophe and Alliez, Pierre and Forbes, Florence , month = mar, year =. Bayesian. doi:10.48550/arXiv.2410.11826 , abstract =

doi arXiv
[17]

Statistics & Probability Letters , author =

Bayesian information in an experiment and the. Statistics & Probability Letters , author =. 2016 , pages =. doi:10.1016/j.spl.2016.01.014 , abstract =

2016 doi
[18]

Advances in Neural Information Processing Systems , volume=

ALINE: Joint amortization for Bayesian inference and active data acquisition , author=. Advances in Neural Information Processing Systems , volume=
[19]

Neural Computation , author =

Regularized. Neural Computation , author =. 2016 , pages =. doi:10.1162/NECO_a_00844 , abstract =

2016 doi
[20]

Sasaki, Hiroaki and Noh, Yung-Kyun and Sugiyama, Masashi , month = feb, year =. Direct. Proceedings of the
[21]

Understanding the

Song, Jiaming and Ermon, Stefano , month = sep, year =. Understanding the
[22]

, month = aug, year =

Snoek, Jasper and Larochelle, Hugo and Adams, Ryan P. , month = aug, year =. Practical. doi:10.48550/arXiv.1206.2944 , abstract =

doi arXiv
[23]

and Rainforth, Tom , month = oct, year =

Kerrigan, Gavin and Naesseth, Christian A. and Rainforth, Tom , month = oct, year =. A. doi:10.48550/arXiv.2510.14848 , abstract =

doi
[24]

Certified

Liu, Xingchao and Han, Xing and Zhang, Na and Liu, Qiang , month = dec, year =. Certified. doi:10.48550/arXiv.2011.10219 , abstract =

2011 doi arXiv
[25]

, month = may, year =

Runje, Davor and Shankaranarayana, Sharath M. , month = may, year =. Constrained. doi:10.48550/arXiv.2205.11775 , abstract =

doi arXiv
[26]

Learning

Cho, Kyunghyun and van Merriënboer, Bart and Gulcehre, Caglar and Bahdanau, Dzmitry and Bougares, Fethi and Schwenk, Holger and Bengio, Yoshua , editor =. Learning. Proceedings of the 2014. 2014 , pages =. doi:10.3115/v1/D14-1179 , urldate =

2014 doi
[27]

danielward27/flowjax: v17.1.2 , shorttitle =

Ward, Daniel and Hickling, Tennessee and Mould, Matthew and Seyboldt, Adrian and Turok, Gilad , month = may, year =. danielward27/flowjax: v17.1.2 , shorttitle =. doi:10.5281/zenodo.15357881 , abstract =

doi
[28]

Papamakarios, George and Pavlakou, Theo and Murray, Iain , year =. Masked. Advances in
[29]

Journal of Machine Learning Research , author =

Normalizing. Journal of Machine Learning Research , author =. 2021 , pages =

2021
[30]

and Fischer, Ian and Dillon, Joshua V

Alemi, Alexander A. and Fischer, Ian and Dillon, Joshua V. and Murphy, Kevin , month = feb, year =. Deep
[31]

Yu, Longlin and Zhang, Cheng , month = sep, year =. Semi-
[32]

Wen, Liangjian and Zhou, Yiji and He, Lirong and Zhou, Mingyuan and Xu, Zenglin , month = sep, year =. Mutual
[33]

What regularized auto-encoders learn from the data-generating distribution , volume =. J. Mach. Learn. Res. , author =. 2014 , pages =

2014
[34]

Sticking the

Roeder, Geoffrey and Wu, Yuhuai and Duvenaud, David K , year =. Sticking the. Advances in
[35]

Proceedings of the 37th

Lim, Jae Hyun and Courville, Aaron and Pal, Christopher and Huang, Chin-Wei , month = nov, year =. Proceedings of the 37th
[37]

He, Jiajun and Du, Yuanqi and Vargas, Francisco and Zhang, Dinghuai and Padhy, Shreyas and OuYang, RuiKang and Gomes, Carla and Hernández-Lobato, José Miguel , month = apr, year =. No. doi:10.48550/arXiv.2502.06685 , abstract =

doi arXiv
[38]

Denoising

Vargas, Francisco and Grathwohl, Will Sussman and Doucet, Arnaud , month = sep, year =. Denoising
[39]

Zhang, Qinsheng and Chen, Yongxin , month = oct, year =. Path
[40]

Salimans, Tim and Ho, Jonathan , month = apr, year =. Should
[41]

Noise-contrastive estimation:

Gutmann, Michael and Hyvärinen, Aapo , month = mar, year =. Noise-contrastive estimation:. Proceedings of the
[42]

Poole, Ben and Ozair, Sherjil and Oord, Aaron Van Den and Alemi, Alex and Tucker, George , month = may, year =. On. Proceedings of the 36th
[43]

Box, G. E. P. and Lucas, H. L. , year =. Design of. Biometrika , publisher =. doi:10.2307/2332810 , number =

doi
[45]

and Jaakkola, Tommi S

Ajay, Anurag and Du, Yilun and Gupta, Abhi and Tenenbaum, Joshua B. and Jaakkola, Tommi S. and Agrawal, Pulkit , month = sep, year =. Is
[46]

Spectral

Phillips, Angus and Seror, Thomas and Hutchinson, Michael John and Bortoli, Valentin De and Doucet, Arnaud and Mathieu, Emile , month = nov, year =. Spectral
[47]

Tancik, Matthew and Srinivasan, Pratul and Mildenhall, Ben and Fridovich-Keil, Sara and Raghavan, Nithin and Singhal, Utkarsh and Ramamoorthi, Ravi and Barron, Jonathan and Ng, Ren , year =. Fourier. Advances in
[48]

Attention is

Vaswani, Ashish and Shazeer, Noam and Parmar, Niki and Uszkoreit, Jakob and Jones, Llion and Gomez, Aidan N and Kaiser, Ł ukasz and Polosukhin, Illia , year =. Attention is. Advances in
[49]

Pope, Phil and Zhu, Chen and Abdelkader, Ahmed and Goldblum, Micah and Goldstein, Tom , month = oct, year =. The
[50]

and Ross, Brendan Leigh and Cresswell, Jesse C

Brown, Bradley CA and Caterini, Anthony L. and Ross, Brendan Leigh and Cresswell, Jesse C. and Loaiza-Ganem, Gabriel , month = sep, year =. Verifying the
[52]

Simulation-based optimal. J. Comput. Phys. , author =. 2013 , pages =. doi:10.1016/j.jcp.2012.08.013 , abstract =

2013 doi
[53]

Monte. J. Mach. Learn. Res. , author =. 2020 , pages =

2020
[55]

Diffusion

Dhariwal, Prafulla and Nichol, Alexander , year =. Diffusion. Advances in
[56]

Ajay, Anurag and Du, Yilun and Gupta, Abhi and Tenenbaum, Joshua and Jaakkola, Tommi and Agrawal, Pulkit , month = jul, year =. Is. doi:10.48550/arXiv.2211.15657 , abstract =

doi arXiv
[57]

The sample size required in importance sampling , volume =

Chatterjee, Sourav and Diaconis, Persi , month = apr, year =. The sample size required in importance sampling , volume =. The Annals of Applied Probability , publisher =. doi:10.1214/17-AAP1326 , abstract =

doi
[58]

Journal of the Royal Statistical Society: Series B (Statistical Methodology) , author =

Sequential. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , author =. 2006 , note =. doi:10.1111/j.1467-9868.2006.00553.x , abstract =

2006 doi
[59]

, month = nov, year =

Kleinegesse, Steven and Gutmann, Michael U. , month = nov, year =. Bayesian. Proceedings of the 37th
[60]

, month = apr, year =

Kleinegesse, Steven and Gutmann, Michael U. , month = apr, year =. Efficient. Proceedings of the
[61]

Representation

Oord, Aaron van den and Li, Yazhe and Vinyals, Oriol , month = jan, year =. Representation. doi:10.48550/arXiv.1807.03748 , abstract =

doi arXiv
[62]

Robbins, Herbert and Monro, Sutton , month = sep, year =. A. The Annals of Mathematical Statistics , publisher =. doi:10.1214/aoms/1177729586 , abstract =

doi
[63]

Journal of Mathematical Psychology , author =

A tutorial on adaptive design optimization , volume =. Journal of Mathematical Psychology , author =. 2013 , keywords =. doi:10.1016/j.jmp.2013.05.005 , abstract =

2013 doi
[64]

and Drovandi, Christopher C

Ryan, Elizabeth G. and Drovandi, Christopher C. and McGree, James M. and Pettitt, Anthony N. , year =. A. International Statistical Review / Revue Internationale de Statistique , publisher =
[65]

Gal, Yarin and Islam, Riashat and Ghahramani, Zoubin , month = aug, year =. Deep. Proceedings of the 34th
[66]

Bioinformatics (Oxford, England) , author =

A. Bioinformatics (Oxford, England) , author =. 2012 , keywords =. doi:10.1093/bioinformatics/bts092 , abstract =

2012 doi
[70]

The Book of Statistical Proofs , author =

Differential entropy of the multivariate normal distribution , url =. The Book of Statistical Proofs , author =
[71]

, editor =

Bai, Zhidong and Silverstein, Jack W. , editor =. Sample. Spectral. 2010 , pages =. doi:10.1007/978-1-4419-0661-8_3 , abstract =

2010 doi
[72]

, year =

Bai, Zhidong and Silverstein, Jack W. , year =. Spectral. doi:10.1007/978-1-4419-0661-8 , language =

doi
[73]

1967 , pages =

Mathematics of the USSR-Sbornik , author =. 1967 , pages =. doi:10.1070/SM1967v001n04ABEH001994 , number =

1967 doi
[79]

Particle

Phillips, Angus and Dau, Hai-Dang and Hutchinson, Michael John and Bortoli, Valentin De and Deligiannidis, George and Doucet, Arnaud , month = jul, year =. Particle. Proceedings of the 41st
[80]

IEEE Transactions on Information Theory , author =

The convolution inequality for entropy powers , volume =. IEEE Transactions on Information Theory , author =. 1965 , note =. doi:10.1109/TIT.1965.1053768 , abstract =

1965 doi
[81]

Robbins, Herbert , month = jan, year =. An. Proceedings of the
[82]

Denoising

Song, Jiaming and Meng, Chenlin and Ermon, Stefano , month = oct, year =. Denoising
[83]

, year =

Beaumont, Mark A. , year =. Approximate. Annual Review of Ecology, Evolution, and Systematics , publisher =
[84]

Ecology Letters , author =

Statistical inference for stochastic simulation models – theory and application , volume =. Ecology Letters , author =. 2011 , note =. doi:10.1111/j.1461-0248.2011.01640.x , abstract =

2011 doi
[85]

and Kumar, Abhishek and Ermon, Stefano and Poole, Ben , month = oct, year =

Song, Yang and Sohl-Dickstein, Jascha and Kingma, Diederik P. and Kumar, Abhishek and Ermon, Stefano and Poole, Ben , month = oct, year =. Score-
[86]

Denoising diffusion probabilistic models , isbn =

Ho, Jonathan and Jain, Ajay and Abbeel, Pieter , month = dec, year =. Denoising diffusion probabilistic models , isbn =. Proceedings of the 34th
[87]

and Maheswaranathan, Niru and Ganguli, Surya , month = jul, year =

Sohl-Dickstein, Jascha and Weiss, Eric A. and Maheswaranathan, Niru and Ganguli, Surya , month = jul, year =. Deep unsupervised learning using nonequilibrium thermodynamics , abstract =. Proceedings of the 32nd
[88]

Generative

Song, Yang and Ermon, Stefano , year =. Generative. Advances in
[89]

, year =

Neal, Radford M. , year =. Handbook of
[90]

Journal of the Royal Statistical Society: Series B (Statistical Methodology) , author =

Optimal scaling of discrete approximations to. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , author =. 1998 , note =. doi:10.1111/1467-9868.00123 , abstract =

1998 doi
[91]

Coconuts and

Zhang, Brian , month = apr, year =. Coconuts and. doi:10.48550/arXiv.1904.04669 , abstract =

1904 doi arXiv
[92]

and Welling, Max , month = dec, year =

Kingma, Diederik P. and Welling, Max , month = dec, year =. Auto-. doi:10.48550/arXiv.1312.6114 , abstract =

doi arXiv
[93]

Probabilistic

Neal, Radford M , year =. Probabilistic
[94]

and Stern, Hal S

Gelman, Andrew and Carlin, John B. and Stern, Hal S. and Rubin, Donald B. , month = jun, year =. Bayesian. doi:10.1201/9780429258411 , abstract =

doi
[95]

Rainforth, Tom and Kosiorek, Adam and Le, Tuan Anh and Maddison, Chris and Igl, Maximilian and Wood, Frank and Teh, Yee Whye , month = jul, year =. Tighter. Proceedings of the 35th
[96]

Variational

Kingma, Diederik and Salimans, Tim and Poole, Ben and Ho, Jonathan , year =. Variational. Advances in
[97]

Implicit

Sitzmann, Vincent and Martel, Julien and Bergman, Alexander and Lindell, David and Wetzstein, Gordon , year =. Implicit. Advances in
[98]

, month = feb, year =

Turner, Richard E. , month = feb, year =. An. doi:10.48550/arXiv.2304.10557 , abstract =

doi
[99]

Interpretation and generalization of score matching , isbn =

Lyu, Siwei , month = jun, year =. Interpretation and generalization of score matching , isbn =. Proceedings of the
[100]

Elucidating the

Karras, Tero and Aittala, Miika and Aila, Timo and Laine, Samuli , month = oct, year =. Elucidating the
[101]

and Bengio, Yoshua and Courville, Aaron , month = may, year =

Rahaman, Nasim and Baratin, Aristide and Arpit, Devansh and Draxler, Felix and Lin, Min and Hamprecht, Fred A. and Bengio, Yoshua and Courville, Aaron , month = may, year =. On the. doi:10.48550/arXiv.1806.08734 , abstract =

doi arXiv
[102]

Classifier-

Ho, Jonathan and Salimans, Tim , month = jul, year =. Classifier-. doi:10.48550/arXiv.2207.12598 , abstract =

doi arXiv
[103]

Liu, Xingchao and Gong, Chengyue and Liu, Qiang , month = sep, year =. Flow. doi:10.48550/arXiv.2209.03003 , abstract =

doi arXiv
[104]

Scarvelis, Christopher and Borde, Haitz Sáez de Ocáriz and Solomon, Justin , month = jan, year =. Closed-. doi:10.48550/arXiv.2310.12395 , abstract =

doi arXiv
[105]

Guiding a

Karras, Tero and Aittala, Miika and Kynkäänniemi, Tuomas and Lehtinen, Jaakko and Aila, Timo and Laine, Samuli , month = nov, year =. Guiding a
[106]

Chen, Zonghao and Naslidnyk, Masha and Briol, François-Xavier , month = feb, year =. Nested. doi:10.48550/arXiv.2502.18284 , abstract =

doi arXiv
[107]

and Huan, Xun , month = jan, year =

Coons, Thomas E. and Huan, Xun , month = jan, year =. A. doi:10.48550/arXiv.2501.10845 , abstract =

doi
[108]

and Drovandi, Christopher C

Ryan, Elizabeth G. and Drovandi, Christopher C. and Pettitt, Anthony N. , month = mar, year =. Fully. Entropy , publisher =. doi:10.3390/e17031063 , abstract =

doi
[109]

and Beckers, Francois and Hemmings, Rob and Honig, Peter and Irony, Telba and LaVange, Lisa and Lieberman, Grazyna and Mayne, James and Moscicki, Richard , month = mar, year =

Ruberg, Stephen J. and Beckers, Francois and Hemmings, Rob and Honig, Peter and Irony, Telba and LaVange, Lisa and Lieberman, Grazyna and Mayne, James and Moscicki, Richard , month = mar, year =. Application of. Nature Reviews Drug Discovery , publisher =. doi:10.1038/s41573-0...

doi
[110]

Predictive

Hernandez-Lobato, Daniel and Hernandez-Lobato, Jose and Shah, Amar and Adams, Ryan , month = jun, year =. Predictive. Proceedings of
[111]

Diffusion

Dou, Zehao and Song, Yang , month = oct, year =. Diffusion
[112]

Score-based

Rozet, François and Louppe, Gilles , month = nov, year =. Score-based
[113]

Liu, Qiang and Wang, Dilin , year =. Stein. Advances in
[114]

Diffusive

Chen, Wenlin and Zhang, Mingtian and Paige, Brooks and Hernández-Lobato, José Miguel and Barber, David , month = may, year =. Diffusive. doi:10.48550/arXiv.2402.03008 , abstract =

doi arXiv
[115]

Bortoli, Valentin De and Hutchinson, Michael and Wirnsberger, Peter and Doucet, Arnaud , month = feb, year =. Target. doi:10.48550/arXiv.2402.08667 , abstract =

doi arXiv
[116]

Continual

Matthews, Alex and Arbel, Michael and Rezende, Danilo Jimenez and Doucet, Arnaud , month = jun, year =. Continual. Proceedings of the 39th
[117]

Annealed

Arbel, Michael and Matthews, Alex and Doucet, Arnaud , month = jul, year =. Annealed. Proceedings of the 38th
[118]

Decision

Chen, Lili and Lu, Kevin and Rajeswaran, Aravind and Lee, Kimin and Grover, Aditya and Laskin, Misha and Abbeel, Pieter and Srinivas, Aravind and Mordatch, Igor , year =. Decision. Advances in
[119]

Zheng, Qinqing and Zhang, Amy and Grover, Aditya , month = jun, year =. Online. Proceedings of the 39th
[120]

Janner, Michael and Li, Qiyang and Levine, Sergey , year =. Offline. Advances in
[121]

and Zhou, Mingyuan , month = sep, year =

Wang, Zhendong and Hunt, Jonathan J. and Zhou, Mingyuan , month = sep, year =. Diffusion
[122]

Planning with

Janner, Michael and Du, Yilun and Tenenbaum, Joshua and Levine, Sergey , month = jun, year =. Planning with. Proceedings of the 39th
[123]

and Kazemi, Hamid and Huang, Furong and Goldblum, Micah and Geiping, Jonas and Goldstein, Tom , month = nov, year =

Bansal, Arpit and Borgnia, Eitan and Chu, Hong-Min and Li, Jie S. and Kazemi, Hamid and Huang, Furong and Goldblum, Micah and Geiping, Jonas and Goldstein, Tom , month = nov, year =. Cold
[124]

Xu, Jin and Dupont, Emilien and Märtens, Kaspar and Rainforth, Tom and Teh, Yee Whye , month = nov, year =. Deep
[125]

and Naesseth, Christian A

Wu, Luhuan and Trippe, Brian L. and Naesseth, Christian A. and Blei, David and Cunningham, John Patrick , month = nov, year =. Practical and
[126]

and Yim, Jason and Tischer, Doug and Baker, David and Broderick, Tamara and Barzilay, Regina and Jaakkola, Tommi S

Trippe, Brian L. and Yim, Jason and Tischer, Doug and Baker, David and Broderick, Tamara and Barzilay, Regina and Jaakkola, Tommi S. , month = sep, year =. Diffusion
[127]

Understanding

Luo, Calvin , month = aug, year =. Understanding. doi:10.48550/arXiv.2208.11970 , abstract =

doi arXiv
[128]

Diffusion

Chung, Hyungjin and Kim, Jeongsol and Mccann, Michael Thompson and Klasky, Marc Louis and Ye, Jong Chul , month = sep, year =. Diffusion
[129]

Cardoso, Gabriel and Idrissi, Yazid Janati el and Corff, Sylvain Le and Moulines, Eric , month = oct, year =. Monte
[130]

Multilevel

Goda, Takashi and Hironaka, Tomohiko and Iwamoto, Takeru , month = jul, year =. Multilevel. Stochastic Analysis and Applications , publisher =. doi:10.1080/07362994.2019.1705168 , abstract =

2019 doi
[131]

Waibel, Dominik J. E. and Röell, Ernst and Rieck, Bastian and Giryes, Raja and Marr, Carsten , month = apr, year =. A. 2023. doi:10.1109/ISBI53787.2023.10230752 , abstract =

2023 doi
[132]

Diffusion models in bioinformatics and computational biology , volume =

Guo, Zhiye and Liu, Jian and Wang, Yanli and Chen, Mengrui and Wang, Duolin and Xu, Dong and Cheng, Jianlin , month = feb, year =. Diffusion models in bioinformatics and computational biology , volume =. Nature Reviews Bioengineering , publisher =. doi:10.1038/s44222-023-00114...

doi
[133]

Deep learning for cellular image analysis , volume =

Moen, Erick and Bannon, Dylan and Kudo, Takamasa and Graf, William and Covert, Markus and Van Valen, David , month = dec, year =. Deep learning for cellular image analysis , volume =. Nature Methods , publisher =. doi:10.1038/s41592-019-0403-1 , abstract =

doi
[134]

2020 , pages =

Bioinformatics , author =. 2020 , pages =. doi:10.1093/bioinformatics/btaa293 , abstract =

2020 doi
[135]

and Charras, Guillaume T

Ulicna, Kristina and Kelkar, Manasi and Soelistyo, Christopher J. and Charras, Guillaume T. and Lowe, Alan R. , month = may, year =. Learning dynamic image representations for self-supervised cell cycle annotation , copyright =. doi:10.1101/2023.05.30.542796 , abstract =

2023 doi
[136]

and Ulicna, Kristina and Lowe, Alan R

Soelistyo, Christopher J. and Ulicna, Kristina and Lowe, Alan R. , month = jul, year =. Machine learning enhanced cell tracking , volume =. Frontiers in Bioinformatics , publisher =. doi:10.3389/fbinf.2023.1228989 , abstract =

2023 doi
[137]

, month = oct, year =

Ulicna, Kristina and Vallardi, Giulia and Charras, Guillaume and Lowe, Alan R. , month = oct, year =. Automated. Frontiers in Computer Science , publisher =. doi:10.3389/fcomp.2021.734559 , abstract =

2021 doi
[138]

2024 , pages =

Bioinformatics , author =. 2024 , pages =. doi:10.1093/bioinformatics/btae518 , abstract =

2024 doi
[139]

and Ba, Jimmy , month = jan, year =

Kingma, Diederik P. and Ba, Jimmy , month = jan, year =. Adam:. doi:10.48550/arXiv.1412.6980 , abstract =

doi arXiv
[140]

Very deep convolutional neural network based image classification using small training sample size , issn =

Liu, Shuying and Deng, Weihong , month = nov, year =. Very deep convolutional neural network based image classification using small training sample size , issn =. 2015 3rd. doi:10.1109/ACPR.2015.7486599 , abstract =

2015 doi
[141]

and Bottou, Léon and Orr, Genevieve B

LeCun, Yann A. and Bottou, Léon and Orr, Genevieve B. and Müller, Klaus-Robert , editor =. Efficient. Neural. 2012 , keywords =. doi:10.1007/978-3-642-35289-8_3 , abstract =

2012 doi
[142]

Ioffe, Sergey and Szegedy, Christian , month = jun, year =. Batch. Proceedings of the 32nd
[143]

He, Kaiming and Zhang, Xiangyu and Ren, Shaoqing and Sun, Jian , month = jun, year =. Deep. 2016. doi:10.1109/CVPR.2016.90 , abstract =

2016 doi
[144]

Ronneberger, Olaf and Fischer, Philipp and Brox, Thomas , editor =. U-. Medical. 2015 , keywords =. doi:10.1007/978-3-319-24574-4_28 , abstract =

2015 doi
[145]

Amortized

Huang, Daolang and Guo, Yujia and Acerbi, Luigi and Kaski, Samuel , month = nov, year =. Amortized
[146]

Prediction-

Smith, Freddie Bickford and Kirsch, Andreas and Farquhar, Sebastian and Gal, Yarin and Foster, Adam and Rainforth, Tom , month = apr, year =. Prediction-. Proceedings of
[147]

Farquhar, Sebastian and Gal, Yarin and Rainforth, Tom , month = oct, year =. On
[149]

Journal of Machine Learning Research , author =

Monte. Journal of Machine Learning Research , author =. 2020 , pages =

2020
[150]

Shi, Yuyang and Cornish, Rob , month = mar, year =. On. Proceedings of
[151]

, year =

Rhee, Chang-Han and Glynn, Peter W. , year =. Unbiased. Operations Research , publisher =
[152]

Computer Methods in Applied Mechanics and Engineering , author =

Nesterov-aided stochastic gradient methods using. Computer Methods in Applied Mechanics and Engineering , author =. 2020 , keywords =. doi:10.1016/j.cma.2020.112909 , abstract =

2020 doi
[153]

Predicting Structured Data , author =

A. Predicting Structured Data , author =
[154]

Regularized estimation of image statistics by

Kingma, Durk P and Cun, Yann , year =. Regularized estimation of image statistics by. Advances in
[155]

and Strathmann, Heiko and Arbel, Michael and Gretton, Arthur , month = mar, year =

Sutherland, Danica J. and Strathmann, Heiko and Arbel, Michael and Gretton, Arthur , month = mar, year =. Efficient and principled score estimation with. Proceedings of the
[156]

Nonparametric

Zhou, Yuhao and Shi, Jiaxin and Zhu, Jun , month = may, year =. Nonparametric
[157]

Information theory and the central limit theorem , isbn =

Johnson, OT , year =. Information theory and the central limit theorem , isbn =
[158]

Yunfan’s Blog , month = jan, year =
[159]

Importance

Burda, Yuri and Grosse, Roger and Salakhutdinov, Ruslan , month = nov, year =. Importance. doi:10.48550/arXiv.1509.00519 , abstract =

doi arXiv
[160]

, month = sep, year =

Tucker, George and Lawson, Dieterich and Gu, Shixiang and Maddison, Chris J. , month = sep, year =. Doubly
[161]

International Conference on Learning Representations , year=

Gradient Estimators for Implicit Models , author=. International Conference on Learning Representations , year=
[162]

International Conference on Machine Learning , pages=

A spectral approach to gradient estimation for implicit distributions , author=. International Conference on Machine Learning , pages=. 2018 , organization=

2018
[163]

Computational Statistics & Data Analysis , author =

Some extensions of score matching , volume =. Computational Statistics & Data Analysis , author =. 2007 , keywords =. doi:10.1016/j.csda.2006.09.003 , abstract =

2007 doi
[164]

Clustering via

Sasaki, Hiroaki and Hyvärinen, Aapo and Sugiyama, Masashi , month = apr, year =. Clustering via. doi:10.48550/arXiv.1404.5028 , abstract =

doi arXiv
[165]

and Strathmann, Heiko and Gretton, Arthur , month = may, year =

Wenliang, Li and Sutherland, Danica J. and Strathmann, Heiko and Gretton, Arthur , month = may, year =. Learning deep kernels for exponential family densities , issn =. Proceedings of the 36th
[166]

, month = feb, year =

Song, Yang and Kingma, Diederik P. , month = feb, year =. How to. doi:10.48550/arXiv.2101.03288 , abstract =

doi arXiv
[167]

The Journal of Chemical Physics , author =

Brownian dynamics as smart. The Journal of Chemical Physics , author =. 1978 , pages =. doi:10.1063/1.436415 , abstract =

1978 doi
[168]

, month = jan, year =

Hutchinson, M.F. , month = jan, year =. A. Communications in Statistics - Simulation and Computation , publisher =. doi:10.1080/03610918908812806 , abstract =

doi
[169]

Journal of Machine Learning Research , author =

Estimation of. Journal of Machine Learning Research , author =. 2005 , pages =

2005
[170]

and Kucukelbir, Alp and McAuliffe, Jon D

Blei, David M. and Kucukelbir, Alp and McAuliffe, Jon D. , month = apr, year =. Variational. Journal of the American Statistical Association , publisher =. doi:10.1080/01621459.2017.1285773 , number =

2017 doi
[171]

Baydin, A. G. and Pearlmutter, B. A. and Radul, A. A. and Siskind, J. M. , year =. Automatic differentiation in machine learning:. Journal of Machine Learning Research , publisher =
[172]

Stochastic

Grenioux, Louis and Noble, Maxence and Gabrié, Marylou and Durmus, Alain Oliviero , month = jul, year =. Stochastic. Proceedings of the 41st
[173]

Implicit

Marion, Pierre and Korba, Anna and Bartlett, Peter and Blondel, Mathieu and Bortoli, Valentin De and Doucet, Arnaud and Llinares-López, Felipe and Paquette, Courtney and Berthet, Quentin , month = may, year =. Implicit. doi:10.48550/arXiv.2402.05468 , abstract =

doi arXiv
[174]

, month = apr, year =

Xu, Ming and Quiroz, Matias and Kohn, Robert and Sisson, Scott A. , month = apr, year =. Variance reduction properties of the reparameterization trick , issn =. Proceedings of the
[177]

Proceedings of the 41st

Iollo, Jacopo and Heinkelé, Christophe and Alliez, Pierre and Forbes, Florence , month = jul, year =. Proceedings of the 41st
[178]

Iqbal, Sahel and Corenflos, Adrien and Särkkä, Simo and Abdulsamad, Hany , month = jul, year =. Nesting. Proceedings of the 41st
[179]

Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics , pages =

A Unified Stochastic Gradient Approach to Designing Bayesian-Optimal Experiments , author =. Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics , pages =. 2020 , volume =

2020
[180]

Biometrika , volume=

Inference and missing data , author=. Biometrika , volume=. 1976 , publisher=

1976
[182]

Variational

Foster, Adam and Jankowiak, Martin and Bingham, Elias and Horsfall, Paul and Teh, Yee Whye and Rainforth, Thomas and Goodman, Noah , year =. Variational. Advances in
[184]

Rainforth, Tom and Cornish, Rob and Yang, Hongseok and Warrington, Andrew and Wood, Frank , month = jul, year =. On. Proceedings of the 35th
[186]

and Rainforth, Thomas , year =

Ivanova, Desi R and Foster, Adam and Kleinegesse, Steven and Gutmann, Michael U. and Rainforth, Thomas , year =. Implicit. Advances in
[187]

and Malik, Ilyas and Rainforth, Tom , month = jul, year =

Foster, Adam and Ivanova, Desi R. and Malik, Ilyas and Rainforth, Tom , month = jul, year =. Deep. Proceedings of the 38th
[188]

and Chades, Iadine and Dezfouli, Amir , month = jun, year =

Blau, Tom and Bonilla, Edwin V. and Chades, Iadine and Dezfouli, Amir , month = jun, year =. Optimizing. Proceedings of the 39th
[189]

Song, Yang and Garg, Sahaj and Shi, Jiaxin and Ermon, Stefano , month = jun, year =. Sliced. doi:10.48550/arXiv.1905.07088 , abstract =

1905 doi arXiv
[190]

2025 , publisher=

Measure theory and fine properties of functions , author=. 2025 , publisher=

2025
[191]

On Estimating the Gradient of the Expected Information Gain in Bayesian Experimental Design

Ziqiao Ao and Jinglai Li. On Estimating the Gradient of the Expected Information Gain in Bayesian Experimental Design . Proceedings of the AAAI Conference on Artificial Intelligence, 38 0 (18): 0 20311--20319, March 2024. ISSN 2374-3468. doi:10.1609/aaai.v38i18.30012. Number: 18

2024 doi
[192]

Information Maximization in Noisy Channels : A Variational Approach

David Barber and Felix Agakov. Information Maximization in Noisy Channels : A Variational Approach . In Advances in Neural Information Processing Systems , volume 16. MIT Press, 2003

2003
[193]

Bonilla, Iadine Chades, and Amir Dezfouli

Tom Blau, Edwin V. Bonilla, Iadine Chades, and Amir Dezfouli. Optimizing Sequential Experimental Design with Deep Reinforcement Learning . In Proceedings of the 39th International Conference on Machine Learning , pages 2107--2128. PMLR, June 2022

2022
[194]

Ivanova, Xavier Intes, Paul-Christian Bürkner, and Stefan T

Niels Bracher, Lars Kühmichel, Desi R. Ivanova, Xavier Intes, Paul-Christian Bürkner, and Stefan T. Radev. JADAI : Jointly Amortizing Adaptive Design and Bayesian Inference , December 2025. arXiv:2512.22999 [stat]

2025 arXiv
[195]

JAX : composable transformations of Python + NumPy programs, 2018

James Bradbury, Roy Frostig, Peter Hawkins, Matthew Johnson, Chris Leary, Dougal Maclaurin, George Necula, Adam Paszke, Jake VanderPlas, Skye Wanderman-Milne, and Qiao Zhang. JAX : composable transformations of Python + NumPy programs, 2018

2018
[196]

Mining gold from implicit models to improve likelihood-free inference

Johann Brehmer, Gilles Louppe, Juan Pavez, and Kyle Cranmer. Mining gold from implicit models to improve likelihood-free inference. Proceedings of the National Academy of Sciences, 117 0 (10): 0 5242--5249, March 2020. doi:10.1073/pnas.1915980117

2020 doi
[197]

Bayesian Experimental Design : A Review

Kathryn Chaloner and Isabella Verdinelli. Bayesian Experimental Design : A Review . Statistical Science, 10 0 (3): 0 273--304, August 1995. ISSN 0883-4237, 2168-8745. doi:10.1214/ss/1177009939

1995 doi
[198]

Diffusion Models Beat GANs on Image Synthesis

Prafulla Dhariwal and Alexander Nichol. Diffusion Models Beat GANs on Image Synthesis . In Advances in Neural Information Processing Systems , volume 34, pages 8780--8794. Curran Associates, Inc., 2021

2021
[199]

Variational Bayesian optimal experimental design with normalizing flows

Jiayuan Dong, Christian Jacobsen, Mehdi Khalloufi, Maryam Akram, Wanjiao Liu, Karthik Duraisamy, and Xun Huan. Variational Bayesian optimal experimental design with normalizing flows. Computer Methods in Applied Mechanics and Engineering, 433: 0 117457, January 2025. ISSN 0045...

2025 doi
[200]

Neural Spline Flows

Conor Durkan, Artur Bekasov, Iain Murray, and George Papamakarios. Neural Spline Flows . In Advances in Neural Information Processing Systems , volume 32. Curran Associates, Inc., 2019

2019
[201]

McMichael

Sergey Dushenko, Kapildeb Ambal, and Robert D. McMichael. Sequential Bayesian Experiment Design for Optically Detected Magnetic Resonance of Nitrogen - Vacancy Centers . Physical Review Applied, 14 0 (5): 0 054036, November 2020. doi:10.1103/PhysRevApplied.14.054036

2020 doi
[202]

Measure theory and fine properties of functions

Lawrence C Evans. Measure theory and fine properties of functions. Chapman and Hall/CRC, 2025

2025
[203]

Variational Bayesian Optimal Experimental Design

Adam Foster, Martin Jankowiak, Elias Bingham, Paul Horsfall, Yee Whye Teh, Thomas Rainforth, and Noah Goodman. Variational Bayesian Optimal Experimental Design . In Advances in Neural Information Processing Systems , volume 32. Curran Associates, Inc., 2019

2019
[204]

A unified stochastic gradient approach to designing bayesian-optimal experiments

Adam Foster, Martin Jankowiak, Matthew O'Meara, Yee Whye Teh, and Tom Rainforth. A unified stochastic gradient approach to designing bayesian-optimal experiments. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics, volume 108 ...

2020
[205]

Ivanova, Ilyas Malik, and Tom Rainforth

Adam Foster, Desi R. Ivanova, Ilyas Malik, and Tom Rainforth. Deep Adaptive Design : Amortizing Sequential Bayesian Experimental Design . In Proceedings of the 38th International Conference on Machine Learning , pages 3384--3395. PMLR, July 2021

2021
[206]

Deep Bayesian active learning with image data

Yarin Gal, Riashat Islam, and Zoubin Ghahramani. Deep Bayesian active learning with image data. In Proceedings of the 34th International Conference on Machine Learning - Volume 70 , ICML '17, pages 1183--1192, Sydney, NSW, Australia, August 2017. JMLR.org

2017
[207]

Unbiased MLMC Stochastic Gradient - Based Optimization of Bayesian Experimental Designs

Takashi Goda, Tomohiko Hironaka, Wataru Kitade, and Adam Foster. Unbiased MLMC Stochastic Gradient - Based Optimization of Bayesian Experimental Designs . SIAM Journal on Scientific Computing, 44 0 (1): 0 A286--A311, February 2022. ISSN 1064-8275. doi:10.1137/20M1338848

2022 doi
[208]

Ivanova, Cong Guan, and Tom Rainforth

Marcel Hedman, Desi R. Ivanova, Cong Guan, and Tom Rainforth. Step- DAD : Semi - Amortized Policy - Based Bayesian Experimental Design . In Proceedings of the 42nd International Conference on Machine Learning , pages 22904--22923. PMLR, October 2025

2025
[209]

Denoising diffusion probabilistic models

Jonathan Ho, Ajay Jain, and Pieter Abbeel. Denoising diffusion probabilistic models. In Proceedings of the 34th International Conference on Neural Information Processing Systems , NIPS '20, pages 6840--6851, Red Hook, NY, USA, December 2020. Curran Associates Inc. ISBN 978-1-7...

2020
[210]

Optimal experimental design: Formulations and computations

Xun Huan, Jayanth Jagalur, and Youssef Marzouk. Optimal experimental design: Formulations and computations. Acta Numerica, 33: 0 715--840, July 2024. ISSN 0962-4929, 1474-0508. doi:10.1017/S0962492924000023

2024 doi
[211]

Efficient adaptive data acquisition via pretrained belief representations

Daolang Huang, Zhuoyue Huang, Conor Hassan, Luigi Acerbi, Samuel Kaski, and Tom Rainforth. Efficient adaptive data acquisition via pretrained belief representations. arXiv preprint arXiv:2606.25197, 2026 a

2026 arXiv
[212]

Aline: Joint amortization for bayesian inference and active data acquisition

Daolang Huang, Xinyi Wen, Ayush Bharti, Samuel Kaski, and Luigi Acerbi. Aline: Joint amortization for bayesian inference and active data acquisition. Advances in Neural Information Processing Systems, 38: 0 54068--54102, 2026 b

2026
[213]

Estimation of Non - Normalized Statistical Models by Score Matching

Aapo Hyvärinen. Estimation of Non - Normalized Statistical Models by Score Matching . Journal of Machine Learning Research, 6 0 (24): 0 695--709, 2005. ISSN 1533-7928

2005
[214]

Bayesian Experimental Design via Contrastive Diffusions , March 2025

Jacopo Iollo, Christophe Heinkelé, Pierre Alliez, and Florence Forbes. Bayesian Experimental Design via Contrastive Diffusions , March 2025. arXiv:2410.11826 [stat] version: 2

2025 arXiv
[215]

Nesting Particle Filters for Experimental Design in Dynamical Systems

Sahel Iqbal, Adrien Corenflos, Simo Särkkä, and Hany Abdulsamad. Nesting Particle Filters for Experimental Design in Dynamical Systems . In Proceedings of the 41st International Conference on Machine Learning , pages 21047--21068. PMLR, July 2024

2024
[216]

Gutmann, and Thomas Rainforth

Desi R Ivanova, Adam Foster, Steven Kleinegesse, Michael U. Gutmann, and Thomas Rainforth. Implicit Deep Adaptive Design : Policy - Based Experimental Design without Likelihoods . In Advances in Neural Information Processing Systems , volume 34, pages 25785--25798. Curran Asso...

2021
[217]

Kingma and Jimmy Ba

Diederik P. Kingma and Jimmy Ba. Adam: A Method for Stochastic Optimization , January 2017. arXiv:1412.6980 [cs]

2017 arXiv
[218]

Kingma and Max Welling

Diederik P. Kingma and Max Welling. Auto- Encoding Variational Bayes , December 2013. arXiv:1312.6114 [stat]

2013 arXiv
[219]

Steven Kleinegesse and Michael U. Gutmann. Efficient Bayesian Experimental Design for Implicit Models . In Proceedings of the Twenty - Second International Conference on Artificial Intelligence and Statistics , pages 476--485. PMLR, April 2019

2019
[220]

Steven Kleinegesse and Michael U. Gutmann. Bayesian Experimental Design for Implicit Models by Mutual Information Neural Estimation . In Proceedings of the 37th International Conference on Machine Learning , pages 5316--5326. PMLR, November 2020

2020
[221]

Gradient estimators for implicit models

Yingzhen Li and Richard E Turner. Gradient estimators for implicit models. In International Conference on Learning Representations, 2018

2018
[222]

AR - DAE : Towards Unbiased Neural Entropy Gradient Estimation

Jae Hyun Lim, Aaron Courville, Christopher Pal, and Chin-Wei Huang. AR - DAE : Towards Unbiased Neural Entropy Gradient Estimation . In Proceedings of the 37th International Conference on Machine Learning , pages 6061--6071. PMLR, November 2020

2020
[223]

D. V. Lindley. On a Measure of the Information Provided by an Experiment . The Annals of Mathematical Statistics, 27 0 (4): 0 986--1005, December 1956. ISSN 0003-4851, 2168-8990. doi:10.1214/aoms/1177728069

1956 doi
[224]

Bayesian statistics: A review

Dennis Victor Lindley. Bayesian statistics: A review. SIAM, 1972

1972
[225]

McMichael, Sergey Dushenko, and Sean M

Robert D. McMichael, Sergey Dushenko, and Sean M. Blakley. Sequential Bayesian experiment design for adaptive Ramsey sequence measurements. Journal of Applied Physics, 130 0 (14): 0 144401, October 2021. ISSN 0021-8979. doi:10.1063/5.0055630

2021 doi
[226]

Transformer neural processes: Uncertainty-aware meta learning via sequence modeling

Tung Nguyen and Aditya Grover. Transformer neural processes: Uncertainty-aware meta learning via sequence modeling. In Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, editors, Proceedings of the 39th International Conference on Mach...

2022
[227]

Masked Autoregressive Flow for Density Estimation

George Papamakarios, Theo Pavlakou, and Iain Murray. Masked Autoregressive Flow for Density Estimation . In Advances in Neural Information Processing Systems , volume 30. Curran Associates, Inc., 2017

2017
[228]

Krosnick

Josh Pasek and Jon A. Krosnick. Optimizing Survey Questionnaire Design in Political Science : Insights from Psychology . In Jan E. Leighley, editor, The Oxford Handbook of American Elections and Political Behavior , page 0. Oxford University Press, February 2010. ISBN 978-0-19...

2010 doi
[229]

On Nesting Monte Carlo Estimators

Tom Rainforth, Rob Cornish, Hongseok Yang, Andrew Warrington, and Frank Wood. On Nesting Monte Carlo Estimators . In Proceedings of the 35th International Conference on Machine Learning , pages 4267--4276. PMLR, July 2018

2018
[230]

Ivanova, and Freddie Bickford Smith

Tom Rainforth, Adam Foster, Desi R. Ivanova, and Freddie Bickford Smith. Modern Bayesian Experimental Design . Statistical Science, 39 0 (1): 0 100--114, February 2024. ISSN 0883-4237, 2168-8745. doi:10.1214/23-STS915

2024 doi
[231]

Chang-Han Rhee and Peter W. Glynn. Unbiased Estimation with Square Root Convergence for SDE Models . Operations Research, 63 0 (5): 0 1026--1043, 2015. ISSN 0030-364X

2015
[232]

High- Resolution Image Synthesis with Latent Diffusion Models

Robin Rombach, Andreas Blattmann, Dominik Lorenz, Patrick Esser, and Björn Ommer. High- Resolution Image Synthesis with Latent Diffusion Models . In 2022 IEEE / CVF Conference on Computer Vision and Pattern Recognition ( CVPR ) , pages 10674--10685, June 2022. doi:10.1109/CVPR...

2022 doi
[233]

Inference and missing data

Donald B Rubin. Inference and missing data. Biometrika, 63 0 (3): 0 581--592, 1976

1976
[234]

Deep Bayesian experimental design for quantum many-body systems

Leopoldo Sarra and Florian Marquardt. Deep Bayesian experimental design for quantum many-body systems. Machine Learning: Science and Technology, 4 0 (4): 0 045022, October 2023. ISSN 2632-2153. doi:10.1088/2632-2153/ad020d

2023 doi
[235]

C. E. Shannon. A Mathematical Theory of Communication . Bell System Technical Journal, 27 0 (3): 0 379--423, 1948. ISSN 1538-7305. doi:10.1002/j.1538-7305.1948.tb01338.x. \_eprint: https://onlinelibrary.wiley.com/doi/pdf/10.1002/j.1538-7305.1948.tb01338.x

1948 doi
[236]

Bayesian Sequential Optimal Experimental Design for Nonlinear Models Using Policy Gradient Reinforcement Learning

Wanggang Shen and Xun Huan. Bayesian Sequential Optimal Experimental Design for Nonlinear Models Using Policy Gradient Reinforcement Learning . Computer Methods in Applied Mechanics and Engineering, 416: 0 116304, November 2023. ISSN 00457825. doi:10.1016/j.cma.2023.116304. ar...

2023 doi
[237]

Maximum likelihood multiple-source localization using acoustic energy measurements with wireless sensor networks

Xiaohong Sheng and Yu-Hen Hu. Maximum likelihood multiple-source localization using acoustic energy measurements with wireless sensor networks. IEEE Transactions on Signal Processing, 53 0 (1): 0 44--53, January 2005. ISSN 1941-0476. doi:10.1109/TSP.2004.838930. Conference Nam...

2005 doi
[238]

A spectral approach to gradient estimation for implicit distributions

Jiaxin Shi, Shengyang Sun, and Jun Zhu. A spectral approach to gradient estimation for implicit distributions. In International Conference on Machine Learning, pages 4644--4653. PMLR, 2018

2018
[239]

Jasper Snoek, Hugo Larochelle, and Ryan P. Adams. Practical Bayesian Optimization of Machine Learning Algorithms , August 2012. arXiv:1206.2944 [stat]

2012 arXiv
[240]

Generative Modeling by Estimating Gradients of the Data Distribution

Yang Song and Stefano Ermon. Generative Modeling by Estimating Gradients of the Data Distribution . In Advances in Neural Information Processing Systems , volume 32. Curran Associates, Inc., 2019

2019
[241]

Sliced Score Matching : A Scalable Approach to Density and Score Estimation , June 2019

Yang Song, Sahaj Garg, Jiaxin Shi, and Stefano Ermon. Sliced Score Matching : A Scalable Approach to Density and Score Estimation , June 2019. arXiv:1905.07088

2019 arXiv
[242]

Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domains

Matthew Tancik, Pratul Srinivasan, Ben Mildenhall, Sara Fridovich-Keil, Nithin Raghavan, Utkarsh Singhal, Ravi Ramamoorthi, Jonathan Barron, and Ren Ng. Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domains . In Advances in Neural Information ...

2020
[243]

W. M. Telford, L. P. Geldart, and R. E. Sheriff. Gravity Methods, page 6–61. Cambridge University Press, 1990

1990
[244]

Attention is All you Need

Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Ł ukasz Kaiser, and Illia Polosukhin. Attention is All you Need . In Advances in Neural Information Processing Systems , volume 30. Curran Associates, Inc., 2017

2017
[245]

The DARC Toolbox : automated, flexible, and efficient delayed and risky choice experiments using Bayesian adaptive design, October 2017

Benjamin Thomas Vincent and Tom Rainforth. The DARC Toolbox : automated, flexible, and efficient delayed and risky choice experiments using Bayesian adaptive design, October 2017

2017
[246]

A Connection Between Score Matching and Denoising Autoencoders

Pascal Vincent. A Connection Between Score Matching and Denoising Autoencoders . Neural Computation, 23 0 (7): 0 1661--1674, July 2011. ISSN 0899-7667. doi:10.1162/NECO_a_00142. Conference Name: Neural Computation

2011 doi
[247]

Andrew B. Watson. QUEST +: A general multidimensional Bayesian adaptive psychometric method. Journal of Vision, 17 0 (3): 0 10, April 2017. ISSN 1534-7362. doi:10.1167/17.3.10

2017 doi
[248]

Gradient estimation of information measures in deep learning

Liangjian Wen, Haoli Bai, Lirong He, Yiji Zhou, Mingyuan Zhou, and Zenglin Xu. Gradient estimation of information measures in deep learning. Knowledge-Based Systems, 224: 0 107046, July 2021. ISSN 09507051. doi:10.1016/j.knosys.2021.107046

2021 doi
[249]

Williams

Ronald J. Williams. Simple Statistical Gradient - Following Algorithms for Connectionist Reinforcement Learning . Mach. Learn., 8 0 (3-4): 0 229--256, May 1992. ISSN 0885-6125. doi:10.1007/BF00992696

1992 doi

Pith tools

Reviewed July 10, 2026 · model on record in the stance chip above.

[1] [1]

Proceedings of the 39th International Conference on Machine Learning , pages =

Transformer Neural Processes: Uncertainty-Aware Meta Learning Via Sequence Modeling , author =. Proceedings of the 39th International Conference on Machine Learning , pages =. 2022 , editor =

work page 2022

[2] [2]

1972 , publisher=

Bayesian statistics: A review , author=. 1972 , publisher=

work page 1972

[3] [3]

Telford, W. M. and Geldart, L. P. and Sheriff, R. E. , year=. Gravity Methods , booktitle=

work page

[4] [4]

Proceedings of the 35th

Chen, Zhao and Badrinarayanan, Vijay and Lee, Chen-Yu and Rabinovich, Andrew , month = jul, year =. Proceedings of the 35th

work page

[5] [5]

Vincent, Benjamin Thomas and Rainforth, Tom , month = oct, year =. The. doi:10.31234/osf.io/yehjb , abstract =

work page doi:10.31234/osf.io/yehjb

[6] [6]

Durkan, Conor and Bekasov, Artur and Murray, Iain and Papamakarios, George , year =. Neural. Advances in

work page

[7] [7]

Bradbury, James and Frostig, Roy and Hawkins, Peter and Johnson, Matthew and Leary, Chris and Maclaurin, Dougal and Necula, George and Paszke, Adam and VanderPlas, Jake and Wanderman-Milne, Skye and Zhang, Qiao , year =

work page

[8] [8]

and Guan, Cong and Rainforth, Tom , month = oct, year =

Hedman, Marcel and Ivanova, Desi R. and Guan, Cong and Rainforth, Tom , month = oct, year =. Step-. Proceedings of the 42nd

work page