mlsanityData to 14 Oct 2026

Learning Mixtures of Linear Dynamical Systems

arXiv 2201.11211 ↗First posted 26 Jan 2022stat.ML cs.LG cs.SYcited by 15

Not on the map. Why?

Abstract (arXiv)

We study the problem of learning a mixture of multiple linear dynamical systems (LDSs) from unlabeled short sample trajectories, each generated by one of the LDS models. Despite the wide applicability of mixture models for time-series data, learning algorithms that come with end-to-end performance guarantees are largely absent from existing literature. There are multiple sources of technical challenges, including but not limited to (1) the presence of latent variables (i.e. the unknown labels of trajectories); (2) the possibility that the sample trajectories might have lengths much smaller than the dimension d of the LDS models; and (3) the complicated temporal dependence inherent to time-series data. To tackle these challenges, we develop a two-stage meta-algorithm, which is guaranteed to efficiently recover each ground-truth LDS model up to error tildeO(√d/T), where T is the total sample size. We validate our theoretical studies with numerical experiments, confirming the efficacy of the proposed algorithm.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 54 of its 101 references that are in the map. First posted on arXiv 26 Jan 2022.

Builds on

54 of 101 references.

References · 54

  1. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  2. 2017Prototypical Networks for Few-shot Learningcited by 3,015
  3. 2018Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulatorcited by 250
  4. 2015Contextual Markov Decision Processescited by 220
  5. 2020Few-Shot Learning via Learning the Representation, Provablycited by 214
  6. 2015The Benefit of Multitask Representation Learningcited by 195
  7. 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
  8. 2021Multi-Task Reinforcement Learning with Context-based Representationscited by 174
  9. 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 159
  10. 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
  11. 2019Mean estimation and regression under heavy-tailed distributions--a surveycited by 136
  12. 2020Naive Exploration is Optimal for Online LQRcited by 116
38 more
  1. 2020Spectral Methods for Data Science: A Statistical Perspectivecited by 112
  2. 2020Information Theoretic Regret Bounds for Online Nonlinear Controlcited by 90
  3. 2018Near optimal finite time identification of arbitrary linear dynamical systemscited by 89
  4. 2020Active Learning for Nonlinear System Identification with Guaranteescited by 80
  5. 2018Non-asymptotic Identification of LTI Systems from a Single Trajectorycited by 78
  6. 2018Mobile Sensor Data Anonymizationcited by 70
  7. 2021RL for Latent MDPs: Regret Guarantees and a Lower Boundcited by 70
  8. 2018Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systemscited by 67
  9. 2017Finite Time Identification in Unstable Linear Systemscited by 66
  10. 2013Sample Complexity of Multi-task Reinforcement Learningcited by 58
  11. 2019Learning Linear Dynamical Systems with Semi-Parametric Least Squarescited by 58
  12. 2018Online Linear Quadratic Controlcited by 56
  13. 2019Continuous Meta-Learning without Taskscited by 50
  14. 2021AdaRL: What, Where, and How to Adapt in Transfer Reinforcement Learningcited by 48
  15. 2017Toeplitz Inverse Covariance-Based Clustering of Multivariate Time Series Datacited by 47
  16. 2020Logarithmic Regret Bound in Partially Observable Linear Dynamical Systemscited by 46
  17. 2020Learning nonlinear dynamical systems from a single trajectorycited by 46
  18. 2020Meta-learning for mixed linear regressioncited by 44
  19. 2020Latent Bandits Revisitedcited by 44
  20. 2020Robust Meta-learning for Mixed Linear Regression with Small Batchescited by 41
  21. 2018Learning Mixtures of Linear Regressions with Nearly Optimal Complexitycited by 37
  22. 2020Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Modelscited by 28
  23. 2019Learning Mixtures of Linear Regressions in Subexponential Time via Fourier Momentscited by 26
  24. 2020On the Minimax Optimality of the EM Algorithm for Learning Two-Component Mixed Linear Regressioncited by 24
  25. 2018On Adaptive Linear-Quadratic Regulatorscited by 21
  26. 2020Learning the Linear Quadratic Regulator from Nonlinear Observationscited by 21
  27. 2019Sample Complexity Lower Bounds for Linear System Identificationcited by 20
  28. 2021Deep Explicit Duration Switching Models for Time Seriescited by 17
  29. 2020Sample Complexity of Linear Quadratic Gaussian (LQG) Control for Output Feedback Systemscited by 16
  30. 2021Joint Learning of Linear Time-Invariant Dynamical Systemscited by 16
  31. 2019Sample Complexity of Kalman Filtering for Unknown Systemscited by 12
  32. 2020Learning Mixtures of Low-Rank Modelscited by 11
  33. 2020Sequential Transfer in Reinforcement Learning with a Generative Modelcited by 10
  34. 2021Coresets for Time Series Clusteringcited by 8
  35. 2021A Wasserstein Minimax Framework for Mixed Linear Regressioncited by 7
  36. 2020Recovery of Sparse Signals from a Mixture of Linear Samplescited by 6
  37. 2021Kalman Filtering with Adversarial Corruptionscited by 6
  38. 2019Event-triggered Learning for Linear Quadratic Controlcited by 4

50 most cited of 54 All 54 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 2; 2023: 4; 2024: 4; 2025: 3; 2026: 2.

15 papers.

Sort: