Plücker关系的推广及其在子行列式极大化中的应用
An Extension of Plücker Relations with Applications to Subdeterminant Maximization
摘要:
给定矩阵$A$和$k\geq 0$,研究了求$A$的行列式绝对值最大的$k\times k$子矩阵的问题.这个问题的动机是计算遗传差异[LSV 86]的基于行列式的下限的问题,这后来也被证明是一个近似的上限[Mat 13]。$k$与$A$的一个维度一致的特殊情况已经被广泛研究。[尼克15]给了一个$2^{O(k)}$ -近似算法为这种特殊情况下,匹配已知的下限,他还提出了一个开放的问题,设计近似算法的一般情况。我们对回答这个问题的进展,给出了第一个有效的近似算法一般$k\times k$子行列式最大化的近似比,只依赖于$k$。我们的算法发现一个$k^{O(k)}$ -近似的解决方案,通过执行一个简单的本地搜索。我们的主要技术贡献,使分析的近似比,是一个扩展的Plücker关系的格拉斯曼,这可能是独立的利益; Plücker关系是二次多项式方程涉及一组$k\times k$ subdeterminants的$k\times n$矩阵。我们发现这些关系的推广到一般$m\times n$矩阵的$k\times k$子行列式。
英文摘要:
Given a matrix $A$ and $k\geq 0$, we study the problem of finding the $k\times k$ submatrix of $A$ with the maximum determinant in absolute value. This problem is motivated by the question of computing the determinant-based lower bound of [LSV86] on hereditary discrepancy, which was later shown to be an approximate upper bound as well [Mat13]. The special case where $k$ coincides with one of the dimensions of $A$ has been extensively studied. [Nik15] gave a $2^{O(k)}$-approximation algorithm for this special case, matching known lower bounds; he also raised as an open problem the question of designing approximation algorithms for the general case. We make progress towards answering this question by giving the first efficient approximation algorithm for general $k\times k$ subdeterminant maximization with an approximation ratio that depends only on $k$. Our algorithm finds a $k^{O(k)}$-approximate solution by performing a simple local search. Our main technical contribution, enabling the analysis of the approximation ratio, is an extension of Plücker relations for the Grassmannian, which may be of independent interest; Plücker relations are quadratic polynomial equations involving the set of $k\times k$ subdeterminants of a $k\times n$ matrix. We find an extension of these relations to $k\times k$ subdeterminants of general $m\times n$ matrices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。