返回
Robust least squares for quantized data matrices
DOI:10.1016/j.sigpro.2020.107711.png)
摘要
En 中文
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.5 x 10(-4). We show here that our robust method is theoretically appropriate, tractable, and performs favorably against ordinary and total least squares. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Least squares approximation
Quantization error
Ridge regression
Robust optimization
Subgradient methods
Tikhonov regularization
Total least squares
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
Understanding the Effect of Side Reactions on the Recyclability of Furan–Maleimide Resins Based on Thermoreversible Diels–Alder Network
Polymers
IF0
Long-Term Load Forecasting Approach Using Dynamic Feed-Forward Back-Propagation Artificial Neural Network基于动态前馈-反向传播人工神经网络的长期负荷预测方法


