Pith. sign in

REVIEW 2 cited by

Online Learning for Nonlinear Dynamical Systems without the I.I.D. Condition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.02995 v1 pith:MKL75JF5 submitted 2025-04-03 eess.SY cs.SY

classification eess.SYcs.SY
keywords onlineconditionexcitationsystemsdynamicalnonlinearparameterstochastic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper investigates online identification and prediction for nonlinear stochastic dynamical systems. In contrast to offline learning methods, we develop online algorithms that learn unknown parameters from a single trajectory. A key challenge in this setting is handling the non-independent data generated by the closed-loop system. Existing theoretical guarantees for such systems are mostly restricted to the assumption that inputs are independently and identically distributed (i.i.d.), or that the closed-loop data satisfy a persistent excitation (PE) condition. However, these assumptions are often violated in applications such as adaptive feedback control. In this paper, we propose an online projected Newton-type algorithm for parameter estimation in nonlinear stochastic dynamical systems, and develop an online predictor for system outputs based on online parameter estimates. By using both the stochastic Lyapunov function and martingale estimation methods, we demonstrate that the average regret converges to zero without requiring traditional persistent excitation (PE) conditions. Furthermore, we establish a novel excitation condition that ensures global convergence of the online parameter estimates. The proposed excitation condition is applicable to a broader class of system trajectories, including those violating the PE condition.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning Ergodic Dynamical Systems from a Finite Trajectory

    stat.ML 2026-07 accept novelty 6.0 of 10

    For uniformly geometrically ergodic Markov systems, regularized least squares learns the optimal one-step predictor from a single finite trajectory with excess-risk bounds of order T^{-1/2} with respect to the invaria...

  2. Collective decision-making dynamics in hypernetworks

    math.OC 2025-09 conditional novelty 5.0 of 10

    In a cooperative hypernetwork opinion model, three-agent interactions unfold the pitchfork bifurcation and create a bistable interval where deadlock and a nontrivial decision are both stable.

Pith tools