受控松弛(CLuP)算法的复杂性分析
Complexity analysis of the Controlled Loosening-up (CLuP) algorithm
摘要:
在我们的配套论文\cite{Stojnicclupint19}中,我们介绍了一种强大的机制,我们称之为受控放松(CLuP),用于处理MIMO ML检测问题。事实证明,该算法有许多显着的特点,其中之一,\emph{computational complexity},我们在本文中讨论的更详细。如在\cite{Stojnicclupint19}中所解释的,CLuP是迭代过程,其中每次迭代相当于求解简单的二次规划。这清楚地表明,其整体计算复杂性的关键因素是实现所需精度所需的迭代次数。正如在\cite{Stojnicclupint19}中所暗示的那样,这个数字似乎相当低,在一些最有趣的场景中,甚至往往不大于$10$。在这里,我们提供了一个随机对偶理论为基础的仔细分析,确实表明,一个非常小的迭代次数就足以实现出色的性能。通过数值实验获得的一组坚实的结果,以及显示出在一个很好的协议与理论分析预测。此外,与\cite{Stojnicclupint19}中的情况一样,我们再次只关注核心CLuP算法,但确实在几个场合提到,我们在这里介绍的概念与我们在\cite{Stojnicclupint19}中介绍的概念一样非常普遍,并且可以用于分析适用于最多样化科学领域的大量算法类别。在这些方向上的许多结果,我们将在我们的几个配套文件。
英文摘要:
In our companion paper \cite{Stojnicclupint19} we introduced a powerful mechanism that we referred to as the Controlled Loosening-up (CLuP) for handling MIMO ML-detection problems. It turned out that the algorithm has many remarkable features and one of them, the \emph{computational complexity}, we discuss in more details in this paper. As was explained in \cite{Stojnicclupint19}, the CLuP is an iterative procedure where each iteration amounts to solving a simple quadratic program. This clearly implies that the key contributing factor to its overall computational complexity is the number of iterations needed to achieve a required precision. As was also hinted in \cite{Stojnicclupint19}, that number seems to be fairly low and in some of the most interesting scenarios often not even larger than $10$. Here we provide a Random Duality Theory based careful analysis that indeed indicates that a very small number of iterations is sufficient to achieve an excellent performance. A solid set of results obtained through numerical experiments is presented as well and shown to be in a nice agreement with what the theoretical analysis predicts. Also, as was the case in \cite{Stojnicclupint19}, we again focus only on the core CLuP algorithm but do mention on several occasions that the concepts that we introduce here are as remarkably general as those that we introduced in \cite{Stojnicclupint19} and can be utilized in the analysis of a large number of classes of algorithms applicable in the most diverse of scientific fields. Many results in these directions we will present in several of our companion papers.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。