Sample Complexity Bounds for Linear System Identification From a Finite Set

被引：0
|
作者：
Chatzikiriakos, Nicolas [1 ]
Iannelli, Andrea [1 ]
机构：
[1] Institute for Systems Theory and Automatic Control, University of Stuttgart, Stuttgart,70550, Germany
来源：
IEEE Control Systems Letters | 2024年 / 8卷
关键词：
D O I：
10.1109/LCSYS.2024.3514995
中图分类号：
学科分类号：
摘要：
21
引用
收藏
页码：2751 / 2756
相关论文
共 50 条
  • [1] Sample Complexity Lower Bounds for Linear System Identification
    Jedra, Yassir
    Proutiere, Alexandre
    2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 2676 - 2681
  • [2] Lower bounds on the linear complexity of the discrete logarithm in finite fields
    Meidl, W
    Winterhof, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 2807 - 2811
  • [3] Finite sample properties of linear model identification
    Univ of Melbourne, Parkville
    IEEE Trans Autom Control, 7 (1370-1382):
  • [4] Finite sample properties of linear model identification
    Weyer, E
    Williamson, RC
    Mareels, IMY
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1999, 44 (07) : 1370 - 1383
  • [5] Error bounds for conditional algorithms in restricted complexity set membership identification
    Garulli, A
    Kacewicz, B
    Vicino, A
    Zappa, G
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2000, 45 (01) : 160 - 164
  • [6] Remarks on the sample complexity for linear control systems identification
    Kuusela, P
    Ocone, D
    Sontag, ED
    ADAPTATION AND LEARNING IN CONTROL AND SIGNAL PROCESSING 2001, 2002, : 431 - 436
  • [7] The Average State Complexity of the Star of a Finite Set of Words Is Linear
    Bassino, Frederique
    Giambruno, Laura
    Nicaud, Cyril
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2008, 5257 : 134 - +
  • [8] On Complexity Bounds for the Maximal Admissible Set of Linear Time-Invariant Systems
    Ossareh, Hamid R.
    Kolmanovsky, Ilya
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (09) : 6389 - 6396
  • [9] Improved bounds on the sample complexity of learning
    Li, Y
    Long, PM
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 62 (03) : 516 - 527
  • [10] Improved bounds on the sample complexity of learning
    Li, Y
    Long, PM
    Srinivasan, A
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 309 - 318
12345