Frequency Response Identification of Low-Order Systems: Finite-Sample Analysis

Arya Honarpisheh, Mario Sznaier
8/23/2025
eess.SYcs.LGstat.ML

No official code found. Best implementation: Arya-Honarpisheh/freq_iden_low_order (2 stars, MIT, last commit 2025-10-13).

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.

View on arXivView PDF

Code Implementations(1)

MIT

Code for the paper: Frequency Response Identification of Low-Order Systems: Finite-Sample Analysis

20MATLABAug 23, 20251 years agoMIT

Similar Papers

Cite this paper

@article{honarpisheh2025frequency,
  title  = {Frequency Response Identification of Low-Order Systems: Finite-Sample Analysis},
  author = {Arya Honarpisheh and Mario Sznaier},
  year   = {2025},
  eprint = {2508.17142},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.17142v2}
}

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/2508.17142.svg)](https://codeofpaper.com/paper/2508.17142)

Discussion