Streaming Linear System Identification with Reverse Experience Replay
Prateek Jain, Suhas S. Kowshik, Dheeraj Nagaraj, Praneeth Netrapalli
Abstract
We consider the problem of estimating a stochastic linear time-invariant (LTI) dynamical system from a single trajectory via streaming algorithms. The problem is equivalent to estimating the parameters of vector auto-regressive (VAR) models encountered in time series analysis (Hamilton (2020)). A recent sequence of papers (Faradonbeh et al., 2018; Simchowitz et al., 2018; Sarkar and Rakhlin, 2019) show that ordinary least squares (OLS) regression can be used to provide optimal finite time estimator for the problem. However, such techniques apply for offline setting where the optimal solution of OLS is available apriori. But, in many problems of interest as encountered in reinforcement learning (RL), it is important to estimate the parameters on the go using gradient oracle. This task is challenging since standard methods like SGD might not perform well when using stochastic gradients from correlated data points (Györfi and Walk, 1996; Nagaraj et al., 2020). In this work, we propose a novel algorithm, SGD with Reverse Experience Replay (SGD-RER), that is inspired by the experience replay (ER) technique popular in the RL literature (Lin, 1992). SGD-RER divides data into small buffers and runs SGD backwards on the data stored in the individual buffers. We show that this algorithm exactly deconstructs the dependency structure and obtains information theoretically optimal guarantees for both parameter error and prediction error for standard problem settings. Thus, we provide the first - to the best of our knowledge - optimal SGD-style algorithm for the classical problem of linear system identification aka VAR model estimation. Our work demonstrates that knowledge of dependency structure can aid us in designing algorithms which can deconstruct the dependencies between samples optimally in an online fashion.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers8
- Stochastic Gradient Descent under Markovian Sampling SchemesMathieu EvenICML 2023 · 41 citations
- Adapting to Mixing Time in Stochastic Optimization with Markovian DataRon Dorfman, Kfir Yehuda LevyICML 2022 · 41 citations
- Understanding Deep Neural Function Approximation in Reinforcement Learning via -Greedy ExplorationFanghui Liu, Luca Viano, Volkan CevherNeurIPS 2022 · 28 citations
- Near-optimal Offline and Streaming Algorithms for Learning Non-Linear Dynamical SystemsSuhas S. Kowshik, Dheeraj Nagaraj, Prateek Jain, Praneeth NetrapalliNeurIPS 2021 · 28 citations
- Online Target Q-learning with Reverse Experience Replay: Efficiently finding the Optimal Policy for Linear MDPsNaman Agarwal, Syomantak Chaudhuri, Prateek Jain, Dheeraj Mysore Nagaraj et al.ICLR 2022 · 24 citations
Builds on5
- Logarithmic Regret Bound in Partially Observable Linear Dynamical SystemsSahin Lale, Kamyar Azizzadenesheli, Babak Hassibi, Anima AnandkumarNeurIPS 2020 · 106 citations
- Least Squares Regression with Markovian Data: Fundamental Limits and AlgorithmsDheeraj Nagaraj, Xian Wu, Guy Bresler, Prateek Jain et al.NeurIPS 2020 · 73 citations
- Near-optimal Offline and Streaming Algorithms for Learning Non-Linear Dynamical SystemsSuhas S. Kowshik, Dheeraj Nagaraj, Prateek Jain, Praneeth NetrapalliNeurIPS 2021 · 28 citations
- Online Target Q-learning with Reverse Experience Replay: Efficiently finding the Optimal Policy for Linear MDPsNaman Agarwal, Syomantak Chaudhuri, Prateek Jain, Dheeraj Mysore Nagaraj et al.ICLR 2022 · 24 citations
- SLIP: Learning to predict in unknown dynamical systems with long-term memoryParia Rashidinejad, Jiantao Jiao, Stuart RussellNeurIPS 2020 · 16 citations
Related papers
- History-Gradient Aided Batch Size Adaptation for Variance Reduced AlgorithmsKaiyi Ji, Zhe Wang, Bowen Weng, Yi Zhou et al.ICML 2020 · 19 citations
- Online robust non-stationary estimationAbishek Sankararaman, Balakrishnan NarayanaswamyNeurIPS 2023 · 3 citations
- Maximum-Likelihood Inverse Reinforcement Learning with Finite-Time GuaranteesSiliang Zeng, Chenliang Li, Alfredo García, Mingyi HongNeurIPS 2022 · 60 citations
- Demystifying SGD with Doubly Stochastic GradientsKyurae Kim, Joohwan Ko, Yian Ma, Jacob R. GardnerICML 2024 · 2 citations
- Online Variational Filtering and Parameter LearningAndrew Campbell, Yuyang Shi, Thomas Rainforth, Arnaud DoucetNeurIPS 2021 · 30 citations
