Robust Least Squares for Quantized Data Matrices
From MaRDI portal
Publication:6337476
DOI10.1016/J.SIGPRO.2020.107711arXiv2003.12004MaRDI QIDQ6337476FDOQ6337476
Authors: Richard Clancy, S. Becker 
Publication date: 26 March 2020
Abstract: In this paper we formulate and solve a robust least squares problem for a system of linear equations subject to quantization error in the data matrix. Ordinary least squares fails to consider uncertainty in the operator, modeling all noise in the observed signal. Total least squares accounts for uncertainty in the data matrix, but necessarily increases the condition number of the operator compared to ordinary least squares. Tikhonov regularization or ridge regression is frequently employed to combat ill-conditioning, but requires parameter tuning which presents a host of challenges and places strong assumptions on parameter prior distributions. The proposed method also requires selection of a parameter, but it can be chosen in a natural way, e.g., a matrix rounded to the 4th digit uses an uncertainty bounding parameter of 0.5e-4. We show here that our robust method is theoretically appropriate, tractable, and performs favorably against ordinary and total least squares.
This page was built for publication: Robust Least Squares for Quantized Data Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337476)
