Papers › Unlabeled Sensing Using Rank-One Moment Matrix Completion
Unlabeled Sensing Using Rank-One Moment Matrix Completion
Hao Liang, Jingyu Lu, Manolis C. Tsakiris, Lihong Zhi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the unlabeled sensing problem that aims to solve a linear system of equations A x =π(y) for an unknown permutation π. For a generic matrix A and a generic vector y, we construct a system of polynomial equations whose unique solution satisfies Aξ^*=π(y). In particular, ξ^* can be recovered by solving the rank-one moment matrix completion problem. We propose symbolic and numeric algorithms to compute the unique solution. Some numerical experiments are conducted to show the efficiency and robustness of the proposed algorithms.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections