Locally Permuted Low Rank Column-wise Sensing
Signal Processing
2025-09-15 v1 Information Theory
math.IT
Abstract
We precisely formulate, and provide a solution for, the Low Rank Columnwise Sensing (LRCS) problem when some of the observed data is scrambled/permuted/unlabeled. This problem, which we refer to as permuted LRCS, lies at the intersection of two distinct topics of recent research: unlabeled sensing and low rank column-wise (matrix) sensing. We introduce a novel generalization of the recently developed Alternating Gradient Descent and Minimization (AltGDMin) algorithm to solve this problem. We also develop an alternating minimization (AltMin) solution. We show, using simulation experiments, that both converge but PermutedAltGDmin is much faster than Permuted-AltMin.
Cite
@article{arxiv.2509.09820,
title = {Locally Permuted Low Rank Column-wise Sensing},
author = {Ahmed Ali Abbasi and Namrata Vaswani},
journal= {arXiv preprint arXiv:2509.09820},
year = {2025}
}