立方体上的稀疏逼近
Sparse Approximation Over the Cube
摘要:
对NP难极小化问题$\min \{\|b - Ax\|_2: \ x \in [0,1]^n, | \text{supp}(x) | \leq σ\}$进行了分析,其中$\text{supp}(x) = \{i \in [n]: x_i \neq 0\}$和$σ$均为正整数.研究的对象是一个自然的放松,我们用$\sum_i x_i \leq σ$代替$| \text{supp}(x) | \leq σ$。我们的分析包括一个概率的观点时,放松是准确的。我们还考虑从确定性的角度来看问题,并提供了一个约束的图像之间的距离的最优解的原始问题和它的松弛下$A$。这导致了通用矩阵$A \in \mathbb{Z}^{m \times n}$的算法,并实现了多项式的运行时间,只要$m$和$\|A\|_{\infty}$是固定的。
英文摘要:
This paper presents an anlysis of the NP-hard minimization problem $\min \{\|b - Ax\|_2: \ x \in [0,1]^n, | \text{supp}(x) | \leq σ\}$, where $\text{supp}(x) = \{i \in [n]: x_i \neq 0\}$ and $σ$ is a positive integer. The object of investigation is a natural relaxation where we replace $| \text{supp}(x) | \leq σ$ by $\sum_i x_i \leq σ$. Our analysis includes a probabilistic view on when the relaxation is exact. We also consider the problem from a deterministic point of view and provide a bound on the distance between the images of optimal solutions of the original problem and its relaxation under $A$. This leads to an algorithm for generic matrices $A \in \mathbb{Z}^{m \times n}$ and achieves a polynomial running time provided that $m$ and $\|A\|_{\infty}$ are fixed.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。