Confidence Polytope with Guaranteed Probabilistic Lower Bounds in Linear Regression Model With Deterministic Regressor

This paper introduces a new method for constructing guaranteed probabilistic lower bounded confidence polytope in linear regression model with deterministic regressor. The proposed algorithm generates non-asymptotic confidence regions around the least-squares estimate, ensuring that the true parameter lies within the polytope with a lower bounded probability predetermined by the user. By drawing independent samples from the noise distribution and leveraging specific ordering properties of independent and identically distributed random variables, the method efficiently builds these confidence polytopes. A key assumption of the approach is the availability of a known joint density function for the noise, enabling accurate sampling. The performance and reliability of the method are demonstrated through a simulation of an FIR system, with comparisons to confidence regions obtained from other non-asymptotic system identification methods.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/icacr62205.2024.11053747
Primary Topic
Advanced Statistical Methods and Models
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Confidence Polytope with Guaranteed Probabilistic Lower Bounds in Linear Regression Model With Deterministic Regressor

Ligang Zheng, Xiaopuwen Wang, Ping Yue, Jintao Ding
Advanced Statistical Methods and Models
article

Confidence Polytope with Guaranteed Probabilistic Lower Bounds in Linear Regression Model With Deterministic Regressor

Ligang Zheng, Xiaopuwen Wang, Ping Yue, Jintao Ding
article en

Abstract

This paper introduces a new method for constructing guaranteed probabilistic lower bounded confidence polytope in linear regression model with deterministic regressor. The proposed algorithm generates non-asymptotic confidence regions around the least-squares estimate, ensuring that the true parameter lies within the polytope with a lower bounded probability predetermined by the user. By drawing independent samples from the noise distribution and leveraging specific ordering properties of independent and identically distributed random variables, the method efficiently builds these confidence polytopes. A key assumption of the approach is the availability of a known joint density function for the noise, enabling accurate sampling. The performance and reliability of the method are demonstrated through a simulation of an FIR system, with comparisons to confidence regions obtained from other non-asymptotic system identification methods.

Chengdu Technological University, Qingdao University of Technology (CN)
Openalex Percentile: Top 72%
Advanced Statistical Methods and Models
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Confidence Polytope with Guaranteed Probabilistic Lower Bounds in Linear Regression Model With Deterministic Regressor — Ligang Zheng, Xiaopuwen Wang, et al. · (2024) | TGRS Research Map | TGRS