Abstract
Recently, a new finite-sample system identification algorithm, called Sign-Perturbed Sums (SPS), was introduced in [2]. SPS constructs finite-sample confidence regions that are centered around the least squares estimate, and are guaranteed to contain the true system parameters with a user-chosen exact probability for any finite number of data points. The main assumption of SPS is that the noise terms are independent and symmetrically distributed about zero, but they do not have to be stationary, nor do their variances and distributions have to be known. Although it is easy to determine if a particular parameter belongs to the confidence region, it is not easy to describe the boundary of the region, and hence to compactly represent the exact confidence region. In this paper we show that an ellipsoidal outer-approximation of the SPS confidence region can be found by solving a convex optimization problem, and we illustrate the properties of the SPS region and the ellipsoidal outer-approximation in simulation examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
