# Interpretable Matrix Completion: A Discrete Optimization Approach

17 Dec 2018Dimitris BertsimasMichael Lingzhi Li

We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information... (read more)

PDF Abstract

No code implementations yet. Submit your code now