A finite-sample generalization bound for stable LPV systems
<|reference_start|>A finite-sample generalization bound for stable LPV systems: One of the main theoretical challenges in learning dynamical systems from data is providing upper bounds on the generalization error, that is, the difference between the expected prediction error and the empirical prediction error measured on some finite sample. In machine learning, a popular class of such bounds are the so-called Probably Approximately Correct (PAC) bounds. In this paper, we derive a PAC bound for stable continuous-time linear parameter-varying (LPV) systems. Our bound depends on the H2 norm of the chosen class of the LPV systems, but does not depend on the time interval for which the signals are considered.<|reference_end|>
@article{racz2024a,
    title={A finite-sample generalization bound for stable LPV systems},
    author={Daniel Racz, Martin Gonzalez, Mihaly Petreczky, Andras Benczur, Balint
  Daroczy},
    journal={arXiv preprint arXiv:2405.10054},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.10054},
    primaryClass={cs.LG cs.SY eess.SY}
}