论文标题
通过近端梯度完成离散意识的矩阵完成
Discrete-Aware Matrix Completion via Proximal Gradient
论文作者
论文摘要
我们提出了一种新的算法，用于完成低级矩阵的条目仅限于有限的离散字母。所提出的方法基于最近出现的优化理论近端梯度（PG）框架，此处用于求解完整问题的正则公式，该公式包括一个术语，该术语执行了MATRIX条目的离散字母成员。
We present a novel algorithm for the completion of low-rank matrices whose entries are limited to a finite discrete alphabet. The proposed method is based on the recently-emerged proximal gradient (PG) framework of optimization theory, which is applied here to solve a regularized formulation of the completion problem that includes a term enforcing the discrete-alphabet membership of the matrix entries.
