Search arXivSearch

arXiv · 2203.12794

Learning the Dynamics of Autonomous Linear Systems From Multiple Trajectories

Abstract

We consider the problem of learning the dynamics of autonomous linear systems (i.e., systems that are not affected by external control inputs) from observations of multiple trajectories of those systems, with finite sample guarantees. Existing results on learning rate and consistency of autonomous linear system identification rely on observations of steady state behaviors from a single long trajectory, and are not applicable to unstable systems. In contrast, we consider the scenario of learning system dynamics based on multiple short trajectories, where there are no easily observed steady state behaviors. We provide a finite sample analysis, which shows that the dynamics can be learned at a rate $\mathcal{O}(\frac{1}{\sqrt{N}})$ for both stable and unstable systems, where $N$ is the number of trajectories, when the initial state of the system has zero mean (which is a common assumption in the existing literature). We further generalize our result to the case where the initial state has non-zero mean. We show that one can adjust the length of the trajectories to achieve a learning rate of $\mathcal{O}(\sqrt{\frac{\log{N}}{N})}$ for strictly stable systems and a learning rate of $\mathcal{O}(\frac{(\log{N})^d}{\sqrt{N}})$ for marginally stable systems, where $d$ is some constant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lei Xin, George Chiu, Shreyas Sundaram. 2022-03-24. Learning the Dynamics of Autonomous Linear Systems From Multiple Trajectories. https://doi.org/10.23919/acc53348.2022.9867533

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY