Discrete-Aware Matrix Completion via Proximal Gradient
Signal Processing
2020-06-09 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2006.04075,
title = {Discrete-Aware Matrix Completion via Proximal Gradient},
author = {Hiroki Iimori and Giuseppe Thadeu Freitas de Abreu and Omid Taghizadeh and Koji Ishibashi},
journal= {arXiv preprint arXiv:2006.04075},
year = {2020}
}
Comments
5 pages, 2 figures, submitted to an IEEE conference