A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure
- 7 January 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 26 (2) , 337-341
Abstract
In this paper, we introduce a novel and robust approach to Quantized Matrix Completion (QMC). First, we propose a rank minimization problem with constraints induced by quantization bounds. Next, we form an unconstrained optimization problem by regularizing the rank function with Huber loss. Huber loss is leveraged to control the violation from quantization bounds due to two properties: 1- It is differentiable, 2- It is less sensitive to outliers than the quadratic loss. A Smooth Rank Approximation is utilized to endorse lower rank on the genuine data matrix. Thus, an unconstrained optimization problem with differentiable objective function is obtained allowing us to advantage from Gradient Descent (GD) technique. Novel and firm theoretical analysis of the problem model and convergence of our algorithm to the global solution are provided. Another contribution of our work is that our method does not require projections or initial rank estimation, unlike the state-of-the-art. In the Numerical Experiments Section, the noticeable outperformance of our proposed method in learning accuracy and computational complexity compared to those of the state-of-the-art literature methods is illustrated as the main contribution.Keywords
All Related Versions
Funding Information
- Iran National Science Foundation
- Research Deputy of Sharif University of Technology
This publication has 17 references indexed in Scilit:
- Low-rank matrix recovery from quantized and erroneous measurements: Accuracy-preserved data privatization in power grids2016
- Noisy Matrix Completion Under Sparse Factor ModelsIEEE Transactions on Information Theory, 2016
- Randomized requantization with local differential privacy2016
- The MovieLens DatasetsACM Transactions on Interactive Intelligent Systems, 2015
- Categorical matrix completion2015
- Probabilistic low-rank matrix recovery from quantized measurements: Application to image denoising2015
- 1-Bit matrix completionInformation and Inference: A Journal of the IMA, 2014
- Matrix recovery from quantized and corrupted measurements2014
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009