arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.01515cs.CG
收藏

高维凸包的鲁棒顶点计数

Robust Vertex Enumeration for Convex Hulls in High Dimensions

Pranjal Awasthi, Bahman Kalantari, Yikai Zhang

摘要:

计算$\mathbb{R} ^m$中$n$点的集合$S$的凸包的顶点是计算几何、优化、机器学习等中的基本问题。我们提出了“全顶点三角形算法”(AVTA),一个强大的和有效的算法计算$conv(S)$的所有$K$顶点的子集$\overline S$,$S$的凸包。如果$Γ_*$是从每个顶点到其余顶点的凸包的距离的最小值,则给定任何$γ\leq γ_* = Γ_*/R$,$R$是$S$的直径,$AVTA$在$O(nK(m+ γ^{-2}))$运算中计算$\overline S$。如果$γ_*$未知但$K$已知,AVTA将在$O(nK(m+ γ_*^{-2})) \log(γ_*^{-1})$操作中计算$\overline S$。更一般地,给定$t \in (0,1)$,AVTA在$O(n |\overline S^t|(m+ t^{-2}))$运算中计算$\overline S$的子集$\overline S^t$,其中任何$p \in conv(S)$到$conv(\overline S^t)$之间的距离至多为$t R$。接下来我们考虑AVTA,其中输入是PDMATHBNF,PDMATHBMM的PDMATHBNG扰动。假设$\varepsilon$上的最小$conv(S)$的顶点的距离$S$的剩余点的凸包的约束,我们推导出类似的计算$\overline S_\varepsilon$的复杂性边界。我们还分析了$S$或$S_\varepsilon$的随机投影下的AVTA。最后,通过AVTA,我们为两个流行的机器学习问题设计了新的实用算法:主题建模和非负矩阵分解。对于主题模型,AVTA导致主题词矩阵的重构明显优于最新技术的方法~ \cite{arora2013practical, bansal2014provable}。对于非负矩阵,AVTA与现有方法\cite{arora2012computing}相比具有竞争力。经验上AVTA是鲁棒的,并且可以处理比现有方法更大量的噪声。

英文摘要:

Computation of the vertices of the convex hull of a set $S$ of $n$ points in $\mathbb{R} ^m$ is a fundamental problem in computational geometry, optimization, machine learning and more. We present "All Vertex Triangle Algorithm" (AVTA), a robust and efficient algorithm for computing the subset $\overline S$ of all $K$ vertices of $conv(S)$, the convex hull of $S$. If $Γ_*$ is the minimum of the distances from each vertex to the convex hull of the remaining vertices, given any $γ\leq γ_* = Γ_*/R$, $R$ the diameter of $S$, $AVTA$ computes $\overline S$ in $O(nK(m+ γ^{-2}))$ operations. If $γ_*$ is unknown but $K$ is known, AVTA computes $\overline S$ in $O(nK(m+ γ_*^{-2})) \log(γ_*^{-1})$ operations. More generally, given $t \in (0,1)$, AVTA computes a subset $\overline S^t$ of $\overline S$ in $O(n |\overline S^t|(m+ t^{-2}))$ operations, where the distance between any $p \in conv(S)$ to $conv(\overline S^t)$ is at most $t R$. Next we consider AVTA where input is $S_\varepsilon$, an $\varepsilon$ perturbation of $S$. Assuming a bound on $\varepsilon$ in terms of the minimum of the distances of vertices of $conv(S)$ to the convex hull of the remaining point of $S$, we derive analogous complexity bounds for computing $\overline S_\varepsilon$. We also analyze AVTA under random projections of $S$ or $S_\varepsilon$. Finally, via AVTA we design new practical algorithms for two popular machine learning problems: topic modeling and non-negative matrix factorization. For topic models AVTA leads to significantly better reconstruction of the topic-word matrix than state of the art approaches~\cite{arora2013practical, bansal2014provable}. For non-negative matrix AVTA is competitive with existing methods~\cite{arora2012computing}. Empirically AVTA is robust and can handle larger amounts of noise than existing methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑