# System Identification via Meta-Learning in Linear Time-Varying Environments

arXiv: https://arxiv.org/abs/2010.14664 · HTML: https://mlsanity.com/paper/2010.14664/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Oct 2020.

## Built on by (most cited first, 4 of 4)

- [LeARN: Learnable and Adaptive Representations for Nonlinear Dynamics in System Identification](https://mlsanity.com/paper/2412.12036/) (2024)
- [COSMIC: fast closed-form identification from large-scale data for LTV systems](https://mlsanity.com/paper/2112.04355/) (2021)
- [Bayesian Modeling and Estimation of Linear Time-Varying Systems using Neural Networks and Gaussian Processes](https://mlsanity.com/paper/2507.12878/) (2025)
- [Meta-Learning for Rapid Adaptation in Reference Tracking of Uncertain Nonlinear Systems](https://mlsanity.com/paper/2605.22513/) (2026)

## Abstract (arXiv)

System identification is a fundamental problem in reinforcement learning, control theory and signal processing, and the non-asymptotic analysis of the corresponding sample complexity is challenging and elusive, even for linear time-varying (LTV) systems. To tackle this challenge, we develop an episodic block model for the LTV system where the model parameters remain constant within each block but change from block to block. Based on the observation that the model parameters across different blocks are related, we treat each episodic block as a learning task and then run meta-learning over many blocks for system identification, using two steps, namely offline meta-learning and online adaptation. We carry out a comprehensive non-asymptotic analysis of the performance of meta-learning based system identification. To deal with the technical challenges rooted in the sample correlation and small sample sizes in each block, we devise a new two-scale martingale small-ball approach for offline meta-learning, for arbitrary model correlation structure across blocks. We then quantify the finite time error of online adaptation by leveraging recent advances in linear stochastic approximation with correlated samples.
