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

重新定相CLuP

Rephased CLuP

Mihailo Stojnic

摘要:

在\cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}中,我们引入了CLuP,这是一种基于\bl{\textbf{Random Duality Theory (RDT)}}的算法机制,可用于解决困难的优化问题。由于其介绍性质,\cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19}讨论了最基本的CLuP概念。另一方面,在我们的配套论文\cite{Stojniccluplargesc20}中,我们开始深入研究与许多其他显着的CLuP属性相关的更深层次的细节,其中一些远远超出了基本原理。也就是说,\cite{Stojniccluplargesc20}讨论了如何利用一个有点沉默的RDT特性(它的算法能力)来确保CLuP也可以在非常大的问题实例上运行。特别是,将CLuP应用于著名的MIMO ML检测问题,我们在\cite{Stojniccluplargesc20}中表明,它的大规模变体$\text{CLuP}^{r_0}$可以轻松处理未知数的\textbf{\emph{several thousands}}问题,理论上每次迭代的复杂度最小(只需一个矩阵向量乘法)。在本文中,我们重新审视MIMO ML检测,并讨论CLuP结构中出现的另一个显着现象,即所谓的\bl{\textbf{\emph{rephasing}}}。随着MIMO ML进入所谓的低$α$状态(行和列的数量比$α$远低于$1$的胖系统矩阵),即使是基本标准CLuP也越来越难以处理它。然而,重新定相的发现确保了CLuP保持在正轨上,并保持了其实现ML性能的能力。为了证明重定相的力量,我们还进行了相当多的数值实验,比较我们通过它们获得的结果与理论预测,并观察到一个很好的协议。

英文摘要:

In \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19} we introduced CLuP, a \bl{\textbf{Random Duality Theory (RDT)}} based algorithmic mechanism that can be used for solving hard optimization problems. Due to their introductory nature, \cite{Stojnicclupint19,Stojnicclupcmpl19,Stojnicclupplt19} discuss the most fundamental CLuP concepts. On the other hand, in our companion paper \cite{Stojniccluplargesc20} we started the story of going into a bit deeper details that relate to many of other remarkable CLuP properties with some of them reaching well beyond the basic fundamentals. Namely, \cite{Stojniccluplargesc20} discusses how a somewhat silent RDT feature (its algorithmic power) can be utilized to ensure that CLuP can be run on very large problem instances as well. In particular, applying CLuP to the famous MIMO ML detection problem we showed in \cite{Stojniccluplargesc20} that its a large scale variant, $\text{CLuP}^{r_0}$, can handle with ease problems with \textbf{\emph{several thousands}} of unknowns with theoretically minimal complexity per iteration (only a single matrix-vector multiplication suffices). In this paper we revisit MIMO ML detection and discuss another remarkable phenomenon that emerges within the CLuP structure, namely the so-called \bl{\textbf{\emph{rephasing}}}. As MIMO ML enters the so-called low $α$ regime (fat system matrix with ratio of the number of rows and columns, $α$, going well below $1$) it becomes increasingly difficult even for the basic standard CLuP to handle it. However, the discovery of the rephasing ensures that CLuP remains on track and preserves its ability to achieve the ML performance. To demonstrate the power of the rephasing we also conducted quite a few numerical experiments, compared the results we obtained through them to the theoretical predictions, and observed an excellent agreement.

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

↑