- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes ABC-D^2, which modifies the adaptive SMC-ABC sampler by replacing its random-walk mutation with a truncated, preconditioned MALA proposal. The drift is the gradient of a surrogate objective, the expected log Gaussian ABC kernel . It is estimated unbiasedly from a single simulated dataset using the stochastic automatic differentiation of Arya et al. (2022), so simulators with discrete randomness can be handled without continuous relaxations, such as Gumbel relaxation. To keep the MH correction exact, all drift randomness within a sweep is seeded from a hash of , which makes the drift a deterministic function of . Acceptance uses the standard hard-indicator ABC criterion on fresh datasets.
Critical strengths
-
A clean, correct and practical idea addressing a real gap. Gradient-informed proposals have been largely unavailable for simulators with discrete randomness, which are common in ABC application areas. The method changes only the proposal mean within an established sampler, so its validity rests on standard MH and SMC arguments. The per-sweep deterministic seeding is a simple way to use a noisy gradient while keeping the MH ratio exact. The paper is very clearly written and the method would be easy to adopt in practice.
-
The authors give a very clear set of experiments. The experiments cover as reasonable range of models and provide clear evidence of the advantages of using a gradient-based proposal over a zeroth-order proposal.
Critical weaknesses
-
The fact that a Langevin proposal outperforms a random walk is not surprising. Optimal-scaling theory for smooth targets shows MALA’s proposal variance can shrink as rather than for the random walk, so the gap widens with dimension (Roberts & Rosenthal, 1998; Roberts et al., 1997). Theorem 1 formalises the same intuition for a single proposal. Showing that ABC-D$^2$ beats random-walk SMC-ABC therefore confirms a well-understood effect rather than establishing a new contribution.
-
On the experiments, I think there's an issue with the tuning in RWM. The authors use , and one MH move per sweep. The scaling comes from importance-sampling perturbation kernels in ABC-PMC (Beaumont et al., 2009). As an MH random walk in –, it is far larger than optimal-scaling theory would suggest. Under a Gaussian approximation to the current target, its acceptance rate is roughly : about 2.5% at , 1.4% at and 0.6% at . This is before accounting for pseudo-marginal noise from . The size of the reported advantage may therefore be due to an untuned random walk proposal.
-
Given that the range of the experiments is quite limited, more could have been done with the tools that the authors had available to them. For example, alternative gradient estimators in the same drift. These include finite differences with common random numbers (Meeds et al., 2015), score-function estimators and Gumbel-softmax relaxations. The paper argues against them but never tests them. Also, stronger gradient-free SMC-ABC kernels could have been considered, such as adaptively scaled random walks, multiple MH moves per sweep at matched cost (Drovandi & Pettitt, 2011), or locally adaptive kernels (Filippi et al., 2013).
-
The benchmarks are also quite limited in scope. They are low-dimensional (), and the gains are already diminishing at , even though they have tractable likelihoods. Each contains a single layer of Bernoulli or binomial randomness and none represents the motivating class (Gillespie-type kinetics, stochastic epidemics, coalescents). In those classes, discrete outcomes drive control flow, and the variance of stochastic-AD perturbations is the important question.
-
The methodological and theoretical contributions are modest, and the work is not situated relative to pseudo-marginal methods. The method composes existing well-known components. Proposition 1 follows directly from the fact that MH with any deterministic state-dependent proposal is reversible.
-
Theorem 1 is correct, but its relevance to sampler efficiency is limited. It concerns the surrogate at the proposal, not acceptance, jump distance or posterior accuracy. It holds as with a remainder growing like , whereas the experiments use . At the truncation is likely active, reducing the drift to a fixed-length step along the preconditioned gradient direction. Its leading term is independent of estimator variance, so it does not distinguish stochastic AD from a high-variance score-function estimator.
Questions for authors
-
Can you rerun the random-walk baseline with proper scaling, for example adapted per sweep to a target acceptance rate, or ? Please tune ABC-D$^2$ similarly, noting that MALA’s optimal scaling is . Please also compare at matched simulator cost, including a random walk with several MH moves per sweep. A plot of error against total simulator calls would be more informative than the particle ratios in Figure 2.
-
How is a "simulator call" counted for the drift? Is a stochastic-AD evaluation with perturbations counted as calls? Please also report wall-clock times including stochastic-AD overhead, since the motivation is expensive simulators.
-
How often is the truncation active in practice? If it is active in most moves, Theorem 1’s untruncated leading term does not describe the regime actually run.
2 comments
W4. Scope of the benchmarks. We added an event-driven Gillespie birth-death simulator with = 3, 10, 15 and 20 (Sec. 3.3, Algorithm 2), in which discrete reaction draws drive the control flow and the likelihood of the summaries is intractable. ABC- needs 1.17, 1.15, 2.07 and 2.31× fewer simulator calls than the random walk, with 95% intervals above one. On the SIR model, the gains now grow with dimension, from 2.7× fewer calls at to 7.6× at .
W5. Contributions and pseudo-marginal methods. We agree that Proposition 1 rests on the standard result that MH with a proposal density evaluable in both directions is reversible, and the proof says so. Its role is to show how a noisy drift becomes such a proposal: the average is fixed before the moves of each sweep, which make no new gradient estimates. It also covers early rejection. We now discuss the method relative to pseudo-marginal MCMC: an ABC MH step is a pseudo-marginal step (Andrieu & Roberts, 2009), and estimated gradients have been used in exact pseudo-marginal chains (Dahlin et al., 2015; Nemeth et al., 2016). The new theory is Proposition 2 and Corollary 1, on how averaging across particles treats unbiased and biased estimators, and how that affects Theorem 1.
W6. Relevance of Theorem 1. Theorem 1 is a local statement about the expected objective at the proposal. App. A.1 now treats the cap as it is used, growing with the step, : the leading term becomes the inner product of the gradient with the expected capped drift, which stays non-negative for an unbiased drift with symmetric noise however often the cap is active, and the drift, an average of up to estimates, is close to symmetric. Variance enters at the next order: for a concave quadratic objective with Hessian , it lowers the gain by , with the covariance of the drift estimate. This is where stochastic AD and a high-variance score-function estimator differ, and where averaging helps (Prop. 2, Cor. 1).
Q1. Proper scaling and matched cost. See W2. Figure 2 now compares the total simulator calls, and CPU time, needed to reach a common tolerance, with at those settings, in place of the particle ratios. We can add plots of against total calls for every confirmed setting to the appendix.
Q2. Counting calls and wall-clock time. Each alternative outcome evaluated by stochastic AD is counted as a whole simulation (on the Gillespie model, as one cell's share of a dataset), in addition to one call for the primal dataset of every estimate (App. C.3), so the counts are upper bounds. We now report CPU time on one thread, including the overhead of stochastic AD and of the averaging: speed-ups of 0.87–5.1 on the SIR model, 0.79–1.3 on the GLM and 1.28–2.64 on the Gillespie model.
Q3. How often the truncation is active. It depends on the model (App. C.2). At the settings of Figure 2, the cap is active for 0.1–24% of proposals on the GLM and 1–99% on the SIR model (89–99% in six of nine settings, 97–100% in the second half of the sweeps). On the Gillespie model, for 97–98% with , 15% with and 53% with . So, as the reviewer suspected, the untruncated leading term does not describe most SIR moves, on which only the direction of the averaged gradient enters the proposal; App. A.1 gives the capped version (W6).
We hope these answers and the revision address your concerns. If so, we would be grateful if you would reconsider your score.
We thank the reviewer for the detailed review. It led to the largest changes in the revision: tuned baselines with optimal-scaling step sizes, alternative estimators in the same drift, stronger gradient-free kernels and an event-driven simulator (general response, G1–G6). We reply in two parts.
W1. A Langevin proposal beating a random walk is expected. We agree that with exact gradients of a smooth target this is classical, and both samplers now use their optimal-scaling step sizes, so the gain does not come from an untuned walk. Our contribution is to make such gradients available, and useful, for simulators with discrete randomness, where pathwise gradients do not exist and stochastic AD gives only unbiased but noisy estimates of the gradient of an ABC objective, a case the classical results do not cover. The new Proposition 2 and Corollary 1 show that averaging these estimates across particles reduces their noise and keeps the gain of Theorem 1, provided the gradient dominates the shrinkage and curvature bias of the average, whereas averaging a biased estimator keeps its bias; App. B.1 confirms this numerically.
W2. Random-walk tuning. We agree that c=2 with one move per sweep was too large a step for a Metropolis random walk in these dimensions. Both samplers now use the step sizes the reviewer suggests, c=2.382/d for the random walk and c=1.652d−1/3 for ABC-D2. The number of moves per sweep is tuned for both (up to 96 for the random walk), and both use early rejection (G1, Sec. 3.1, App. C.2). Against this tuned walk, ABC-D2 reaches a common tolerance with up to 20×, 6.1× and 2.3× fewer simulator calls on the SIR, GLM and Gillespie models (Figs. 2 and 3).
W3. Alternative estimators and stronger kernels.
(continued in part 2)