{"id":"https://openalex.org/W7081978547","doi":"https://doi.org/10.1109/tit.2025.3609564","title":"A Sample Efficient Alternating Minimization-Based Algorithm for Robust Phase Retrieval","display_name":"A Sample Efficient Alternating Minimization-Based Algorithm for Robust Phase Retrieval","publication_year":2025,"publication_date":"2025-09-12","ids":{"openalex":"https://openalex.org/W7081978547","doi":"https://doi.org/10.1109/tit.2025.3609564"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2025.3609564","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3609564","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Adarsh Barik","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Adarsh Barik","raw_affiliation_strings":["Institute of Data Science, National University of Singapore, Queenstown, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Data Science, National University of Singapore, Queenstown, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Anand Krishna","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Anand Krishna","raw_affiliation_strings":["Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":null,"display_name":"Vincent Y. F. Tan","orcid":"https://orcid.org/0000-0002-5008-4527"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Vincent Y. F. Tan","raw_affiliation_strings":["Department of Mathematics and the Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-5008-4527","affiliations":[{"raw_affiliation_string":"Department of Mathematics and the Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.57101032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"71","issue":"11","first_page":"9116","last_page":"9133"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12157","display_name":"Geochemistry and Geologic Mapping","score":0.6726999878883362,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12157","display_name":"Geochemistry and Geologic Mapping","score":0.6726999878883362,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13067","display_name":"Geological Modeling and Analysis","score":0.024299999698996544,"subfield":{"id":"https://openalex.org/subfields/1906","display_name":"Geochemistry and Petrology"},"field":{"id":"https://openalex.org/fields/19","display_name":"Earth and Planetary Sciences"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14311","display_name":"Electrical and Electromagnetic Research","score":0.019200000911951065,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.7034000158309937},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5654000043869019},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5533000230789185},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5084999799728394},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48350000381469727},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.46219998598098755},{"id":"https://openalex.org/keywords/outlier","display_name":"Outlier","score":0.42489999532699585},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.3970000147819519},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.39559999108314514}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7034000158309937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6503999829292297},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5654000043869019},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5533000230789185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5184000134468079},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5084999799728394},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48350000381469727},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.46219998598098755},{"id":"https://openalex.org/C79337645","wikidata":"https://www.wikidata.org/wiki/Q779824","display_name":"Outlier","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.3970000147819519},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C81793267","wikidata":"https://www.wikidata.org/wiki/Q7180962","display_name":"Phase retrieval","level":3,"score":0.38760000467300415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.375},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3407000005245209},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.337799996137619},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.335999995470047},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.2727999985218048},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.26409998536109924},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C70958404","wikidata":"https://www.wikidata.org/wiki/Q7512728","display_name":"Signal reconstruction","level":4,"score":0.2590999901294708},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2025.3609564","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2025.3609564","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1259428066","display_name":null,"funder_award_id":"AISG2-RP-2020-018","funder_id":"https://openalex.org/F4320320709","funder_display_name":"National Research Foundation Singapore"},{"id":"https://openalex.org/G7806535718","display_name":null,"funder_award_id":"A-8000423-00-00","funder_id":"https://openalex.org/F4320324070","funder_display_name":"Ministry of Education and Research, Romania"}],"funders":[{"id":"https://openalex.org/F4320320709","display_name":"National Research Foundation Singapore","ror":"https://ror.org/03cpyc314"},{"id":"https://openalex.org/F4320324070","display_name":"Ministry of Education and Research, Romania","ror":"https://ror.org/00dh5gw98"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W136966946","https://openalex.org/W1562147356","https://openalex.org/W2007593159","https://openalex.org/W2009941369","https://openalex.org/W2044613770","https://openalex.org/W2053468479","https://openalex.org/W2077647472","https://openalex.org/W2078397124","https://openalex.org/W2103012681","https://openalex.org/W2133105246","https://openalex.org/W2142949395","https://openalex.org/W2145080587","https://openalex.org/W2155434899","https://openalex.org/W2169501582","https://openalex.org/W2224829387","https://openalex.org/W2283023501","https://openalex.org/W2542482481","https://openalex.org/W2790687101","https://openalex.org/W2806473647","https://openalex.org/W2962941403","https://openalex.org/W2963443408","https://openalex.org/W2964262188","https://openalex.org/W3091852560","https://openalex.org/W3167602277","https://openalex.org/W4313525046","https://openalex.org/W4378979031"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3],"study":[4],"the":[5,11,25,66,70,82,96,100,113],"robust":[6],"phase":[7,104],"retrieval":[8,105],"problem":[9,49],"where":[10],"task":[12],"is":[13],"to":[14],"recover":[15],"an":[16,36,42,61,78],"unknown":[17],"signal$\\boldsymbol":[18],"{\\theta":[19,58],"}^{*}":[20],"\\in":[21],"\\mathbb":[22],"{R}":[23],"^{d}$in":[24],"presence":[26],"of":[27,65,72,81,99],"potentially":[28],"arbitrarily":[29],"corrupted":[30,73,107],"magnitude-only":[31],"linear":[32,141],"measurements.":[33,74,108],"We":[34,75],"propose":[35],"alternating":[37],"minimization":[38],"approach":[39],"that":[40],"incorporates":[41],"oracle":[43,84,111],"solver":[44],"for":[45,115],"a":[46,51,86,121,127],"non-convex":[47],"optimization":[48],"as":[50],"subroutine.":[52],"Our":[53,109],"algorithm":[54,125,138],"guarantees":[55],"convergence":[56,67],"to$\\boldsymbol":[57],"}^{*}$and":[59],"provides":[60],"explicit":[62],"polynomial":[63],"dependence":[64],"rate":[68],"on":[69],"fraction":[71],"then":[76],"provide":[77],"efficient":[79],"construction":[80],"aforementioned":[83],"under":[85],"sparse":[87],"arbitrary":[88],"outliers":[89],"model":[90],"and":[91,131],"offer":[92],"valuable":[93],"insights":[94],"into":[95],"geometric":[97],"properties":[98],"loss":[101],"landscape":[102],"in":[103],"with":[106,126],"proposed":[110],"avoids":[112],"need":[114],"computationally":[116],"intensive":[117],"spectral":[118],"initialization,":[119],"using":[120],"simple":[122],"gradient":[123],"descent":[124],"constant":[128],"step":[129],"size":[130],"random":[132],"initialization":[133],"instead.":[134],"Additionally,":[135],"our":[136],"overall":[137],"achieves":[139],"nearly":[140],"sample":[142],"complexity,$\\mathcal":[143],"{O}(d":[144],"{\\,}\\mathrm":[145],"{polylog}(d))$.":[146]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}