arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.01201cs.ITmath.ITmath.STstat.TH
收藏

用多胞形松弛启动CLuP

Starting CLuP with polytope relaxation

Mihailo Stojnic

摘要:

我们最近在\cite{Stojnicclupint19}中引入的受控松动(CLuP)机制是一个通用概念,可用于在多项式时间内解决一大类问题。由于它的核心依赖于迭代过程,因此其出色性能的关键在于执行整个算法所需的迭代次数通常非常少。在另一篇论文\cite{Stojnicclupcmpl19}中,我们给出了一个详细的复杂性分析,确实证实了相对较少的迭代次数。由于这两篇论文\cite{Stojnicclupint19}和\cite{Stojnicclupcmpl19}都是关于这个主题的介绍性论文,我们确保将最初的讨论限制在算法的核心,因此只关注算法的最基本版本。不过,我们多次强调,各种改进和进一步升级是可能的。在本文中,我们提出了在这个方向上的第一步,并讨论了一个非常简单的升级,可以在基本的CLuP机制之上引入。它涉及CLuP的开始,并建议将众所周知的所谓多面体松弛启发法(参见例如\cite{StojnicBBSD05,StojnicBBSD08})作为起点。我们将CLuP的这种变体称为CLuP-plt,并继续介绍其复杂性分析。在\cite{Stojnicclupcmpl19},一个特定的\textbf{\emph{complexity analysis per iteration level}}类型的复杂性分析的选择,并通过该算法的应用程序上著名的MIMO ML检测问题。正如预期的那样,分析证实了CLuP-plt的性能甚至优于原始CLuP。在一些最有趣的机制中,它通常在\textbf{\emph{first three iterations}}中实现出色的性能。我们还补充了一套坚实的数值实验的理论研究结果。

英文摘要:

The Controlled Loosening-up (CLuP) mechanism that we recently introduced in \cite{Stojnicclupint19} is a generic concept that can be utilized to solve a large class of problems in polynomial time. Since it relies in its core on an iterative procedure, the key to its excellent performance lies in a typically very small number of iterations needed to execute the entire algorithm. In a separate paper \cite{Stojnicclupcmpl19}, we presented a detailed complexity analysis that indeed confirms the relatively small number of iterations. Since both papers, \cite{Stojnicclupint19} and \cite{Stojnicclupcmpl19} are the introductory papers on the topic we made sure to limit the initial discussion just to the core of the algorithm and consequently focused only on the algorithm's most basic version. On numerous occasions though, we emphasized that various improvements and further upgrades are possible. In this paper we present a first step in this direction and discuss a very simple upgrade that can be introduced on top of the basic CLuP mechanism. It relates to the starting of the CLuP and suggests the well-known so-called polytope-relaxation heuristic (see, e.g. \cite{StojnicBBSD05,StojnicBBSD08}) as the starting point. We refer to this variant of CLuP as the CLuP-plt and proceed with the presentation of its complexity analysis. As in \cite{Stojnicclupcmpl19}, a particular \textbf{\emph{complexity analysis per iteration level}} type of complexity analysis is chosen and presented through the algorithm's application on the well-known MIMO ML detection problem. As expected, the analysis confirms that CLuP-plt performs even better than the original CLuP. In some of the most interesting regimes it often achieves within the \textbf{\emph{first three iterations}} an excellent performance. We also complement the theoretical findings with a solid set of numerical experiments.

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

↑