V ARIATIONAL METHODS FOR SIMULATION - BASED INFERENCE
A BSTRACT
We present Sequential Neural Variational Inference (SNVI), an approach to perform Bayesian inference in models with intractable likelihoods.
SNVI combines likelihood-estimation (or likelihood-ratio-estimation) with variational inference to achieve a scalable simulation-based inference approach.
SNVI maintains the ﬂexibility of likelihood(-ratio) estimation to allow arbitrary proposals for simulations, while simultaneously providing a functional estimate of the posterior distribution without requiring MCMC sampling.
We present several variants of SNVI and demonstrate that they are substantially more computationally efﬁcient than previous algorithms, without loss of accuracy on benchmark tasks.
We apply SNVI to a neuroscience model of the pyloric network in the crab and demonstrate that it can infer the posterior distribution with one order of magnitude fewer simulations than previously reported.
SNVI vastly reduces the computational cost of simulationbased inference while maintaining accuracy and ﬂexibility, making it possible to tackle problems that were previously inaccessible.
I NTRODUCTION
Many domains in science and engineering use numerical simulations to model empirically observed phenomena.
These models are designed by domain experts and are built to produce mechanistic insights.
However, in many cases, some parameters of the simulator cannot be experimentally measured and need to be inferred from data.
A principled way to identify parameters that match empirical observations is Bayesian inference.
However, for many models of interest, one can only sample from the model by simulating a (stochastic) computer program but explicitly evaluating the likelihood p ( x | θ ) is intractable.
Traditional methods to perform Bayesian inference in such simulation-based inference (SBI), also known as likelihood-free inference scenarios, include Approximate Bayesian computation (ABC) (Beaumont et al., 2002) and synthetic likelihood (SL) (Wood, 2010) methods.
However, these methods generally struggle with high-dimensional data and typically require one to design or learn (Chen et al., 2021) summary statistics and distance functions.
Recently, several methods using neural density(-ratio) estimation have emerged.
These methods train neural networks to learn the posterior (SNPE, Papamakarios & Murray, 2016; Lueckmann et al., 2017; Greenberg et al., 2019), the likelihood (SNLE, Papamakarios et al., 2019; Lueckmann et al., 2019a), or the likelihood-to-evidence ratio (SNRE, Thomas et al., 2021;
Hermans et al., 2020;
Durkan et al., 2020; Miller et al., 2022).
To improve the simulation efﬁciency of these methods, sequential training schemes have been proposed: Initially, parameters are sampled from the prior distribution to train an estimation-network.
Subsequently, new samples are drawn adaptively to focus training on speciﬁc regions in parameter space, thus allowing the methods to scale to larger models with more parameters.
In practice, however, it has remained a challenge to realize the full potential of these sequential schemes: For sequential neural posterior estimation (SNPE) techniques, the loss function needs to be adjusted across rounds (Greenberg et al., 2019), and it has been reported that this can be problematic if the proposal distribution is very different from prior, and lead to ‘leakage’ of probability mass into regions without prior support (Durkan et al., 2020).
Both sequential neural likelihood (SNLE) and likelihood-ratio (SNRE) methods require MCMC sampling, which can become prohibitively slow–
MCMC sampling is required for each round of simulations, which, for high-dimensional models, can take more time than running the simulations and training the neural density estimator.
Our goal is to provide a method which combines the advantages of posterior-targeting methods and those targeting likelihood(-ratios): Posterior targeting methods allow rapid inference by providing a functional approximation to the posterior which can be evaluated without the need to use MCMC sampling.
Conversely, a key advantage of likelihood(-ratio) targeting methods is their ﬂexibility– learned likelihoods can e.g. be used to integrate information from multiple observations, or can be used without retraining if the prior is changed.
In addition, they can be applied with any activelearning scheme without requiring modiﬁcations of the loss-function.
We achieve this method by combining likelihood(-ratio) estimation with variationally learned inference networks using normalizing ﬂows (Rezende & Mohamed, 2015; Papamakarios et al., 2017;
Durkan et al., 2019a) and sampling importance resampling (SIR) (Rubin, 1988).
We name our approach Sequential Neural Variational Inference (SNVI).
We will show that our simulation-based inference methods are as accurate as SNLE and SNRE, while being substantially faster at inference as they do not require MCMC sampling.
In addition, real-world simulators sometimes produce invalid outputs, e.g. when a simulation fails.
We introduce a strategy that allows likelihood(-ratio) targeting methods (such as SNVI) to deal with such invalid simulation outputs.
A recent method termed “Sequential Neural Posterior and Likelihood Approximation” (SNPLA) also proposed to use variational inference (VI) instead of MCMC to speed up inference in likelihoodtargeting methods (Wiqvist et al., 2021).
While this proposal is related to our approach, their VI objective is based on the reverse Kullback Leibler (rKL) divergence for learning the posterior.
As we also show on benchmark tasks, this leads to mode-seeking behaviour which can limit its performance.
In contrast, we show how this limitation can be overcome through modifying the variational objective in combination with using SIR for adjusting posteriors.
After an introduction on neural network-based simulation-based inference (SBI) and variational inference (Sec. 2), we present our method, Sequential Neural Variational Inference (SNVI) (Sec. 3).
In Sec.
4.2, we empirically show that SNVI is signiﬁcantly faster than state-of-the-art SBI methods while achieving similar accuracy on benchmark tasks.
In Sec. 4.3, we demonstrate that SNVI is scalable, and that it is robust to invalid simulation outputs: We obtain the posterior distribution of a complex neuroscience model with one order of magnitude fewer simulations than previous methods.
B ACKGROUND 2. S IMULATION - BASED INFERENCE
Simulation-based inference (SBI) aims to perform Bayesian inference on statistical models for which the likelihood function is only implicitly deﬁned through a stochastic simulator.
Given a prior p ( θ ) and a simulator which implicitly deﬁnes the likelihood p ( x | θ ) , the goal is to identify the posterior distribution p ( θ | x o ) for an observation x o .
The simulator is considered to be ‘black-box’, i.e. one cannot evaluate p ( x | θ ) and does not have access to the internal states of the simulator, but only to its inputs θ and its outputs x .
We focus on improving likelihood-estimation (SNLE) and likelihood-ratio-estimation (SNRE) methods.
SNLE trains a deep neural density estimator (cid:96) ψ ( x | θ ) by minimizing the forward
Kullback-Leibler divergence (fKL) between (cid:96) ψ ( x | θ ) and p ( x | θ ) using samples ( x , θ ) ∼ ˜ p
( x , θ ) = p ( x | θ )˜ p
( θ ) from the simulator with L ( ψ ) =
− 1 N (cid:80) Ni =1 log (cid:96) ψ ( x i | θ i ) .
Here, (cid:96) ψ ( x | θ ) is a conditional density estimator learning the conditional density p ( x | θ ) from ( θ , x ) pairs, ψ are its learnable parameters, and
˜ p
( θ ) is the proposal distribution from which the parameters θ are drawn (given by e.g. a previous estimate of the posterior or by an active learning scheme, Papamakarios et al., 2019;
Lueckmann et al., 2019a).
Analogously, SNRE uses a discriminator, e.g. a deep logistic regression network, to estimate the density ratio r ( x , θ ) =
˜ p
( x , θ ) ˜ p ( x )˜ p
( θ ) =
p ( x | θ ) ˜ p ( x ) .
(Hermans et al., 2020; Durkan et al., 2020), If the proposal is given by the prior, then one can recover the exact posterior density, otherwise the posterior can be recovered up to a normalizing constant (Durkan et al., 2020).
Once the likelihood (or likelihood-ratio) has been learned, the posterior can be sampled with MCMC.
In sequential schemes, the proposal ˜ p is updated each round using the current estimate of the posterior – thus, computationally expensive
MCMC sampling needs to be run in each round.
2. V ARIATIONAL I NFERENCE
We use variational inference (VI) to estimate the posterior distribution.
VI formulates an optimization problem over a class of tractable distributions Q to ﬁnd parameters φ ∗ such that q φ ∗ ∈ Q is closest to the true posterior p ( θ | x o ) according to some divergence D (Blei et al., 2017).
Formally, φ ∗ = arg min φ
D ( q φ ( θ ) ||
p
( θ | x o )) with q φ ∗ ( θ )
=
p ( θ | x o )
⇐⇒ D ( q φ ∗ ( θ ) ||
p
( θ | x o ))
= 0 .
Recent work has introduced normalizing ﬂows as a variational family for VI (Ranganath et al., 2014;
Agrawal et al., 2020; Rezende &
Mohamed, 2015).
Normalizing ﬂows deﬁne a distribution q φ ( θ ) by learning a bijection T φ which transforms a simpler distribution into a complex distribution p ( θ | x o ) .
Normalizing ﬂows provide a highly ﬂexible variational family, while at the same time allowing low variance gradient estimation of an expectation by the reparameterization trick, i.e. ∇ φ E θ ∼ q φ [ f ( θ )]
=
E θ 0 ∼ q 0 [ ∇ φ f ( T φ ( θ 0 ))] with θ =
T φ ( θ 0 ) (Kingma & Welling, 2014; Rezende et al., 2014; Rezende & Mohamed, 2015).
S EQUENTIAL NEURAL VARIATIONAL INFERENCE (SNVI) 3. K EY INGREDIENTS
We propose a framework to use variational inference (VI) for simulation-based inference.
Our method consists of three parts: A learnable likelihood (or likelihood-ratio) model, a posterior model (typically parameterized as a normalizing ﬂow) to be learned with VI, and sampling importance resampling (SIR) (Rubin, 1988) to reﬁne the accuracy of the posterior (Fig. 1).
The likelihood(- ratio) model (cid:96) ψ ( x | θ ) learns to approximate the likelihood p ( x | θ ) or the likelihood-ratio p ( x | θ ) p ( x ) from pairs of parameters and simulation outputs ( θ , x ) .
We use the term SNLVI to refer to SNVI with likelihoods, and SNRVI with likelihood-ratios.
After a likelihood(-ratio) model has been trained, the posterior model q φ ( θ ) is trained with variational inference using normalizing ﬂows.
Finally, SIR is used to correct potential inaccuracies in the posterior q φ ( θ ) – as we will show below, the SIR step leads to empirical improvements at modest computational overhead.
To reﬁne the likelihood(-ratio) model and the posterior, the procedure can be repeated across several ‘rounds’.
We opt to sample the parameters θ from the previous posterior estimate q φ ( θ ) , but other strategies for active learning (e.g. Lueckmann et al., 2019b) could be plugged into SNVI.
The algorithm is summarized in Alg. 1.
We will now describe three variational objectives that can be used with SNVI, the SIR procedure to reﬁne the posterior, and a strategy for dealing with invalid simulation outputs.
3. V ARIATIONAL OBJECTIVES FOR SBI
Because of the expressiveness of normalizing ﬂows, the true posterior can likely be approximated well by a member of the variational family (Papamakarios et al., 2021).
Thus, the quality of the variational approximation is strongly linked to the ability to achieve the best possible approximation through optimization, which in turn depends on the choice of variational objective D .
Using the reverse Kullback-Leibler Divergence (rKL) as proposed by Wiqvist et al.
(2021) can give rise to mode-seeking behaviour and q φ might not cover all regions of the posterior (Bishop, 2006; Blei et al., 2017).
As a complementary approach, we suggest and evaluate three alternative variational objectives that induce a mass-covering behaviour and posit that this strategy will be particularly important in sequential schemes.
Forward KL divergence (fKL)
In contrast to the reverse KL (rKL),
the forward KullbackLeibler divergence (fKL) is mass-covering (Bishop, 2006).
Wan et al.
(2020) minimize the following upper bound to the evidence, which implicitly minimizes the fKL: L ( φ ) =
E θ ∼ q φ [ w ( θ ) log ( w ( θ ))] with w ( θ ) = p ( x o , θ )
/q
φ ( θ ) .
This expression is hard to estimate with samples: If q φ ( θ ) is different from p ( x o , θ ) then w ( θ ) ≈ 0 for most θ ∼ q φ ( θ ) , thus ∇ φ L ( φ ) ≈ 0 , which would prevent learning (see Appendix Sec. A.3).
To overcome this problem, we rewrite the fKL using self-normalized importance sampling (Jerfel et al., 2021).
Let θ 1 , . . .
, θ N ∼ π be samples from an arbitrary proposal distribution π .
We then minimize the loss:
[Equation]
where w ( θ ) = p ( x o , θ ) /π
( θ ) .
As a self-normalized importance sampling scheme, this estimate is biased, but the bias vanishes at rate O (1 /N )
(Hesterberg, 2003).
In our experiments, we use π = q φ , which provides a good proposal when q φ is close to p (Chatterjee & Diaconis, 2018).
Even though q φ will differ from p initially, sufﬁcient gradient information is available to drive q φ towards p , as we demonstrate in Appendix Sec.
A.3.
2. Importance weighted
ELBO The importance weighted ELBO (IW-ELBO) introduced by
Burda et al.
(2016) uses the importance-weighted gradient of the evidence lower bound (ELBO).
It minimizes the KL divergence between the self-normalized importance sampling distribution of q φ and the posterior and thus provides a good proposal for sampling importance resampling (Cremer et al., 2017; Domke & Sheldon, 2018;
Ranganath et al., 2014).
It can be formulated as
[Equation]
To avoid a low SNR of the gradient estimator (Rainforth et al., 2018), we use the ‘Sticking the
Landing‘ (STL) estimator introduced by Roeder et al.
R´enyi α -divergences R´enyi α -divergences are a divergence family with a hyperparameter α which allows to tune the mass-covering (or mode-seeking) behaviour of the algorithm.
For α → 1 , the divergence approaches the rKL.
For α < 1 , the divergence becomes more mass-covering, for α > 1 more mode-seeking.
We use α = 0 .
1 in our experiments.
A R´enyi variational bound was established by Li & Turner (2016) and is given by
[Equation]
For α = 0 , L α is a single sample Monte Carlo estimate of the IW-ELBO (when using K samples to estimate the expectation in L α ( φ ) ) and thus also suffers from a low SNR as α → 0 (Rainforth et al., 2018; Li & Turner, 2016).
Just as for the IW-ELBO, we alleviate this issue by combining the α -divergences with the STL estimator.
3. S AMPLING I MPORTANCE R ESAMPLING
After the variational posterior has been trained, q φ approximates (cid:96) ψ
( x o | θ ) p ( θ ) /Z
with normalization constant Z .
We propose to improve the quality of posterior samples by applying Sampling
Importance Resampling (SIR) (Rubin, 1988).
We sample K = 32 samples from θ ∼ q φ ( θ ) , compute the corresponding importance weights w i =
(cid:96) ψ
( x o | θ i ) p ( θ i ) /q
φ ( θ i ) and resample a single sample from a categorical distribution whose probabilities equal the normalized importance weights (details in Appendix Sec.
A.4).
This strategy enriches the variational family with minimal computational cost (Agrawal et al., 2020).
SIR is particularly useful when q φ ( θ ) covers the true posterior and is thus well-suited for the objectives described above (see Appendix Fig. 6).
3. E XCLUDING INVALID DATA
Simulators may produce unreasonable or undeﬁned values (e.g. NaN), as we will also see in the pyloric network model described later.
In posterior estimation methods (SNPE), one can simply remove these ‘invalid’ simulations from the training dataset, and the trained neural density estimator will still approximate the true posterior (Lueckmann et al., 2017).
However, as we show in Appendix
Sec.
A.6, this is not the case for likelihood(-ratio)-methods– when ‘invalid’ simulations are removed, the network will converge to (cid:96) ψ
( x o | θ ) ≈ 1 Z p ( x o | θ ) /p ( valid | θ ) , i.e. the learned likelihood-function will be biased towards parameter regions which often produce ‘invalid’ simulations.
This prohibits any method that estimates the likelihood(-ratio) (i.e. SNVI, SNLE, SNRE) from excluding ‘invalid’ simulations, and would therefore prohibit their use on models that produce such data.
To overcome this limitation of likelihood-targeting techniques, we propose to estimate the bias-term p ( valid | θ ) with an additional feedforward neural network c ζ ( θ )
≈ p ( valid | θ ) (details in Appendix
Sec. A.6).
Once trained, c ζ ( θ ) can be used to correct for the bias in the likelihood network.
Given the (biased) likelihood network (cid:96) ψ ( x o | θ ) and the correction factor c ζ ( θ ) , the posterior distribution is proportional to
[Equation]
We sample from this distribution with VI in combination with SIR.
Details, proof and extension to
SNRVI in Appendix Sec.
A.6.
The additional network c ζ ( θ ) is only required in models which can produce invalid simulations.
This is not the case for the toy models in Sec. 4.2, but it is required in the model in Sec. 4.3.
Alg.
1 shows SNVI without the additional bias-correction step, Appendix
Alg.
3 shows the method with correction.
E XPERIMENTS
We demonstrate the accuracy and the computational efﬁciency of SNVI on several examples.
First, we apply SNVI to an illustrative example to demonstrate its ability to capture complex posteriors without mode-collapse.
Second, we compare SNVI to alternative methods on several benchmark tasks.
Third, we demonstrate that SNVI can obtain the posterior distribution in models with many parameters by applying it to a neuroscience model of the pyloric network in the crab Cancer borealis .
[Figure]
4. I LLUSTRATIVE EXAMPLE : T WO MOONS
We use the ‘two moons’ simulator (Greenberg et al., 2019) to illustrate the ability of SNVI to capture complex posterior distributions.
The two moons simulator has two parameters with a uniform prior and generates a posterior that has both local and global structure.
Fig.
2A shows the ground truth posterior distribution as well as approximations learned by several methods using 10 5 simulations.
SNLE with MCMC (in the form of Slice Sampling with axis-aligned updates (Neal, 2003)) can recover the bimodality when running 100 chains in parallel (Lueckmann et al., 2021) (not shown: individual chains typically only explore a single mode).
SNPLA, which is based on the modeseeking rKL (and could thus also be considered as SNVI+rKL, see Appendix Sec.
A.7) captures only a single mode.
In contrast, SNLVI (using the fKL and SIR, denoted as SNVI+fKL) recovers both the local and the global structure of the posterior accurately.
In terms of runtime, SNPLA and
SNVI+fKL are up to twenty times faster than 100 chain MCMC in our implementation (Fig.
2B), and two to four orders of magnitude faster than single chain MCMC (single chain not shown, the relative speed-up for multi-chain MCMC is due to vectorization).
4. R ESULTS ON BENCHMARK PROBLEMS
We compare the accuracy and computational cost of SNVI to that of previous methods, using SBI benchmark tasks (Lueckmann et al., 2021):
Bernoulli GLM: Generalized linear model with Bernoulli observations.
Inference is performed on 10-dimensional sufﬁcient summary statistics of the originally 100 dimensional raw data.
The resulting posterior is 10-dimensional, unimodal,
and
concave
Lotka Volterra: A traditional model in
ecology (Wangersky, 1978)
, which describes
a
predator
- prey
interaction
between species, illustrating a task with complex likelihood and unimodal posterior.
Two moons: Same as described in the previous section.
SLCP:
A task introduced by Papamakarios et al.
with a simple likelihood and complex posterior.
The prior is uniform, the likelihood has Gaussian noise but is nonlinearly related to the parameters, resulting in a posterior with four symmetrical modes.
For each task, we perform inference for ten different runs, each with a different observation.
As performance metric, we used classiﬁer 2-sample tests (C2ST) (best is 0.5, worst is 1.0) (Friedman, 2004; Lopez-Paz & Oquab, 2017).
For each method, we perform inference given a total of 10 3 , 10 4 and 10 5 simulations, evenly distributed across ten rounds of simulation and training.
Details on the hyperparameters are provided in Appendix Sec.
A.8, details on results in Appendix Fig. 9, comparisons to the forward KL without self-normalized weights as well as to the IW-ELBO and the α -divergences without STL in Appendix Fig.
We show results for two reference methods, SNLE with MCMC sampling, and SNPLA, and compare them to three variants of SNLVI using the forward KL (SNVI+fKL), the importance-weighted
ELBO (SNVI+IW) as well as an alpha-divergence (SNVI+ α ).
We ﬁnd that all three SNVI-variants achieve performance comparable to MCMC across all four tasks (Fig.
3 A-D, left), and outperform SNPLA on the two tasks with multi-modal posteriors (Two moons and SLCP).
We ﬁnd that omitting the SIR-adjustment (dotted lines) leads to a small but consistent degradation in inference
[Figure]
performance for all SNVI-variants, but not for SNPLA with the rKL: When using the rKL, the approximate posterior q φ is generally narrower than the posterior and thus ill-suited for SIR (Appendix Fig. 6).
Qualitatively similar results were found when using likelihood-ratio approaches with the same hyperparameters, see Appendix Fig.
In terms of runtime, all three variants of SNLVI are substantially faster than SNLE on every task (bars in Fig.
3 on the right), in some cases by more than an order of magnitude.
When using likelihood-ratio estimation, MCMC with 100 chains can be as fast as SNRVI on tasks with few parameters (Appendix Fig. 10).
On tasks with many parameters, however, SNRVI is signiﬁcantly faster than SNRE (see e.g. Bernoulli GLM with 10 parameters).
4. I NFERENCE IN A NEUROSCIENCE MODEL OF THE PYLORIC NETWORK
Finally, we applied SNVI to a simulator of the pyloric network in the stomatogastric ganglion (STG) of the crab Cancer Borealis , a well-characterized circuit producing rhythmic activity.
The model consists of three model neurons (each with eight membrane conductances) with seven synapses ( parameters in total) and produces voltage traces that can be characterized with 15 established summary statistics (Prinz et al., 2003; 2004).
In this model, disparate parameter sets can produce similar activity, leading to a posterior distribution with broad marginals but narrow conditionals (Prinz et al., 2004; Gonc¸alves et al., 2020).
Previous work has used millions of simulations from prior samples and performed amortized inference with NPE (18 million simulations in Gonc¸alves et al.
(2020), 9 million in Deistler et al.
Sequential neural posterior estimation (SNPE) struggles on this problem due to leakage, whereas SNLE and SNRE with MCMC are inefﬁcient (Durkan et al., 2020).
Here, we apply SNVI to identify the posterior distribution given an extracellular recording of the stomatogastric motor neuron (Fig. 4A)
(Haddad & Marder, 2021; 2018).
We demonstrate that
SNVI can perform multi-round inference and obtains the posterior distribution with only 350, simulations – 25 times fewer than previous methods!
F
C    10 2 1010 2 10    10 2 1010 2
Time [h]
Posterior mean/
[Figure]
MAP
G
B A
D
E
PY
LP
AB/PD
PY
LP
AB/PD
AB/PD CaS
AB/PD CaT
AB
LP
PD
LP
AB/PD CaS
AB/PD CaT
AB
LP
PD
LP
SNVI+fKL
Empricial observation
SNLE
Prior
Posterior 1% 'valid' 94% 'valid'
Median ||x - x o ||
We ran SNVI with a likelihood-estimator with the fKL divergence (SNVI+fKL) and SIR.
Since the simulator produces many invalid summary statistics (e.g. gaps between bursts cannot be deﬁned if there are no bursts) we employed the strategy described in Sec. 3.4.
Because only 1% of the simulations from prior samples are valid (Fig.
4F), we used 50,000 simulations in the ﬁrst round and continued for 30 rounds with 10,000 simulations each.
The posterior is complex and reveals strong correlations and nonlinear relationships between parameters (Fig.
4B showing 4 out of 31 dimensions, full posterior in Appendix Fig. 12).
The conditional distributions p ( θ i,j | x , θ (cid:54) =
i,j ) given a posterior sample (Fig. 4C) are narrow, demonstrating that parameters have to be ﬁnely tuned to generate the summary statistics of the experimentally measured activity.
We used posterior predictive checks to inspect the quality of the posterior.
When simulating data from the posterior mean and posterior mode (MAP), we ﬁnd that both of them match the statistics of the experimental activity (Fig. 4D).
Similarly, samples from the posterior distribution closely match statistics of the experimental activity (Fig.
4E).
Out of 10,000 posterior samples,( ≈ 94%) generated activity with well-deﬁned summary statistics (compared to 1% of prior samples).
For the samples which generate well-deﬁned summary statistics, the (z-scored) median distance between the observed data x o and generated activity is smaller for posterior samples than for prior samples (Fig. 4F).
We emphasize that an application of SNLE with MCMC would be estimated to take an additional 400 hours, due to 30 rounds of slow MCMC sampling (Fig. 4G) that would be required– instead of 27 hours for SNVI.
Likewise, when running SNPE-C on this example, only one out of 2 million samples was within the prior bounds after the second round, requiring computationally expensive rejection sampling (Greenberg et al., 2019; Durkan et al., 2020).
Finally, we note that the additional neural network c ζ ( θ ) (required to correct for the effect of invalid simulations) can be learned robustly and with low computational cost (see Appendix Fig.
13 for runtime).
These results show that SNVI makes it possible to overcome the limitations of previous methods and allows sequential neural simulation-based inference methods to effectively and robustly scale to challenging inference problems of scientiﬁc interest.
While it is difﬁcult to rigorously evaluate the accuracy of the obtained posterior distribution due to a lack of ground truth, we observed that almost all posterior predictives have well-deﬁned summary statistics (94% vs 80% in Gonc¸alves et al.
and that the posterior predictives closely match x o .
D ISCUSSION
We introduced Sequential Neural Variational Inference (SNVI), an efﬁcient, ﬂexible, and robust approach to perform Bayesian inference in models with an intractable likelihood.
We achieve this by combining likelihood-estimation (or likelihood-ratio estimation) with variational inference, further improved by using SIR for reﬁning posteriors.
We demonstrate that SNVI reduces the computational cost of inference while maintaining accuracy.
We applied our approach to a neuroscience model of the pyloric network with 31 parameters and showed that it is 25 times more efﬁcient than previous methods.
Our results demonstrate that SNVI is a scalable and robust method for simulation-based inference, opening up new possibilities for Bayesian inference in models with intractable likelihoods.
We selected three variational objectives for SNVI which induce mass-covering behaviour and are, therefore, well suited as a proposal for sampling from complex posterior distributions.
We empirically evaluated all of these methods in terms of runtime and accuracy on four benchmark tasks.
We found that, while their performance differed when using the raw VI output, they all showed similar performance after an additional, computationally cheap, sampling importance resampling (SIR) step.
After the SIR step, all methods had similar accuracy as MCMC, and all methods outperformed a mode-seeking variational objective (reverse KL) which was used in a previously proposed method
Wiqvist et al.
Our results suggest that mass-covering VI objectives (regardless of their exact implementation) provide a means to perform fast and accurate inference in models with intractable likelihood, without loss of accuracy compared to MCMC.
In Appendix Sec.
A.2, we provide technical recommendations for choosing a variational objective for speciﬁc problems.
A common approach in sequential methods is to use the current posterior estimate as the proposal distribution for the next round, but more elaborate active-learning strategies for choosing new simulations are possible (Papamakarios & Murray, 2016;
Papamakarios et al., 2019; Lueckmann et al., 2019a).
SNVI can ﬂexibly be combined with any active learning scheme, and unlike neural likelihood(-ratio) methods, does not require expensive MCMC sampling for updating posterior estimates.
While this comes at the cost of having to train two neural networks (a likelihood-model and a posterior-model), the cost of training these neural networks is often negligible compared to the cost of simulations.
Another method that trains both a likelihood- and a posterior network is
Posterior-Aided Regularization (Kim et al., 2021), which regularizes the likelihood-estimate with a simultaneously trained posterior-estimate.
This improves the modelling of multimodal posteriors, but the method still requires MCMC and thus scales poorly with the number of samples and dimensions.
Likelihood-free variational inference (Tran et al., 2017) avoids learning a likelihood model by learning an implicit posterior distribution, but it requires an adversarial training objective which can be difﬁcult to optimize and requires extensive hyperparameter tuning (Husz´ar, 2017).
Ong et al.
(2018) is another method that performs variational inference with a synthetic likelihood, but their approach requires that the summary statistics are approximately Gaussian in order to obtain unbiased estimates of the log-likelihood.
Overall, SNVI combines the desirable properties of current methods: It can be combined with any active learning scheme, it can ﬂexibly combine information from multiple datapoints, it returns a posterior distribution that can be sampled quickly, and it can robustly deal with missing data.
SNVI speeds up inference relative to MCMC-based methods, sometimes by orders of magnitude, and can perform inference in large models with many parameters.
SNVI therefore has potential to provide a new ’go-to’ approach for simulation-based inference, and to open up new application domains for
simulation-based Bayesian inference.
R EPRODUCIBILITY STATEMENT
We used the conﬁguration manager hydra to track the conﬁguration and seeds of each run (Yadan, 2019).
The results shown in this paper can be reproduced with the git repository https: //github.com/mackelab/snvi_repo .
The algorithms developed in this work are also available in the sbi toolbox (Tejero-Cantero et al., 2020).
All simulations and runs were performed on a high-performance computer.
For each run, we used 16 CPU cores (Intel family 6, model 61) and 8GB RAM.
A CKNOWLEDGEMENTS
We thank Jan-Matthis Lueckmann for insightful comments on the manuscript.
This work was funded by the German Research Foundation (DFG; Germany’s Excellence Strategy MLCoE – EXC number 2064/1 PN 390727645) and the German Federal Ministry of Education and Research (BMBF;
T¨ubingen AI Center, FKZ: 01IS18039A).
E THICS STATEMENT
We used data recorded from animal experiments in the crab Cancer borealis .
The data we used were recorded for a different, independent study and have recently been made publicly available (Haddad & Marder, 2018; 2021).
While simulation-based inference has the potential to greatly accelerate scientiﬁc discovery across a broad range of disciplines, one could also imagine undesired use-cases of SBI.
A A PPENDIX A. G RADIENTS OF THE DIVERGENCES
For completeness, we provide the gradients of the divergences introduced in Sec. 3.2.
Forward Kullback-Leibler divergence
The gradient estimate is given by
[Equation]
Importance-weighted ELBO A gradient estimator is given by
[Equation]
where w ( θ ) = p ( x o , θ ) /q
φ ( θ ) .
R´enyi
α -divergence
A biased gradient estimator using the reparameterization trick can be written as:
[Equation]
where w ( θ ) = p ( x o , θ ) /q
φ ( θ ) .
This gradient estimator is biased towards the rKL but the bias vanishes as more samples are used for the Monte Carlo approximation (Li & Turner, 2016).
A. C HOICE OF DIVERGENCE
In Fig.
4.2, we demonstrated that all mass-covering objectives perform similarly in terms of accuracy and runtime on the problems we considered.
We here give technical recommendations for choosing a variational objective:
(i) Closed-form posterior: The variational posterior provides a closed-form approximation to the posterior, but this is no longer the case when SIR is used.
While, in our results, all three approaches performed similarly with SIR, they can differ in their performance without it , and the forward KL and the α -divergence provided better approximations than the IWELBO.
Thus, if one seeks a posterior density that can be evaluated in closed-form, our results suggest to use the forward KL or the α -divergence.
(ii) Dimensionality of the parameter space : We use an autoregressive normalizing ﬂow as variational family.
These ﬂows are very expressive, yet the computation time of their forward or backward passes scale with the dimensionality of θ (Papamakarios et al., 2017; Kingma et al., 2016; Durkan et al., 2019a).
The IW-ELBO and the α -divergences only require forward passes, whereas the forward KL requires forward and backward passes, thus making the forward KL expensive for high-dimensional parameter spaces.
The STL estimator used in the IW-ELBO and the α -divergences also requires forward and backward passes.
We found that the STL estimator improves performance of the IW-ELBO only weakly (Fig. 11).
Thus, in cases where computational cost is critical, our results suggest that using the IW-ELBO without the STL can give high accuracy at low computational cost.
Another way to reduce computational cost is to use alternative architectures for the normalizing ﬂow, e.g. coupling layers (Durkan et al., 2019a; Papamakarios et al., 2021).
(iii) Trading-off the mass-covering property with computational cost : For α -divergences, one can trade-off the extent to which the divergence is mass-covering by choosing the value of α (low α is more mass-covering).
As shown in Fig.
11, high values of α beneﬁt less from using the STL estimator.
Thus, in cases where mass-covering behavior of the algorithm is less crucial, the STL estimator can be
[Figure]
A. O VERCOMING VANISHING GRADIENTS IN THE FORWARD KL ESTIMATOR
We use an estimator of the forward Kullback-Leibler divergence (fKL) that is based on selfnormalized importance sampling.
In this section, we demonstrate that this estimator moves the variational distribution q φ ( θ ) towards the target density p ( x o , θ ) even if q φ ( θ ) and p ( x o , θ ) differ strongly.
For this analysis, we consider a Gaussian toy example with prior p ( θ ) =
N ( θ ; 0 , 4) , likelihood p ( x | θ ) =
N ( x ; θ , 1) , and observation x o = 1 .
The posterior distribution can be computed in closed-form as p ( θ | x o )
=
N ( θ ; 4 / 5 , 4 / 5) .
We aim to learn the posterior distribution using variational inference with the variational family q µ ( θ ) =
N ( µ, 4 / 5) (note that µ is the only parameter).
The best approximation within this family is µ ∗ = 4 / 5 .
We use this toy example to compare the gradient and the signal-to-noise ratio (SNR) of the selfnormalized fKL estimator to the fKL estimator introduced by Wan et al.
Fig.
5A (left) shows the gradient of the loss for different values of µ .
When µ ≈ µ ∗ = 4 / 5 , the fKL (gray) without self-normalization closely matches the true gradient (red).
However, as µ is further from µ ∗ , the fKL ﬁrst points in the wrong direction and then vanishes, which prevents learning.
The self-normalized fKL (blue, orange, green) closely matches the gradient around µ ≈ µ ∗ = 4 / 5 and does not vanish for µ that are far from µ ∗ .
The gradient is stronger if more samples N are used to approximate the fKL.
Similarly, the SNR ( ∇ φ L ( φ ))
=
| E [ ∇ φ L ( φ )] /
(cid:112) Var ( ∇ φ L ( φ )) | does not vanish for µ that are far from µ ∗ for the self-normalized fKL.
To understand this behaviour of the self-normalized fKL, we computed an approximation to the gradient ∇ µ L fKL ( µ ) in this toy example.
The fKL loss is given as:
[Equation]
with weights w ( θ i ) =
p ( x o , θ ) q φ ( θ ) .
In the case where q φ ( θ ) differs strongly from p ( x o , θ ) , the weights are often degenerate, i.e. the strongest weight is much larger than all others.
In the worst case, ˜ w ( θ i ) =
[Equation]
i
[Equation]
= 1 for some i and the gradient estimator reduces to
[Equation]
The gradient of µ is thus determined by r = arg max θ 1 ,..., θ N w ( θ ) , which itself can be considered a draw from a random variable R .
We will now derive the probability density p R ( r ) of R .
Algorithm
1 Input : K the number of importance samples, proposal q φ , joint density p ( x o , θ ) =
(cid:96) ψ
( x o | θ ) p ( θ ) 2 for i ∈
[1 , ..., K ] do θ
i ∼ q φ ( θ ) w i = p ( x o , θ i )
q φ ( θ i ) 5 end
Each ˜ w i = w i / (cid:80)
Kk
=1 w k 7 j ∼ Categorical
( ˜ w )
8 return θ j
If µ > µ ∗ , then w ( θ ) is monotonically decreasing in θ because w ( θ ) ∝ N ( θ ; µ ∗ , 4 / 5) N ( θ ; µ, 4 / 5) ∝ exp(5 / 4 · θ ( µ ∗ − µ )) .
The cumulative distribution function F R ( R ≤ r ) can then be written as
[Equation]
Thus, R has the density p R ( r )
=
ddr F ( R ≤ r ) =
N (1 − F q φ ( r ))
N − 1 q µ ( r ) .
The derivation is analogous for the case µ < µ ∗ .
Because ∇ µ L fKL ( µ ) = ∇ µ log q µ ( r ) for r ∼ p R , this allows us to compute the distribution of the gradient of µ (under the assumption that weights are degenerate).
We empirically validate this result on the Gaussian toy example.
Fig.
5B (left) shows the true posterior distribution (black), the variational density q µ ( θ ) for µ = 6 and µ = 10 and the corresponding p R ( r ) for N = 1000 .
The theoretically computed density p R ( r ) (dashed lines) matches the empirically observed distribution of arg max θ i =1 ...N w ( θ i ) .
For almost every value of r ∼ p R ( r ) , the gradient ∇ µ log q µ ( r ) is negative, thus driving ∇ µ L fKL ( µ ) into the correct direction.
For larger N , the distribution p R ( r ) shifts towards the true posterior distribution and thus also the gradient signal increases.
Notably, for µ that are even further from µ ∗ , ∇ µ log q µ ( r ) remains relatively constant (Fig.
5B, right).
This explains why the gradient ∇ µ L fKL ( µ ) becomes constant in Fig.
5A (left).
A. I MPROVEMENT THROUGH SIR
We use Sampling Importance Resampling (SIR) to reﬁne samples obtained from the variational posterior.
The SIR procedure is detailed in Alg. 2 for drawing a single sample from the posterior.
Consistent with Agrawal et al.
, we found that using SIR always helps to improve the approximation quality even when using complex variational families such as normalizing ﬂows (compare dotted and solid lines in Fig. 3).
We visualize the beneﬁts of SIR in Fig.
6 on an example which uses a Gaussian proposal distribution (i.e. variational family).
SIR enhances the variational family and allows to approximate the bimodal target distribution.
SIR particularly improves the posterior estimate when the proposal (i.e. the variational posterior) is overdispersed.
This provides an explanation for why SIR is particularly useful for the mass-covering divergences used in SNVI, and less so for mode-covering divergences (as used in SNPLA).
A. Q UALITY OF THE LIKELIHOOD ESTIMATOR
The estimated variational posterior is based on the estimated likelihood (cid:96) ( x o | θ ) .
It is thus important to accurately learn the likelihood from simulations.
To be able to learn skewed or bimodal likelihoods, we use a conditional autoregressive normalizing ﬂow for (cid:96) ( x | θ ) (Papamakarios et al., 2017;
Kingma et al., 2016; Durkan et al., 2019a).
Fig.
7 demonstrates that these ﬂows can learn complex likelihoods (Papamakarios et al., 2019).
[Figure]
A. P ROOFS FOR EXCLUDING INVALID DATA
Many simulators can produce unreasonable or undeﬁned values when fed with parameters sampled from the prior (Lueckmann et al., 2017).
These invalid simulations are not useful for accurately learning the likelihood, and we would like to ignore them.
To do so, we developed a loss-reweighing strategy.
do
// sample θ or cross entropy binary calibration kernel
We formulate the exclusion of invalid simulations by the means of a calibration kernel K ( x , x o ) (originally introduced for neural posterior estimation in Lueckmann et al.
This calibration kernel can be any function, and can thus be used beyond excluding invalid data.
The case of excluding invalid simulations can be recovered by using a binary calibration kernel:
[Equation]
Alg.
3 shows SNVI with calibration kernel.
Notice that, in the case of a binary calibration kernel, the loss for the likelihood (cid:96) ψ ;
[Equation]
is zero for all invalid simulations (because K ( x , x o ) = 0 ).
Thus, since these simulations do not contribute to the loss, we exclude these simulations from the dataset that is used to train the likelihood(-ratio) model.
Below, we provide proofs of convergence for Alg. 3.
Theorem 1 and Lemma 1 are relevant to SNLVI,
Theorem 2 and Lemma 2 are relevant to SNRVI, and Lemma 3 is relevant to both methods.
Theorem 1 and Theorem 2 provide a means to use a calibration kernel in the training of the likelihood(- ratio)-model such that one can still recover the posterior density.
In SNVI, we sample from the (unnormalized) potential function with variational inference.
However, one can also use Theoremand Theorem 2 in combination with SNLE and SNRE and draw samples from the potential function with MCMC.
Both SNLVI and SNRVI with calibration kernels rely on the estimation of E x ∼ p
( x | θ ) [ K ( x , x o )] (note that this turns into p ( valid | θ ) for the binary calibration kernel).
We estimate this term with a feed-forward regression neural network c ζ ( θ ) (see Lemma 3).
The network is trained on pairs ( θ , K ( x , x o )) , where θ and x are the same pairs as used for training the likelihood(-ratio)-model.
For general calibration kernels K ( x , x o ) , we use a mean-squared error loss, whereas in the case of invalid data, we parameterize c ζ ( θ ) as a logistic regression network and train it with a cross-entropy loss (since the calibration kernel K ( x , x o ) is a binary function: 0 for invalid data, 1 for valid data).
Theorem 1.
Let K : X × X
→ R + be a kernel.
Let (cid:96) ψ ∗ ( x | θ ) be the maximizer of the objective
L = E θ , x
[Equation]
θ
[Equation] [Equation]
[Equation] [Equation]
and let c ζ ∗ ( θ ) be the minimizer of
[Equation]
Then the potential function
[Equation]
is proportional to the posterior density p
( θ | x o ) .
Proof.
Using Lemma 1 and Lemma 3, we get
[Equation]
Theorem 2.
Let K : X × X
→ R + be a kernel.
Let (cid:96) ψ ∗ ( x , θ ) be the minimizer of the objective
L = E θ , x ∼ ˜
[Equation]
θ , x ) [ K ( x , x o ) log
[Equation]
ψ ∗
[Equation]
log
[Equation]
ψ ∗ ( x
[Equation]
θ ))] and let c ζ ∗ ( θ ) be the minimizer of
[Equation]
Then the potential function
[Equation]
is proportional to the posterior density p
( θ | x o ) .
Proof.
Using Lemma 2 and Lemma 3, we get
[Equation]
Lemma 1.
Let K : X × X
→ R + be an arbitrary kernel.
Then, the objective
L = E θ , x ∼ ˜ p
( θ , x ) [ K ( x , x o ) log( (cid:96) ψ
( x | θ ))] is maximized if and only if (cid:96) ψ ( x | θ )
= 1 Z ( θ ) K ( x , x o ) p ( x | θ ) for all θ ∈ support (˜ p ( θ )) , with normalizing constant Z ( θ ) =
(cid:82) K ( x , x o ) p ( x | θ )
d x = E x ∼ p ( x | θ )
[ K ( x , x o )] .
Proof.
[Equation]
Since (cid:82) K ( x , x o ) p ( x | θ )
[Equation]
ψ
[Equation]
− D
[Equation]
θ
[Equation] [Equation]
ψ ( x | θ )) , this term is maximized if and only if (cid:96) ψ ( x | θ )
= 1 Z ( θ ) K ( x , x o ) p ( x | θ ) for all θ ∈ support (˜ p ( θ )) with Z ( θ ) =
(cid:82)
K ( x , x o ) p ( x | θ ) d x = E x ∼ p ( x | θ )
[ K ( x , x o )] .
Lemma 2.
Let K : X × X
→ R + be an arbitrary kernel.
Then, the objective
[Equation]
] is minimized if and only if (cid:96) ψ ( x , θ ) =
E x ∼ p ( x ) [ K ( x , x o )]
E x ∼ p ( x | θ ) [ K ( x , x o )] p ( x | θ ) p ( x ) for all θ ∈ support (˜ p ( θ )) .
Proof.
We begin by rearranging the expectations:
[Equation]
where we introduced
[Equation]
Since binary classiﬁcation recovers density ratios (Cranmer et al., 2015; Mohamed & Lakshminarayanan, 2016; Gutmann et al., 2018)
[Equation]
we get
[Equation]
Lemma 3.
The objective
L = E θ , x ∼ ˜ p
[Equation]
, x
[Equation] [Equation]
c ζ
[Equation]
x , x o )) 2 ] is minimized if and only if c ζ ( θ ) =
E x ∼ p ( x | θ )
[ K ( x , x o ))] for all θ ∈ support (˜ p ( θ )) .
Proof.
[Equation]
which is minimized if and only if c ζ ( θ )
=
E x ∼ p ( x | θ )
[ K ( x , x o ))]) for all θ ∈ support (˜ p ( θ )) .
A. SNPLA
In Fig.
2 and Fig.
3, we compared SNVI to SNPLA (Wiqvist et al., 2021).
To ensure comparability between SNPLA and SNVI, we implemented SNPLA ourselves and used the same likelihood- and posterior-model for both methods.
The main difference between our implementation and the original implementation of SNPLA are:
We do not use the proposal ˆ p r ( θ )
=
αp ( θ ) + (1 − α ) q φ ( θ ) for α ∈ [0 , 1] , instead we use α = 0 ,
i
e. we use the current posterior estimate as proposal.
Secondly, we use a Rational Linear Spline Flow (RSF) based on pyro (Bingham et al., 2019), whereas Wiqvist et al.
(2021) uses a Masked Autoregressive Flow based on nﬂows (Durkan et al., 2019b).
Fig.
8 compares the performance of our SNPLA implementation to the original implementation.
Our implementation performs slightly better, likely due to the use of more expressive normalizing ﬂows.
We used our implementation for all experiments and nonetheless refer to the method with the name ‘SNPLA’.
A. E XPERIMENTS : B ENCHMARK
All tasks were taken from an sbi benchmark (Lueckmann et al., 2021).
For a description of the simulators, summary statistics, and prior distributions, we refer the reader to that paper.
We use the SNLE and SNRE as implemented in the sbi package (Tejero-Cantero et al., 2020).
In all experiments, we learn the likelihood with a Masked Autoregressive Flow (MAF) with ﬁve autoregressive layers each with two hidden layers and 50 hidden units (Tejero-Cantero et al., 2020;
Durkan et al., 2019b).
For SNRE we use a two block residual network with 50 hidden units.
Just as in Lueckmann et al. (2021), we implement SNRE with the loss described in Durkan et al.
The implementation of the posterior normalizing ﬂows is based on pyro (Bingham et al., 2019), as pyro caches intermediate values during sampling and thus allow cheap density evaluation on obtained samples.
We use MAFs for higher dimensional problems and Rational Linear Spline Flows (RSF) for low dimensional but complex problems (SLCP, Two moons).
We always use a standard
Gaussian base distribtuion and ﬁve autoregressive layers with a hidden size depending on input dimension ([dim · 10 , dim · 10 ] for spline autoregressive nets and [ dim · 5+5] for afﬁne autoregressive nets, each with ReLU activations).
As the posterior support must match that of the prior, we add a bijective mapping that maps the support to that of the prior.
This allows to train the normalizing ﬂows directly on the constrained domain.
We used a total sampling budget of N = 256 for any VI loss.
To estimate the IW-ELBO we use
N = 32 to estimate L ( K =8) IW ( φ ) (Rainforth et al., 2018).
Additionally, we use the STL estimator (Roeder et al., 2017).
An alternatively would be the doubly reparameterized gradient estimator, which is unbiased.
We choose the STL estimator as it admits larger SNRs at the cost of introducing some bias (Tucker et al., 2018).
Because for α → 0 we have that L α → L ( K =1) IW we use this
[Figure]
estimator also to estimate L α =0 .
1 ( φ ) .
While the estimator can also be used for the ELBO, it requires additional computational cost i.e. we additionally need to calculate the inverse transformation, which is costly for autoregressive ﬂows.
Note that the fKL estimator also requires the inverse transform, thus we recommend to use a normalizing ﬂow with fast forward and inverse passes in problems with many parameters, e.g. normalizing ﬂows based on coupling layers (Dinh et al., 2017; Durkan et al., 2019a).
We trained for 10 rounds of simulations.
In each round, we initialize the likelihood- and the posterior-model as their respective last estimates from the previous round.
We train the posterior model for each round for at least 100 iterations and at most 1000 iterations.
We evaluate convergence by tracking the decrease within the loss.
For this automated benchmark, the convergence criteria are chosen conservative too avoid early stopping.
More elaborate convergence criteria may improve runtime.
As metrics, we used classiﬁer 2-sample tests (C2ST).
C2ST trains a classiﬁer to distinguish posterior samples produced by a speciﬁc method to ground truth posterior samples.
Thus, a value of 0. means that the distributions are identical, whereas higher values indicate a mismatch between the distributions.
As in Lueckmann et al.
(2021), we computed the C2ST using 10,000 samples.
Each ﬁgure shows the average metric value over 10 different observations, as well as the corresponding 95% conﬁdence interval.
[Figure]
Fig.
11 shows results for further variational objectives on the two moons (top) and on the SLCP task (bottom).
The self-normalization used for the forward KL estimator improves the approximation quality (11, left, dark vs light purple).
For the IW-ELBO (middle) as well as for the α -divergences (right), the STL estimator improves performance (Rainforth et al., 2018).
The gains from the STL are stronger for α -divergences as for the IW-ELBO (especially when using SIR).
The STL particularly improves the estimate for low values of alpha (which are more support-covering).
A. E XPERIMENTS : I NFERENCE IN A NEUROSCIENCE MODEL OF THE PYLORIC NETWORK
We used the same simulator as in Gonc¸alves et al.
; Deistler et al.
and the 15 summary statistics originally described in Prinz et al.
and also used in Gonc¸alves et al.
; Deistler et al.
(notably, Gonc¸alves et al.
; Deistler et al.
(2021) used 3 additional features).
Below, we describe the simulator brieﬂy, for a full description we refer the reader to Prinz et al.
(2004); Gonc¸alves et al.
; Deistler et al.
The model is composed of three single-compartment neurons, AB/PD, LP, and PY, where the electrically coupled AB and PD neurons are modeled as a single neuron.
Each of the model neurons contains 8 currents.
In addition, the model contains 7 synapses.
As in Prinz et al.
, these synapses are simulated using a standard model of synaptic dynamics (Abbott & Marder, 1998).
For each set of membrane and synaptic conductances, we numerically simulate the circuit forseconds with a step size of 0 .
025 ms.
At each time step, each neuron receives Gaussian noise with mean zero and standard deviation 0 .
001 mV · ms − 0 . 5 .
We applied SNVI to infer the posterior over 24 membrane parameters and 7 synaptic parameters, i.e. 31 parameters in total.
The 7 synaptic parameters are the maximal conductances of all synapses in the circuit, each of which is varied uniformly in logarithmic domain and the membrane parameters
[Figure]
are the maximal membrane conductances for each neuron.
All membrane and synaptic conductances are varied over the same range as in Gonc¸alves et al.
; Deistler et al.
The 15 summary features proposed by Prinz et al.
(2004) are salient features of the pyloric rhythm:
Cycle period (s), three burst durations (s), two gap durations between bursts, two phase delays, three duty cycles, two phase gaps, and two phases of burst onsets.
Note that several of these values are only deﬁned if each neuron produces rhythmic bursting behavior.
In particular we call any simulations invalid if at least one of the summary features is undeﬁned.
The experimental data is taken from ﬁle 845 082 0044 in a publicly available dataset (Haddad &
Marder, 2021).
For the likelihood-model, we use a Neural Spline Flow (NSF) with ﬁve autoregressive layers.
Each layer has two hidden layers and 50 hidden neurons, as implemented in the sbi package (TejeroCantero et al., 2020; Durkan et al., 2019b).
The posterior-model is a Masked autoregressive ﬂow (MAF) with ﬁve autoregressive layers each with one hidden layer and 160 hidden units.
We train a total of 31 rounds.
In the ﬁrst round we use 50000 simulations from which only 492 are valid, and thus used to estimate the likelihood.
For all other rounds we each simulated 10000 samples.
To account for invalid summary features, we use the calibration kernel K ( x , x o )
=
I ( x is valid ) , hence can simply exclude any invalid simulations from training the likelihood-model.
By Theorem 1 we have to correct the likelihood by multiplication of E x ∼ p ( x | θ )
[ I ( x is valid )]
= P ( x is valid | θ ) .
To estimate this probability we use a deep logistic regression net with 3 hidden layers each with 50 neurons and ReLU activations.
We train this classiﬁer simultaneously with the likelihood-model, that is in each round we add new data { ( θ i , I ( θ i is valid )) }
Ni =1 and retrain the classiﬁer using the weighted binary-cross-entropy loss.
We weight the loss by the estimated class probabilities to account for class imbalance especially in early rounds.
We ﬁx the number of epochs to 200 per round.
We use the fKL loss with N =samples, as well as SIR.
In total the procedure took 27 hours with the runs of the simulator being parallelized across several nodes.
Because of this, the runtime also depends greatly on availability of computing resources on the cluster.
[Figure]