- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper adds a neural residual correction to model-based filters such as the EKF, and bounds the norm of that correction. The authors show that if the bound is small enough, the EKF’s stability guarantee still holds. Experiments on a linear system, the Lorenz attractor and NCLT show lower error and better calibration than KalmanNet-style hybrid filters, and BRC does not diverge where some baselines do.
Critical strengths
- The method is simple and easy to add to existing filters. The correction is also easy to inspect, since it is just an offset from the nominal estimate.
- The formalized neural residual correction has a theoretical guarantee.
Critical weaknesses
-
I am not sure how much the theory adds. Bounded perturbations keeping a stable EKF bounded feels close to standard ISS-type results. \bar{c} cannot be computed, so in practice c_max is still tuned by hand, and the bound is local and does not go to zero. It would help if the authors said clearly what is new compared with existing EKF perturbation analysis.
-
The experiments are small. All systems have 3 to 6 states. In the Lorenz in-distribution test, the test and training sets share the same ground-truth trajectory, and only the noise is different. NCLT uses one segment with an 800-step test set. That seems too little to back the claims about safety-critical use.
-
The related work is fairly old, mostly 2016–2021. Recent work on learned observers with Lyapunov or contraction guarantees is not discussed, and it matters for the claim of being “the first formal stability guarantee for hybrid filters”.
Questions for authors
See weaknesses.
4 comments
Response to Reviewer 7yab (2/2)
Weakness 3
- Recency of related work.
- We respectfully note that we discuss several works published beyond 2021. We also evaluate a number of these works as baselines. Specifically, the recent filters from 2024 to 2026 we cover include: model-based (Duran-Martin et al., 2024), data-driven (Dowling et al., 2024; Ghosh et al., 2024; Noren et al., 2026). Our coverage of hybrid filters---most related to our work---includes recent representatives of both families of survey of Shlezinger et al. (2025): task-oriented (Mortada et al., 2025; Shen et al., 2025) and state-space-model-oriented (Straka et al., 2025).
- The Related Work section (§5), in particular, is organised by estimation objective, separating smoothing, system identification and filtering, for which the works that introduced them are the clearest instances, whereas recent and a more comprehensive coverage of hybrid filters is provided by the survey of Shlezinger et al. (2025) and our introduction (§1) and evaluation (§4, §F) sections.
- Learned observers with Lyapunov or contraction guarantees, and the claim of a first guarantee.
- In this paper, we distinguish a formal stability guarantee from a theoretical stability property. A property holds under conditions, some of which concern the filter itself and yet cannot be ensured by the user, since the filter's design gives the user no control over them. A guarantee is one whose conditions concerning the filter, rather than the dynamical system or the nominal model, can all be ensured by the user. We clarify this in §1 of the revised manuscript. This distinction matters in practice, because filter-side conditions that cannot be ensured give a practitioner no assurance in deployment, and no remedy when the filter diverges.
- For instance, consider Hu et al., 2021, who establish a mean-square error bound (Theorem 1) conditional on a Lyapunov decrease condition in expectation (Eq. (16)) and on ergodicity of the filter-induced error chain (Assumption 1). However, nothing in the filter or its training process is able to ensure these conditions. This is a property and not a guarantee in the above sense.
- BRC, on the other hand, provides a guarantee. Its two filter-side conditions are that its covariance residuals be positive semi-definite, which can be ensured by construction (e.g. per Algorithm 1), and that its norm-bound remain below a threshold, which the user can achieve by reducing if needed. Even when the threshold cannot be computed, our theoretical results guarantee that such a threshold exists. Once the conditions on the dynamical system and the nominal model---the exogenous conditions---are satisfied, stabilising BRC therefore comes down to aspects the user controls.
- Among all the works we cite and those in the survey of Shlezinger et al. (2025), none provides a guarantee in this sense. Thus, to our knowledge, ours is the first formal stability guarantee for hybrid filters. We would welcome any pointers to works we may have missed.
References: Attached as a supplemental file ('Review_References.pdf').
Reply to author's responses
Thank you for the response. However, no new experiments were added, and the authors acknowledge that the theoretical conditions serve to isolate failure modes rather than to certify stability, with c_max still tuned as a hyperparameter. I will therefore keep my score.
Response to Reviewer 7yab’s Post-Rebuttal Comment: Practical Value of the Theorem and c_max
We thank the reviewer for their response. We respond below on the theorem's practical value and on .
Practical value of the theorem
-
Irreducible limitation: stability cannot, in general, be certified in advance
- Locality. We have already explained why locality is, in general, necessary for local-linearisation filters such as the EKF; it is an irreducible limitation across the literature (please see our earlier response, "Bound being local and not approaching zero"). Accordingly, stability results for these filters require, in general, a sufficiently small initial error (Reif et al., 1999; La Scala et al., 1995; Boutayeb et al., 1997; Song and Grizzle, 1992; Kluge et al., 2010; Barrau and Bonnabel, 2017). Certifying that the initial error is small enough, however, requires knowledge of the true initial state, which in general is not available.
- Remaining conditions. Even if the initial state were known, certifying stability in advance, via our theorem as well as the results in the literature (see our response to Reviewer pSuV, "Strength of Drift Assumption"), requires bounds on the Jacobians, Taylor remainders, covariances and noise, which in general cannot be verified in advance. Karvonen et al., 2020 make the same point for the majority of stability analyses of the EKF, UKF and related filters, whose assumptions they find "effectively impossible to verify".
- Misspecification. Bounded misspecification is necessary for any stability guarantee (§M.4, scalar linear counterexample; Common Comment A), and it is consistent with the premise of hybrid filtering that the nominal model and the data must be sufficiently informative (§1). Without knowledge of the true system, however, the bound cannot be verified either.
- In advance, at every step. Checking conditions during the run does not change this. The error evolves recursively (Eq. (18)), so at any time the guarantee for the steps to come is the same guarantee as at the start, with the current error in place of the initial error. Reif et al., 1999 note in Remark 1 that the bounds on the Jacobians and covariances can be verified "during the state estimation process", since the filter computes them, but this covers only what the filter has computed so far, not the steps the guarantee concerns. The remaining conditions concern the true system (the current error, the linearisation remainders, the noise and the misspecification), and are no more available at step than at step .
-
What our theorem provides
- A stability guarantee for hybrid filters, where none existed. To our knowledge, none of the hybrid filters in the survey by Shlezinger et al., 2025, nor those we cite, has a stability guarantee, even under model fidelity (§1, contribution 2).
- Isolating failure modes. As the reviewer notes, our conditions isolate the failure modes of a BRC-augmented filter: whenever it diverges, at least one of them has failed. What distinguishes this for hybrid filters is that the failure modes become actionable. The EKF's are well studied (Bar-Shalom et al., 2001, Chapter 5.5), and BRC's are remedied by keeping covariance residuals positive semi-definite (e.g. by construction per Algorithm 1) and, if that is ensured, reducing , which recovers the EKF at (Common Comment E; §4.2).
as a hyperparameter
- Necessity. Norm-bounding is, in general, necessary for a guarantee of bounded errors (§M.3; Common Comment D); i.e. such a guarantee requires a fail-safe bound on learned residuals.
- Regularisation. Regularisation can encourage small residuals but, in general, cannot enforce a bound.
- Learning . could itself be learned, but it would then need an upper bound, so that a fail-safe exists, and that upper bound would again be a hyperparameter.
- Conclusion. Some hyperparameter is always necessary for the fail-safe that the guarantee requires. Ours is .
Additional Reference Karvonen, T., Bonnabel, S., Moulines, E., & Särkkä, S. (2020). On Stability of a Class of Filters for Nonlinear Stochastic Systems. SIAM Journal on Control and Optimization, 58(4), 2023–2049. https://doi.org/10.1137/19M1285974
Response to Reviewer 7yab (1/2)
We thank the reviewer for their attention. Our responses to their comments are below; all references to texts within our manuscripts, cited using §/Eq. numbers, are to the original manuscript unless mentioned:
Weakness 1
Weakness 2