mlsanityData to 7 Oct 2026

Sparsity in Partially Controllable Linear Systems

arXiv 2110.06150 ↗First posted 12 Oct 2021math.OC cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

A fundamental concept in control theory is that of controllability, where any system state can be reached through an appropriate choice of control inputs. Indeed, a large body of classical and modern approaches are designed for controllable linear dynamical systems. However, in practice, we often encounter systems in which a large set of state variables evolve exogenously and independently of the control inputs; such systems are only partially controllable. The focus of this work is on a large class of partially controllable linear dynamical systems, specified by an underlying sparsity pattern. Our main results establish structural conditions and finite-sample guarantees for learning to control such systems. In particular, our structural results characterize those state variables which are irrelevant for optimal control, an analysis which departs from classical control techniques. Our algorithmic results adapt techniques from high-dimensional statistics -- specifically soft-thresholding and semiparametric least-squares -- to exploit the underlying sparsity pattern in order to obtain finite-sample guarantees that significantly improve over those based on certainty-equivalence. We also corroborate these theoretical improvements over certainty-equivalent control through a simulation study.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 15 of its 42 references that are in the map. First posted on arXiv 12 Oct 2021.

Builds on

15 of 42 references.

References · 15

  1. 2020FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPscited by 232
  2. 2017On the Sample Complexity of the Linear Quadratic Regulatorcited by 151
  3. 2019Orthogonal Statistical Learningcited by 150
  4. 2020Naive Exploration is Optimal for Online LQRcited by 111
  5. 2018Near optimal finite time identification of arbitrary linear dynamical systemscited by 89
  6. 2020Information Theoretic Regret Bounds for Online Nonlinear Controlcited by 87
  7. 2020Active Learning for Nonlinear System Identification with Guaranteescited by 78
  8. 2019Learning Linear-Quadratic Regulators Efficiently with only √T Regretcited by 67
  9. 2020Logarithmic Regret for Learning Linear Quadratic Regulators Efficientlycited by 33
  10. 2020Online Sparse Reinforcement Learningcited by 25
  11. 2019Learning Sparse Dynamical Systems from a Single Sample Trajectorycited by 20
  12. 2021Linear Systems can be Hard to Learncited by 20
3 more
  1. 2020Episodic Linear Quadratic Regulators with Low-rank Transitionscited by 3
  2. 2021Towards a Dimension-Free Understanding of Adaptive Linear Controlcited by 2
  3. 2018Sample Complexity of Sparse System Identification Problemcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 6; 2023: 1; 2024: 2.

9 papers.