Achieving widetildeO(1/ε) Sample Complexity for Bilinear Systems Identification under Bounded Noises
Not on the map. Why?
Abstract (arXiv)
This paper studies finite-sample set-membership identification for discrete-time bilinear systems under bounded symmetric log-concave disturbances. Our analysis considers trajectory-dependent regressors and allows marginally stable dynamics with polynomial mean-square state growth. We prove that the diameter of the feasible parameter set shrinks with sample complexity widetildemathcal O(1/ε) where ε is the estimation error. Simulation supports the theory and illustrates the advantage of the proposed estimator for uncertainty quantification.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 27 references that are in the map. First posted on arXiv 21 Mar 2026.
Builds on
15 of 27 references.
References · 15
- 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
- 2020Naive Exploration is Optimal for Online LQRcited by 116
- 2018Near optimal finite time identification of arbitrary linear dynamical systemscited by 89
- 2018Non-asymptotic Identification of LTI Systems from a Single Trajectorycited by 78
- 2022Finite Sample Identification of Bilinear Dynamical Systemscited by 12
- 2020Set Membership identification of linear systems with guaranteed simulation accuracycited by 7
- 2024Identification of Analytic Nonlinear Dynamical Systems with Non-asymptotic Guaranteescited by 7
- 2023Learning the Uncertainty Sets for Control Dynamics via Set Membership: A Non-Asymptotic Analysiscited by 6
- 2024CLOSURE: Fast Quantification of Pose Uncertainty Setscited by 6
- 2022Online Adversarial Stabilization of Unknown Networked Systemscited by 5
- 2025Finite Sample Identification of Partially Observed Bilinear Dynamical Systemscited by 5
- 2024On the Sample Complexity of Set Membership Estimation for Linear Systems with Disturbances Bounded by Convex Setscited by 3
Built on by
Not cited yet.