- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper addresses the filtering problem based on ensemble score filtering framework. For score-based filtering methods, evaluation of conditional score for intermediate reverse samples is necessary for guiding the sample generation in the update step. The authors have proposed a method to evaluate the conditional mean , which is necessary to obtain the score function using conditional Tweedie identity. To compute the conditional mean in a robust way, they propose to use sample approximation: conditional mean is computed as the weighted average of the proposal ensemble particles. The proposal particles are moved to well-sample the region of interest, i.e., near reverse particles. Experiments show assimilation performance comparable to other training-free filtering approaches such as LETKF and IEnSF.
Critical strengths
- The use of ensembles to estimate the score function seems sound.
Critical weaknesses
- The main framework of the score-based filtering is already established in the ensemble score filter. So the contribution is in the new conditional score estimation method based on an ensemble. The idea of taking samples to robustly compute some quantity is fairly straightforward and seems incremental to me.
- The use of multiple samples for evaluating score is precedented by Binder et al. 2026. Although it is concisely discussed at the final four lines of Section 2, the comparison against this method and Binder's method is not very clear (for example, can you explain your method with the KDE language, or vice versa?). Considering the similarity, I would like to know in detail what made the significant difference in the performance of Lorenz96 results (Table 1).
- Since the experiments do not include machine learning component, it is hard to evaluate the contribution as a machine learning method. A new guidance method could be of significant importance if strong, but the experimental results target training-free filtering problems. Empirical evidence that highlights significance for machine learning community is lacking.
Questions for authors
- What made the significant performance difference between AECSF and Binder et al. in the Lorenz96 experiment?
- Can AECSF guide the sample generation for a diffusion model-based data assimilation? What would the performance be?
6 comments
Response to Reviewer cMt8 (2/4)
W1. AECSF: a conditional-score estimation framework with shared-proposal adaptation
We propose AECSF, a conditional-score estimation framework that couples shared-proposal adaptation with reverse sampling. As reverse particles move during denoising, the shared ensemble must support score estimation at their changing locations.
EnSF (Bao et al., 2024, Section 3.2) acknowledges that its damped likelihood-gradient guidance may not yield the exact posterior score, leaving efficient correction open. EnFF (Transue et al., 2026, Section 4.2) analyzes Monte Carlo guidance with fixed forecast particles. Its output distribution approaches the likelihood-reweighted empirical posterior of a bootstrap particle filter as terminal noise vanishes.
AECSF uses the observation likelihood directly in conditional-mean estimation. Tempered weights gradually incorporate the likelihood; Langevin moves use forecast-prior and likelihood gradients to relocate proposals. Guided ancestor selection combines target weights with each proposal’s compatibility with current reverse particles under the Gaussian noising kernel. AECSF aggregates these contributions across reverse particles and applies importance correction for the changed selection probabilities. The updated ensemble provides particle-specific conditional means, which the conditional Tweedie identity converts into scores for the next reverse updates.
Within AECSF, we held the reverse sampler and proposal-movement schedule fixed, comparing standard SMC resampling with reverse-particle-guided resampling and its importance correction. L96 RMSE decreased from 0.1708 to 0.1531 and CRPS from 0.0840 to 0.0776, with both metrics improving in all ten paired runs. This comparison quantifies the additional filtering benefit of guided proposal allocation.
Response to Reviewer cMt8 (3/4)
W2. AECSF and Binder in KDE language
The distinction can be seen directly in the posterior representations and score calculations. Below, denotes a zero-mean Gaussian density with covariance . Binder et al. (2026, Section 3.2.3) first construct a joint KDE from paired forecast-state and observation samples , then condition on the observation . Let and be the state- and observation-kernel covariance matrices, and the additive noising variance at the current stage. Their posterior approximation and score after noising are
p_B(z\mid y) &\propto\sum_m\phi_H(z-z_m)\phi_G(y-\widetilde y_m),\\\\ s_{B,i}(x;y) &=\nabla_x\log\\!\left[ \sum_m\phi_G(y-\widetilde y_m) \phi_{H+\sigma_{B,i}^2I}(x-z_m)\right]. \end{aligned}$$ The observation thus changes mixture weights through the observation kernel, and the score follows by analytically differentiating the noised Gaussian mixture's log density. Forecast centers remain fixed within one analysis, but each component's contribution to the score still varies with the evaluation point $x$. AECSF instead uses the original observation likelihood $L$ directly. At stage $i$, shared proposals $z_i^m$ and integration weights $W_{i,m}$ approximate the reference distribution at tempering level $\rho_i$. Incorporating the residual likelihood $L^{1-\rho_i}$ gives an approximate posterior measure for the current score-estimation step: $$\begin{aligned} \widehat p_i(\mathrm dz\mid y) &\propto\sum_m W_{i,m}L(y\mid z_i^m)^{1-\rho_i} \delta_{z_i^m}(\mathrm dz),\\\\ \widehat s_i(x;y) &=\frac{a_i\sum_m c_{i,m}(x,y)z_i^m-x}{\sigma_i^2},\\\\ c_{i,m}(x,y) &\propto W_{i,m}L(y\mid z_i^m)^{1-\rho_i} \phi_{\sigma_i^2I}(x-a_i z_i^m). \end{aligned}$$ Here, $\delta_z$ denotes a point mass at $z$, and $c_{i,m}$ is normalized over the proposals. The coefficients $a_i=a_{\tau_i}$ and $\sigma_i=\sigma_{\tau_i}$ specify AECSF's noising at the current stage. The weighted average $\sum_m c_{i,m}z_i^m$ estimates the conditional mean given both the observation $y$ and reverse particle $x$. The score expression follows from the conditional Tweedie identity and gives the unclipped score with current proposal locations and integration weights held fixed. Appendix D.4 presents this KDE comparison: Binder conditions a joint KDE with fixed forecast centers through its observation kernel. AECSF uses the original likelihood and continually adapts shared proposals during denoising through guided selection, Langevin moves, and weight updates. The shared proposals supply integration samples for score estimation, while final analysis samples are produced by reverse sampling. ### Q1. What explains the large L96 performance gap? To test how much the conditioning difference in W2 explains the L96 gap, we added **Enhanced Binder** alongside original Binder and AECSF. It retains a forecast-state KDE but replaces observation-kernel conditioning with numerical conditioning using the original likelihood: $$p_{\mathrm{enh},h}(z\mid y)\propto L(y\mid z)\frac1M\sum_m\phi_{H_h}(z-z_m).$$ Here, $H_h$ is the forecast KDE kernel covariance. Under the original arctangent likelihood, numerical conditioning updates both mixture weights and within-kernel distributions before direct sampling. We use 20 members, observation-noise SD 0.05, and the same preselected bandwidth $h=0.5$ at both dimensions. Entries are means of three paired runs; SSR is the spread–skill ratio (ideal value 1). | Dimension | Method | RMSE | CRPS | SSR | |---|---|---:|---:|---:| | 10 | Original Binder | 7.801 | 6.057 | 2.303 | | 10 | Enhanced Binder | 0.495 | 0.228 | 1.244 | | 10 | AECSF | **0.140** | **0.083** | 1.178 | | 10,000 | Original Binder | 5.128 | 4.137 | 0.000193 | | 10,000 | Enhanced Binder | 1.431 | 0.759 | 0.042 | | 10,000 | AECSF | **0.154** | **0.078** | 0.904 | At $d=10{,}000$, Enhanced Binder **closes 74.3% of the original Binder–AECSF RMSE gap**, supporting the importance of observation conditioning. It remains severely underdispersed: median component-weight ESS falls from **7.3–7.7** at $d=10$ to **approximately one** at $d=10{,}000$. Multiplying coordinatewise evidence can concentrate global weights on one component, reducing between-component variability in recursive filtering. AECSF uses a regularized prior fitted to the entire ensemble to support new proposal locations. The methods differ in forecast representation, conditioning, and proposal evolution. W1's internal control measures the added benefit of guided selection and its correction. Table 1 includes both Binder variants; Section 5.2 explains the comparison; Appendix D.4 gives paired results, the method definition, and weight diagnostics.
Response to Reviewer cMt8 (1/4)
We sincerely thank you for carefully reviewing our manuscript and for your specific feedback on AECSF's novelty and relevance to machine learning. Your questions concern AECSF's substantive contribution relative to existing score-based filters and KDE methods, and the research value of training-free conditional inference. We first explain the significance of this research direction, then address these questions through methodological comparisons, additional controlled experiments, and the learned-prior extension.
W3. Research significance of score-based filtering and generative data assimilation
Our work lies at the intersection of Bayesian inference and generative modeling, addressing sequential state estimation and uncertainty quantification for high-dimensional physical systems. The ICLR 2027 call for papers includes Bayesian methods, sampling, uncertainty quantification, generative models, and physical-science applications. For these problems, advances in posterior inference and sampling can constitute methodological contributions without introducing a new learning module.
In data assimilation, incomplete, noisy observations must be combined with forecasts to infer states and their uncertainty. Latent-EnSF (Si and Chen, ICLR 2025) combines learned state and observation representations with ensemble score filtering; LD-EnSF (Xiao et al., ICLR 2026) learns latent dynamics for sparse observations. FlowDAS (Chen et al., NeurIPS 2025) learns stochastic transitions and incorporates observations step by step. Score-based Data Assimilation (Rozet and Louppe, NeurIPS 2023) learns a trajectory prior and introduces the observation model only at inference.
These approaches share a conditional-inference question: how should a generative prior be updated to produce reliable samples consistent with current observations? Diffusion Posterior Sampling (Chung et al., ICLR 2023) studies approximate posterior sampling for noisy inverse problems. Twisted Diffusion Sampler (Wu et al., NeurIPS 2023) uses SMC and weighted particles for conditional diffusion sampling. These works highlight the value of improving conditional-sampling algorithms even when the generative model is already trained.
AECSF addresses this conditional-inference problem by adapting a shared proposal ensemble to estimate the conditional scores required for reverse diffusion. Its score estimator is training-free, and the learned-prior experiment in Q2 demonstrates how this inference procedure can be combined with a pretrained generative model.