计算非负秩的单指数时间算法
A Singly-Exponential Time Algorithm for Computing Nonnegative Rank
摘要:
本文给出了一个判定维数为$m \times n$的矩阵$M$的非负秩至多为在时间上运行的$(nm)^{O(r^2)}$的$r$的算法。这是$r$中第一个在时间上以单指数方式运行的精确算法。这个算法(和早期的算法)是建立在寻找多项式不等式系统(如果存在)的解决方案的方法上的。值得注意的是,这个任务的最佳算法在变量数量上是时间指数的,但在所有其他参数(不等式的数量和最大程度)上是多项式的。因此,这些算法激发自然的代数问题,其解决方案有直接的{ \em算法}的影响:我们需要多少变量来表示决策问题,$M$有非负秩最多$r$?一个简单的公式使用$nr + mr$变量,并产生一个算法,即使对于常数$r$,该算法在$n$和$m$中也是指数的。(Arora,Ge,Kannan,Moitra,STOC 2012)最近将变量的数量减少到$2r^2 2^r$,这里我们将变量的数量指数减少到$2r^2$,这产生了我们的主要算法。事实上,我们得到的算法是接近最优的(在指数时间假设下),因为在时间$(nm)^{o(r)}$中运行的算法将产生3-SAT的次指数算法。我们的主要结果是基于建立一个正规形式的非负矩阵分解-这反过来又使我们能够利用代数依赖之间的大量收集的线性变换与变量条目。此外,我们还证明,非负秩不能证明,即使是一个非常大的子矩阵的$M$,这个属性也遵循从观察非负秩通过镜头系统的多项式不等式的直觉。
英文摘要:
Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$. This is the first exact algorithm that runs in time singly-exponential in $r$. This algorithm (and earlier algorithms) are built on methods for finding a solution to a system of polynomial inequalities (if one exists). Notably, the best algorithms for this task run in time exponential in the number of variables but polynomial in all of the other parameters (the number of inequalities and the maximum degree). Hence these algorithms motivate natural algebraic questions whose solution have immediate {\em algorithmic} implications: How many variables do we need to represent the decision problem, does $M$ have nonnegative rank at most $r$? A naive formulation uses $nr + mr$ variables and yields an algorithm that is exponential in $n$ and $m$ even for constant $r$. (Arora, Ge, Kannan, Moitra, STOC 2012) recently reduced the number of variables to $2r^2 2^r$, and here we exponentially reduce the number of variables to $2r^2$ and this yields our main algorithm. In fact, the algorithm that we obtain is nearly-optimal (under the Exponential Time Hypothesis) since an algorithm that runs in time $(nm)^{o(r)}$ would yield a subexponential algorithm for 3-SAT . Our main result is based on establishing a normal form for nonnegative matrix factorization - which in turn allows us to exploit algebraic dependence among a large collection of linear transformations with variable entries. Additionally, we also demonstrate that nonnegative rank cannot be certified by even a very large submatrix of $M$, and this property also follows from the intuition gained from viewing nonnegative rank through the lens of systems of polynomial inequalities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。