A finite-sample generalization bound for stable LPV systems

Daniel Racz, Martin Gonzalez, Mihaly Petreczky, Andras Benczur, Balint Daroczy
5/16/2024
cs.LGeess.SY

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{racz2024finitesample,
  title  = {A finite-sample generalization bound for stable LPV systems},
  author = {Daniel Racz and Martin Gonzalez and Mihaly Petreczky and Andras Benczur and Balint Daroczy},
  year   = {2024},
  eprint = {2405.10054},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.10054v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.10054.svg)](https://codeofpaper.com/paper/2405.10054)

Discussion