mlsanityData to 14 Oct 2026

Finite-Sample Identification of Linear Regression Models with Residual-Permuted Sums

arXiv 2406.05440 ↗First posted 8 Jun 2024eess.SY cs.SY math.STcited by 1

Not on the map. Why?

Abstract (arXiv)

This letter studies a distribution-free, finite-sample data perturbation (DP) method, the Residual-Permuted Sums (RPS), which is an alternative of the Sign-Perturbed Sums (SPS) algorithm, to construct confidence regions. While SPS assumes independent (but potentially time-varying) noise terms which are symmetric about zero, RPS gets rid of the symmetricity assumption, but assumes i.i.d. noises. The main idea is that RPS permutes the residuals instead of perturbing their signs. This letter introduces RPS in a flexible way, which allows various design-choices. RPS has exact finite sample coverage probabilities and we provide the first proof that these permutation-based confidence regions are uniformly strongly consistent under general assumptions. This means that the RPS regions almost surely shrink around the true parameters as the sample size increases. The ellipsoidal outer-approximation (EOA) of SPS is also extended to RPS, and the effectiveness of RPS is validated by numerical experiments, as well.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 4 of its 12 references that are in the map. First posted on arXiv 8 Jun 2024.

Builds on

4 of 12 references.

References · 4

  1. 2023A Tutorial on the Non-Asymptotic Theory of System Identificationcited by 26
  2. 2018Sign-Perturbed Sums: A New System Identification Approach for Constructing Exact Non-Asymptotic Confidence Regions in Linear Regression Modelscited by 14
  3. 2014Perturbed Datasets Methods for Hypothesis Testing and Structure of Corresponding Confidence Setscited by 5
  4. 2015Sign-Perturbed Sums (SPS) with Instrumental Variables for the Identification of ARX Systems - Extended Versioncited by 5

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.