欠定线性方程组的最简解法
The Simplest Solution to an Underdetermined System of Linear Equations
摘要:
考虑一个d*n矩阵A,其中d<n。在y=Ax中求解x的问题是欠定的,并且有无穷多个解(如果有的话)。给定y,输入x的最小柯尔莫哥洛夫复杂度解(MKCS)被定义为具有满足y=Az的最小柯尔莫哥洛夫复杂度的输入z(在许多输入中)。如果实际输入足够简单,那么MKCS将准确地恢复输入。本文提出了一个初步的研究的复杂性水平的存在和价值,这种基于复杂性的恢复是可能的。结果表明,对于所有d*n个二进制矩阵(元素为0或1,且d<n)的集合,只要输入的Kolmogorov复杂度为O(d),MKCS就能精确地恢复绝大多数矩阵的输入.一个弱的逆,是松散的log n因子也建立了这种情况下。最后,我们调查的困难,找到一个矩阵,具有恢复输入的复杂性为O(d)使用MKCS的属性。
英文摘要:
Consider a d*n matrix A, with d<n. The problem of solving for x in y=Ax is underdetermined, and has infinitely many solutions (if there are any). Given y, the minimum Kolmogorov complexity solution (MKCS) of the input x is defined to be an input z (out of many) with minimum Kolmogorov-complexity that satisfies y=Az. One expects that if the actual input is simple enough, then MKCS will recover the input exactly. This paper presents a preliminary study of the existence and value of the complexity level up to which such a complexity-based recovery is possible. It is shown that for the set of all d*n binary matrices (with entries 0 or 1 and d<n), MKCS exactly recovers the input for an overwhelming fraction of the matrices provided the Kolmogorov complexity of the input is O(d). A weak converse that is loose by a log n factor is also established for this case. Finally, we investigate the difficulty of finding a matrix that has the property of recovering inputs with complexity of O(d) using MKCS.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。