$\ell_0$的近似算法--低秩近似
Approximation Algorithms for $\ell_0$-Low Rank Approximation
摘要:
我们研究$\ell_0$ -低秩近似问题,目标是给定一个$m \times n$矩阵$A$,输出一个秩- $k$矩阵$A'$,使$\|A'-A\|_0$最小化.这里,对于矩阵$B$,$\|B\|_0$表示其非零项的数目。这种低秩近似的NP难变体对于没有底层度量的问题是很自然的,其目标是最小化不一致数据位置的数量。我们提供的近似算法,显着提高了以前的工作的运行时间和近似因子。对于$k > 1$,我们展示了如何找到,在聚$(mn)$时间为每个$k$,秩$O(k \log(n/k))$矩阵$A'$,其中$\|A'-A\|_0 \leq O(k^2 \log(n/k)) \mathrm{OPT}$。据我们所知,这是第一个算法与可证明的保证$\ell_0$ -低秩近似问题的$k > 1$,甚至双准则算法。对于$k = 1$时,我们得到了$(2+ε)$ -近似{ \it次线性时间},这是不可能的低秩近似的其他变体,如Frobenius规范。我们加强这一研究的情况下,二进制矩阵,以获得一个$(1+O(ψ))$ -近似在次线性时间,其中$ψ= \mathrm{OPT}/\lVert A\rVert_0$。对于小$ψ$,我们的近似因子是$1+o(1)$。
英文摘要:
We study the $\ell_0$-Low Rank Approximation Problem, where the goal is, given an $m \times n$ matrix $A$, to output a rank-$k$ matrix $A'$ for which $\|A'-A\|_0$ is minimized. Here, for a matrix $B$, $\|B\|_0$ denotes the number of its non-zero entries. This NP-hard variant of low rank approximation is natural for problems with no underlying metric, and its goal is to minimize the number of disagreeing data positions. We provide approximation algorithms which significantly improve the running time and approximation factor of previous work. For $k > 1$, we show how to find, in poly$(mn)$ time for every $k$, a rank $O(k \log(n/k))$ matrix $A'$ for which $\|A'-A\|_0 \leq O(k^2 \log(n/k)) \mathrm{OPT}$. To the best of our knowledge, this is the first algorithm with provable guarantees for the $\ell_0$-Low Rank Approximation Problem for $k > 1$, even for bicriteria algorithms. For the well-studied case when $k = 1$, we give a $(2+ε)$-approximation in {\it sublinear time}, which is impossible for other variants of low rank approximation such as for the Frobenius norm. We strengthen this for the well-studied case of binary matrices to obtain a $(1+O(ψ))$-approximation in sublinear time, where $ψ= \mathrm{OPT}/\lVert A\rVert_0$. For small $ψ$, our approximation factor is $1+o(1)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。