PhaST: Model-free Phaseless Subspace Tracking

Phaseless subspace tracking is the problem of recovering a time sequence of discrete signals from magnitude-only measurements of their linear projections, when the true signal lies in a low-dimensional subspace that can change with time. A typical assumption used in a lot of work is that the subspace changes gradually over time. We define this as (i) the maximum principal angle between the old and new subspaces is not too large (less than 90 degrees) or the number directions that changes is few or both; and (ii) the delay between subspace change times is large enough. This paper presents a novel algorithm, that we call PhaST, for model-free, mini- batch and fast Phaseless Subspace Tracking. We show via experiments that PhaST is significantly faster, and significantly more memory-efficient, than an existing algorithm for low- rank phase retrieval (which can be interpreted as a batch version of phaseless subspace tracking that does not assume anything about subspace changes). When fewer measurements are available, it also has significantly better recovery performance than both LRPR and single signal phase retrieval methods when its structural assumptions are valid.

[1]  Max Simchowitz,et al.  Low-rank Solutions of Linear Matrix Equations via Procrustes Flow , 2015, ICML.

[2]  John D. Lafferty,et al.  A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements , 2015, NIPS.

[3]  Namrata Vaswani,et al.  PHASELESS SUBSPACE TRACKING , 2018, 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[4]  Yonina C. Eldar,et al.  Sparsity-Based Single-Shot Sub-Wavelength Coherent Diffractive Imaging , 2011 .

[5]  Namrata Vaswani,et al.  Recursive Robust PCA or Recursive Sparse Recovery in Large but Structured Noise , 2012, IEEE Transactions on Information Theory.

[6]  Namrata Vaswani,et al.  NEARLY OPTIMAL ROBUST SUBSPACE TRACKING: A UNIFIED APPROACH , 2017, 2018 IEEE Data Science Workshop (DSW).

[7]  Yonina C. Eldar,et al.  Low-Rank Phase Retrieval , 2016, IEEE Transactions on Signal Processing.

[8]  Yonina C. Eldar,et al.  GESPAR: Efficient Phase Retrieval of Sparse Signals , 2013, IEEE Transactions on Signal Processing.

[9]  Babak Hassibi,et al.  Recovery of sparse 1-D signals from the magnitudes of their Fourier transform , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[10]  Namrata Vaswani,et al.  Provable Dynamic Robust PCA or Robust Subspace Tracking , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).

[11]  Yuxin Chen,et al.  Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems , 2015, NIPS.