← 研踪 PaperTrailarXiv:2611.23431 · v1
The Spectral Distribution of Matrix Least Squares Solutions, and the Ellipsoid Fitting Problem
首次提交 2026-11-18 03:35
版本更新 2026-11-18 03:35
雷达观测 2026-11-19 19:08
摘要
We study the spectral distribution of the least squares solution to a random linear system whose unknown is a symmetric matrix. In the normalized and isotropic setting, we derive a closed-form description of the support of the spectral distribution. As an application, we consider the ellipsoid fitting problem: given standard Gaussian vectors in , does there exist a centered ellipsoid passing through all of them? It was recently shown that this problem has a sharp phase transition at . On the satisfiability side, unlike earlier results, these sharp results do not rely on least squares candidates. We show that the least squares candidates considered in earlier works have a threshold of positive semi-definiteness at , which was previously observed numerically and predicted non-rigorously using statistical physics methods. Moreover, we show that the corresponding least squares dual certificates have a threshold of positive definiteness at . Our approach combines several matrix concentration tools. A key technical ingredient, which may be of independent interest, is showing that a certain kernel matrix is well-conditioned with high probability until .
作者备注:40 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 03:35 · 最新观测版本
The Spectral Distribution of Matrix Least Squares Solutions, and the Ellipsoid Fitting Problem
We study the spectral distribution of the least squares solution to a random linear system whose unknown is a symmetric matrix. In the normalized and isotropic setting, we derive a closed-form description of the support of the spectral distribution. As an application, we consider the ellipsoid fitting problem: given standard Gaussian vectors in , does there exist a centered ellipsoid passing through all of them? It was recently shown that this problem has a sharp phase transition at . On the satisfiability side, unlike earlier results, these sharp results do not rely on least squares candidates. We show that the least squares candidates considered in earlier works have a threshold of positive semi-definiteness at , which was previously observed numerically and predicted non-rigorously using statistical physics methods. Moreover, we show that the corresponding least squares dual certificates have a threshold of positive definiteness at . Our approach combines several matrix concentration tools. A key technical ingredient, which may be of independent interest, is showing that a certain kernel matrix is well-conditioned with high probability until .
查看此版本解读 →查看此版本原文 ↗