Paper proves contracting RNNs act as tunable state observers
TL;DR
- The paper frames RNNs as time-discretizations of continuous latent dynamical systems and proves that a contraction condition yields a smooth, injective map to latent space.
- A single scalar gain scaling the latent vector field drives estimation error to an arbitrarily small neighborhood of zero at an exponentially fast rate.
- On a real mobile robotic task, a provably contracting model beat a vanilla GRU with substantially more stable training.
Recurrent networks used for state estimation can be given formal convergence guarantees by imposing a single geometric condition on their latent dynamics, according to a paper posted to arxiv on 6 November by Vincent Andrieu, Pauline Bernard, Lucas Brivadis, Laurent Praly, and Christian Wolf, researchers tied to CNRS and affiliated control labs. Framing RNNs as a time-discretization of continuous latent dynamical systems (Neural ODEs), they show the architecture 'acts as a tunable observer: by increasing a single scalar gain that scales the latent vector field, the estimation error can be driven to an arbitrarily small neighborhood of zero at an exponentially fast rate.'
On a real mobile robotic task, their provably contracting model outperformed a vanilla GRU with 'substantially more stable training.' More interesting: the authors report that unconstrained GRUs trained on the same task naturally converge to contracting dynamics, which they read as evidence that 'contraction is an emergent property of well-trained sequence models.'
Two researchers we track flagged the paper in the days after it posted.
Shared on Bluesky by 2 AI experts
-
New #NeurIPS2026 paper: "Provable State Estimation with Recurrent Models" RNNs are widely used for state estimation in robotics, w/o convergence guarantees. We show when an RNN+MLP provably recovers the true state. ar…
View on Bluesky →
Originally reported by arxiv.org
Read the original article →Original headline: Provable State Estimation with Recurrent Models