Conditional Neural Bayes Ratio Estimation for Experimental Design Optimisation
Authors: S. A. K. Leeney, T. Gessey-Jones, W. J. Handley, E. de Lera Acedo, H. T. J. Bevins, J. L. Tutt
Organizations: Cavendish Astrophysics, University of Cambridge, Cambridge CB3 0HE, UK. · Kavli Institute for Cosmology, University of Cambridge, Cambridge CB3 0HA, UK. · PhysicsX, London, UK. · Institute of Astronomy, University of Cambridge, Cambridge CB3 0HA, UK.
For frontier experiments operating at the edge of detectability, instrument design directly determines the probability of discovery. We introduce Conditional Neural Bayes Ratio Estimation (cNBRE), which extends neural Bayes ratio estimation by conditioning on design parameters, enabling a single trained network to estimate Bayes factors across a continuous design space. Applied to 21-cm radio cosmology with simulations representative of the REACH experiment, the amortised nature of cNBRE enables systematic design space exploration that would be intractable with traditional point-wise methods, while recovering established physical relationships. The analysis demonstrates a ~20 percentage point variation in detection probability with antenna orientation for a single night of observation, a design decision that would be trivial to implement if determined prior to antenna construction. This framework enables efficient, globally-informed experimental design optimisation for a wide range of scientific applications.
Figures & tables
Significance
K
logK
1σ
∼3
∼1.1
2σ
∼12
∼2.5
3σ
∼150
∼5.0
5σ
∼1.7×106
∼14.4
TABLE I: Approximate correspondence between statistical significance levels and Bayes Factors.
Fig. 1: Detection probability as a function of observation time τ for three Bayes factor thresholds corresponding to 1σ ( K≈3 ), 3σ ( K≈150 ), and 5σ ( K≈1.7×106 ) significance.
Fig. 2: Detection probability as a function of observation time ( τ ) and signal amplitude ( A ). Detection probabilities are computed on test sets with signals injected at fixed amplitudes; the network marginalizes over the full signal prior during training. The panels show 5σ , 3σ , and 1σ thresholds, confirming that detection probability improves with longer integration and larger amplitudes.
Fig. 3: Multi-panel visualisation of detection probability as a function of observation time ( τ ) and signal central frequency ( f0 ). Detection probabilities are computed on test sets with signals injected at fixed f0 values; the cNBRE network itself marginalizes over the full signal prior during training. The three heatmaps show 5σ , 3σ , and 1σ thresholds (left to right). Marginal plots highlight reduced sensitivity at the band edges.
Fig. 4: Polar heatmap showing the variation in detection probability (radial axis) and achievable significance (colour scale) as a function of antenna orientation angle (angular axis) for several observations over a single night. The four-fold symmetry reflects the interaction of the rectangular dipole beam with galactic foregrounds.
Fig. 5: Comparison of log-Bayes factors estimated by cNBRE (y-axis) versus nested sampling (x-axis) for 1,600 simulated data realisations (811 M1 , 789 M0 ). Circles denote M1 samples (signal present); crosses denote M0 samples (null model). The dashed line indicates perfect agreement. Both methods show broad agreement in the decision-relevant regime, with M0 samples clustering at negative logK and M1 samples at positive logK for both estimators. At very high Bayes factors the cNBRE estimates saturate below the nested sampling values, a consequence of classifier output saturation that is expected and practically irrelevant for detection decisions.
Neural Posterior Estimation (NPE) fits an amortized conditional density estimator to a simulated training set of complete-data realizations. NPE's training objective, log-likelihood, favors posterior approximations that assign arbitrarily high density to the training points, and typical families of amortized conditional density estimators (e.g., normalizing flows, Gaussian encoders) are flexible enough to oblige. The resulting policy of extreme overconfidence translates poorly to held-out data. Early stopping and other regularizers can prevent this degeneracy, but they are limited to selecting posterior approximations along an unfavorable optimization trajectory set by in-sample residuals, where the posterior mean is underfit while the posterior variance is overfit. To avoid this trade-off, we propose Cross-Fitting NPE (CF-NPE), which uses sample splitting to separate conditional-mean estimation from the estimation of the posterior's higher moments. Using K-fold cross-fitting, CF-NPE fits K posterior-mean regressors and then fits a conditional density estimator to the resulting out-of-fold residuals. In experiments with synthetic data and in a cosmological application, CF-NPE achieves higher held-out log-likelihood than standard NPE and typically improves calibration. CF-NPE is most useful in high-dimensional, simulation-limited settings.
Jeffrey Regier
Department of Statistics, University of Michigan, Ann Arbor, MI 48109
Computational cognitive modeling seeks to infer latent cognitive mechanisms underlying observed behavior. Bayesian inverse planning provides a principled framework for such inference, but its success depends critically on the experimental environment. Existing approaches typically treat environments as fixed, leaving open the question of which cognitive experiments are most informative for cognition parameter inference. We formulate the design of cognitive planning experiments as a Bayesian Experimental Design (BED) problem, treating the experimental environment as the design variable. We establish an exact Monte Carlo BED benchmark and introduce an amortized Bayesian experimental design framework for efficient posterior inference and design evaluation. Experiments on the Mouselab-MDP process-tracing paradigm show that amortized BED closely matches the environment rankings of exact Monte Carlo BED while substantially reducing computational cost. We further show that no single environment is uniformly optimal across cognitive inference objectives, revealing trade-offs between expected information gain, posterior recoverability, and information efficiency. These results provide a principled framework for designing informative cognitive experiments for Bayesian parameter inference.
Manisha Dubey, Rimvydas Rubavicius, N. Siddharth +1
School of Informatics, University of Edinburgh, United Kingdom
We develop two hybrid techniques that approach the performance of neural simulation-based inference (NSBI) analyses while substantially reducing the computational cost of inference and preserving some or all of the reliability guarantees of parametric methods. The first approach is broadly applicable, while the second is tailored to a class of particle physics analyses that admit a semi-parametric NSBI formulation. With only a modest compromise in raw sensitivity, these methods represent an important step toward computationally efficient NSBI in offline analyses and also open the door to the exploration of trigger-level applications in the future. Based on our comparison studies, we recommend the use of our first approach, Latent Categories, for robust and efficient inference.
Sean Benevedes, Mani Dehghan, Aishik Ghosh +1
School of Physics, Georgia Institute of Technology, Atlanta, GA 30332, USA · School of Physics, Georgia Institute of Technology, Atlanta, GA 30332, USA and Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA · Max Planck Institute for Physics, Boltzmannstr. 8, 85748 Garching, Germany