关于$\mathcal{L}_2$ -gain数据驱动推理的样本复杂度
On the Sample Complexity of Data-Driven Inference of the $\mathcal{L}_2$-gain
摘要:
最近,数据驱动控制已成为一个广泛的研究领域。近年来,一些基于大数据的非线性系统数据驱动控制方法试图使用经典的输入输出技术来设计控制器,只有有限数量的(输入输出)样本是已知的系统。这些方法的重点是使用给定的数据来计算上的$\mathcal{L}_2$ -增益或从有限的输入输出数据的无源性的短缺的界限,允许应用的小增益定理或无源系统的反馈定理。关于这些方法的一个问题是关于它们的样本复杂性,即需要多少输入-输出样本来获得算子范数的近似或无源性的不足。我们发现,估计系统的算子范数所需的样本数量大致相同,近似系统的算子范数所需的样本数量。
英文摘要:
Lately, data-driven control has become a widespread area of research. A few recent big-data based approaches for data-driven control of nonlinear systems try to use classical input-output techniques to design controllers for systems for which only a finite number of (input-output) samples are known. These methods focus on using the given data to compute bounds on the $\mathcal{L}_2$-gain or on the shortage of passivity from finite input-output data, allowing for the application of the small gain theorem or the feedback theorem for passive systems. One question regarding these methods asks about their sample complexity, namely how many input-output samples are needed to get an approximation of the operator norm or of the shortage of passivity. We show that the number of samples needed to estimate the operator norm of a system is roughly the same as the number of samples required to approximate the system in the operator norm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。