关于稀疏最小二乘回归的一个注记
A note on sparse least-squares regression
摘要:
我们计算的经典最小二乘问题$\min_x||A x -b||,$,其中$A$是一个任意矩阵的\emph{sparse}解决方案。我们描述了一种新的算法,这个稀疏最小二乘问题。该算法的操作如下:首先,它从$A$中选择列,然后仅用所选列求解最小二乘问题。我们使用的列选择算法是已知的,以及研究列子集选择问题。这篇文章的贡献是表明,它给出了有利的结果,以及稀疏最小二乘。具体来说,我们证明了我们的算法得到的解决方案向量是接近的解决方案向量通过所谓的“SVD截断正则化方法”。
英文摘要:
We compute a \emph{sparse} solution to the classical least-squares problem $\min_x||A x -b||,$ where $A$ is an arbitrary matrix. We describe a novel algorithm for this sparse least-squares problem. The algorithm operates as follows: first, it selects columns from $A$, and then solves a least-squares problem only with the selected columns. The column selection algorithm that we use is known to perform well for the well studied column subset selection problem. The contribution of this article is to show that it gives favorable results for sparse least-squares as well. Specifically, we prove that the solution vector obtained by our algorithm is close to the solution vector obtained via what is known as the "SVD-truncated regularization approach".
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。