A Deterministic Theory for Exact Non-Convex Phase Retrieval

被引:11
|
作者
Yonel, Bariscan [1 ]
Yazici, Birsen [1 ]
机构
[1] Rensselaer Polytech Inst, Dept Elect Comp & Syst Engn, Troy, NY 12180 USA
基金
美国国家科学基金会;
关键词
Wirtinger Flow; non-convex optimization; low rank matrix recovery; phase retrieval; lifting; exact recovery; SIGNAL RECOVERY; MATRIX; ALGORITHM; PROOF; SPACE;
D O I
10.1109/TSP.2020.3007967
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we analyze the non-convex framework of Wirtinger Flow (WF) for phase retrieval and identify a novel sufficient condition for universal exact recovery through the lens of low rank matrix recovery theory. Via a perspective in the lifted domain, we show that the WF iterates converge to a true solution with fully deterministic arguments under a single condition on the lifted forward model. To this end, a geometric relationship between between the accuracy of spectral initialization and the validity of the regularity condition is derived. In particular, we determine that a certain concentration property on the spectral matrix must hold uniformly with a sufficiently tight constant. This culminates into a sufficient condition that is equivalent to a restricted isometry-type property over rank-1, positive semi-definite matrices, and amounts to a less stringent requirement on the lifted forward model than those of prominent low-rank-matrix-recovery methods in the literature. We characterize the performance limits of our framework in terms of the tightness of the concentration property via novel bounds on the convergence rate and on the signal-to-noise ratio such that the theoretical guarantees are valid using the spectral initialization at the proper sample complexity.
引用
收藏
页码:4612 / 4626
页数:15
相关论文
共 50 条
  • [41] Convex Non-Convex Segmentation over Surfaces
    Huska, Martin
    Lanza, Alessandro
    Morigi, Serena
    Sgallari, Fiorella
    [J]. SCALE SPACE AND VARIATIONAL METHODS IN COMPUTER VISION, SSVM 2017, 2017, 10302 : 348 - 360
  • [42] NON-CONVEX MINIMIZATION PROBLEMS
    EKELAND, I
    [J]. BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1979, 1 (03) : 443 - 474
  • [43] Algebraic signatures of convex and non-convex codes
    Curto, Carina
    Gross, Elizabeth
    Jeffries, Jack
    Morrison, Katherine
    Rosen, Zvi
    Shiu, Anne
    Youngs, Nora
    [J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 2019, 223 (09) : 3919 - 3940
  • [44] A Study on GMLVQ Convex and Non-convex Regularization
    Nova, David
    Estevez, Pablo A.
    [J]. ADVANCES IN SELF-ORGANIZING MAPS AND LEARNING VECTOR QUANTIZATION, WSOM 2016, 2016, 428 : 305 - 314
  • [45] A Non-Convex Zones Identification Method for Non-Linear Non-Convex Constraints Applied to LP
    Huerta Balcazar, Emanuel
    Cerda, Jaime
    Ramirez, Salvador
    [J]. 2019 IEEE INTERNATIONAL AUTUMN MEETING ON POWER, ELECTRONICS AND COMPUTING (ROPEC 2019), 2019,
  • [46] Non-Convex Multipartite Ferromagnets
    Giuseppe Genovese
    Daniele Tantari
    [J]. Journal of Statistical Physics, 2016, 163 : 492 - 513
  • [47] Minimal non-convex words
    Provencal, Xavier
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (27) : 3002 - 3009
  • [48] Non-convex Representations of Graphs
    Di Battista, Giuseppe
    Frati, Fabrizio
    Patrignani, Maurizio
    [J]. GRAPH DRAWING, 2009, 5417 : 390 - 395
  • [49] Non-Convex Optimization: A Review
    Trehan, Dhruv
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS 2020), 2020, : 418 - 423
  • [50] Evolution by Non-Convex Functionals
    Elbau, Peter
    Grasmair, Markus
    Lenzen, Frank
    Scherzer, Otmar
    [J]. NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2010, 31 (04) : 489 - 517