Frequency Response Identification of Low-Order Systems: Finite-Sample Analysis
Arya Honarpisheh, Mario Sznaier
TL;DR
The paper addresses finite-sample frequency-domain identification of low-order LTI systems by casting the problem as a convex Loewner-nuclear-norm regularized regression. It derives a non-asymptotic error bound showing the identification error at sampled frequencies scales as $O\big(\sqrt{ \frac{M \ln M}{N} }\big)$, with constants depending on system stability, the Loewner-operator conditioning, and noise level. The approach promotes low-order models without explicit stability constraints by using the nuclear norm of the Loewner matrix as a regularizer and provides a detailed operator-theoretic analysis via the Loewner operator, its adjoint, and concentration inequalities. Numerical experiments demonstrate that the method yields low-order, accurate frequency responses and validate the predicted scaling of the sample complexity, highlighting its potential for practical frequency-domain system identification and model-order reduction.
Abstract
This paper proposes a frequency-domain system identification method for learning low-order systems. The identification problem is formulated as the minimization of the l2 norm between the identified and measured frequency responses, with the nuclear norm of the Loewner matrix serving as a regularization term. This formulation results in an optimization problem that can be efficiently solved using standard convex optimization techniques. We derive an upper bound on the sampled-frequency complexity of the identification process and subsequently extend this bound to characterize the identification error over all frequencies. A detailed analysis of the sample complexity is provided, along with a thorough interpretation of its terms and dependencies. Finally, the efficacy of the proposed method is demonstrated through an example, and numerical simulations validating the growth rate of the sample complexity bound.
