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

被引:0
|
作者
Szentpeteri, Szabolcs [1 ]
Csaji, Balazs Csanad [1 ,2 ]
机构
[1] Hungarian Res Network HUN REN, Inst Comp Sci & Control SZTAK, H-1111 Budapest, Hungary
[2] Eotvos Lorand Univ, Dept Probabil Theory & Stat, H-1053 Budapest, Hungary
来源
关键词
Noise; Linear regression; Vectors; Perturbation methods; System identification; Probability; Heuristic algorithms; Identification; linear systems; randomized algorithms;
D O I
10.1109/LCSYS.2024.3412856
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1523 / 1528
页数:6
相关论文
共 50 条