Low Permutation-rank Matrices: Structural Properties and Noisy Completion

by   Nihar B. Shah, et al.

We consider the problem of noisy matrix completion, in which the goal is to reconstruct a structured matrix whose entries are partially observed in noise. Standard approaches to this underdetermined inverse problem are based on assuming that the underlying matrix has low rank, or is well-approximated by a low rank matrix. In this paper, we propose a richer model based on what we term the "permutation-rank" of a matrix. We first describe how the classical non-negative rank model enforces restrictions that may be undesirable in practice, and how and these restrictions can be avoided by using the richer permutation-rank model. Second, we establish the minimax rates of estimation under the new permutation-based model, and prove that surprisingly, the minimax rates are equivalent up to logarithmic factors to those for estimation under the typical low rank model. Third, we analyze a computationally efficient singular-value-thresholding algorithm, known to be optimal for the low-rank setting, and show that it also simultaneously yields a consistent estimator for the low-permutation rank setting. Finally, we present various structural results characterizing the uniqueness of the permutation-rank decomposition, and characterizing convex approximations of the permutation-rank polytope.


page 1

page 2

page 3

page 4


Deep learned SVT: Unrolling singular value thresholding to obtain better MSE

Affine rank minimization problem is the generalized version of low rank ...

Bootstrap-Based Regularization for Low-Rank Matrix Estimation

We develop a flexible framework for low-rank matrix estimation that allo...

Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM

Permutation testing is a non-parametric method for obtaining the max nul...

A Permutation-based Model for Crowd Labeling: Optimal Estimation and Robustness

The aggregation and denoising of crowd labeled data is a task that has g...

Kissing to Find a Match: Efficient Low-Rank Permutation Representation

Permutation matrices play a key role in matching and assignment problems...

Minimax Rates and Efficient Algorithms for Noisy Sorting

There has been a recent surge of interest in studying permutation-based ...

Speeding up Permutation Testing in Neuroimaging

Multiple hypothesis testing is a significant problem in nearly all neuro...

Please sign up or login with your details

Forgot password? Click here to reset