Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises
arXiv:2603.20819v1 Announce Type: new Abstract: This paper studies finite-sample set-membership identification for discrete-time bilinear systems under bounded symmetric log-concave disturbances. Compared with existing finite-sample results …
Hongyu Yi, Chenbei Lu, Jing Yu
조회수 82회