Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 147 tok/s
Gemini 2.5 Pro 42 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 28 tok/s Pro
GPT-4o 81 tok/s Pro
Kimi K2 190 tok/s Pro
GPT OSS 120B 449 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Kernel-Based Identification with Frequency Domain Side-Information (2111.00410v2)

Published 31 Oct 2021 in math.OC, cs.SY, eess.SP, and eess.SY

Abstract: In this paper, we discuss the problem of system identification when frequency domain side information is available on the system. Initially, we consider the case where the prior knowledge is provided as being the $\Hcal_{\infty}$-norm of the system bounded by a given scalar. This framework provides the opportunity of considering various forms of side information such as the dissipativity of the system as well as other forms of frequency domain prior knowledge. We propose a nonparametric identification method for estimating the impulse response of the system under the given side information. The estimation problem is formulated as an optimization in a reproducing kernel Hilbert space (RKHS) endowed with a stable kernel. The corresponding objective function consists of a term for minimizing the fitting error, and a regularization term defined based on the norm of the impulse response in the employed RKHS. To guarantee the desired frequency domain features defined based on the prior knowledge, suitable constraints are imposed on the estimation problem. The resulting optimization has an infinite-dimensional feasible set with an infinite number of constraints. We show that this problem is a well-defined convex program with a unique solution. We propose a heuristic that tightly approximates this unique solution. The proposed approach is equivalent to solving a finite-dimensional convex quadratically constrained quadratic program. The efficiency of the discussed method is verified by several numerical examples.

Citations (10)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.