# Discrete-Aware Matrix Completion via Proximal Gradient

arXiv: https://arxiv.org/abs/2006.04075 · HTML: https://mlsanity.com/paper/2006.04075/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 7 Jun 2020.

## Built on by (most cited first, 2 of 2)

- [Discrete Aware Matrix Completion via Convexized ℓ0-Norm Approximation](https://mlsanity.com/paper/2405.02101/) (2024)
- [Low Rank Tensor Completion via Adaptive ADMM](https://mlsanity.com/paper/2605.03736/) (2026)

## Abstract (arXiv)

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.