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 条
  • [21] The Sample Complexity of Level Set Approximation
    Bachoc, Francois
    Cesari, Tommaso
    Gerchinovitz, Sebastien
    24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS), 2021, 130 : 424 - +
  • [22] Finite Sample Analysis for Structured Discrete System Identification
    Xie, Xiaotian
    Katselis, Dimitrios
    Beck, Carolyn L.
    Srikant, R.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (10) : 6345 - 6352
  • [23] Sample Complexity of Block-Sparse System Identification Problem
    Fattahi, Salar
    Sojoudi, Somayeh
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2021, 8 (04): : 1905 - 1917
  • [24] Complexity of solving a system of difference constraints with variables restricted to a finite set
    Cifuentes, Santiago
    Soulignac, Francisco J.
    Terlisky, Pablo
    INFORMATION PROCESSING LETTERS, 2023, 182
  • [25] SAMPLE COMPLEXITY BOUNDS ON DIFFERENTIALLY PRIVATE LEARNING VIA COMMUNICATION COMPLEXITY
    Feldman, Vitaly
    Xiao, David
    SIAM JOURNAL ON COMPUTING, 2015, 44 (06) : 1740 - 1764
  • [26] THE SAMPLE COMPLEXITY OF WORST-CASE IDENTIFICATION OF FIR LINEAR-SYSTEMS
    DAHLEH, MA
    THEODOSOPOULOS, TV
    TSITSIKLIS, JN
    SYSTEMS & CONTROL LETTERS, 1993, 20 (03) : 157 - 166
  • [27] On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons
    Ren, Wenbo
    Liu, Jia
    Shroff, Ness B.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32
  • [28] Sample Complexity Bounds for Active Ranking from Multi-wise Comparisons
    Ren, Wenbo
    Liu, Jia
    Shroff, Ness B.
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34
  • [29] Using Indexed Finite Set Variables for Set Bounds Propagation
    Viegas, Ruben Duarte
    Correia, Marco
    Barahona, Pedro
    Azevedo, Francisco
    ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2008, PROCEEDINGS, 2008, 5290 : 73 - 82
  • [30] INEXPERIENCED RL AGENTS CAN'T GET IT RIGHT: LOWER BOUNDS ON REGRET AT FINITE SAMPLE COMPLEXITY
    Fraser, Maia
    Letourneau, Vincent
    CONFERENCE ON LIFELONG LEARNING AGENTS, VOL 199, 2022, 199
12345