{"id":"https://openalex.org/W4386066320","doi":"https://doi.org/10.1109/isit54713.2023.10206811","title":"Phase Transitions: Explicit relations for sparse vector and low rank recovery","display_name":"Phase Transitions: Explicit relations for sparse vector and low rank recovery","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386066320","doi":"https://doi.org/10.1109/isit54713.2023.10206811"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206811","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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":"https://openalex.org/A5041916584","display_name":"Agostino Capponi","orcid":"https://orcid.org/0000-0001-9735-7935"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Agostino Capponi","raw_affiliation_strings":["Columbia University,Department of Industrial Engineering and Operations Research,New York,NY,USA,10027"],"affiliations":[{"raw_affiliation_string":"Columbia University,Department of Industrial Engineering and Operations Research,New York,NY,USA,10027","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065505687","display_name":"Mihailo Stojnic","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihailo Stojnic","raw_affiliation_strings":["Columbia University,Department of Industrial Engineering and Operations Research,New York,NY,USA,10027"],"affiliations":[{"raw_affiliation_string":"Columbia University,Department of Industrial Engineering and Operations Research,New York,NY,USA,10027","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041916584"],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":0.2126,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.46782876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"507","last_page":"512"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11205","display_name":"Numerical methods in inverse problems","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5841590166091919},{"id":"https://openalex.org/keywords/phase","display_name":"Phase (matter)","score":0.5236903429031372},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4702516794204712},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4197123050689697},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39320093393325806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3908926844596863},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.2021421492099762},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18299472332000732},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.08303511142730713}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5841590166091919},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.5236903429031372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4702516794204712},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4197123050689697},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39320093393325806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3908926844596863},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.2021421492099762},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18299472332000732},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.08303511142730713},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206811","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/isit54713.2023.10206811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1485629353","https://openalex.org/W2010669260","https://openalex.org/W2082029531","https://openalex.org/W2084745075","https://openalex.org/W2095534914","https://openalex.org/W2111297856","https://openalex.org/W2123202508","https://openalex.org/W2134332047","https://openalex.org/W2136015602","https://openalex.org/W2144730813","https://openalex.org/W2145096794","https://openalex.org/W2152836620","https://openalex.org/W2163916252","https://openalex.org/W2164595191","https://openalex.org/W2175784154","https://openalex.org/W2586353914","https://openalex.org/W2611328865","https://openalex.org/W2962769133","https://openalex.org/W3098807808","https://openalex.org/W3104447032","https://openalex.org/W4250955649","https://openalex.org/W4298400171","https://openalex.org/W6676665419","https://openalex.org/W6680702173","https://openalex.org/W6682658836"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,54],"revisit":[4],"two":[5,28,56,82,90],"groups":[6],"of":[7,59,84,93,124,133,171],"the":[8,14,19,34,38,61,68,89,96,122,128,138,144,172],"most":[9],"famous":[10],"structured":[11],"recovery":[12,21,139],"problems,":[13],"compressed":[15],"sensing":[16],"(CS)":[17],"and":[18,37,45,67,88,107,127,162],"low-rank":[20],"(LRR).":[22],"Our":[23,109],"particular":[24],"focus":[25],"is":[26],"on":[27,137],"tightest":[29],"convex":[30],"relaxation":[31],"based":[32],"heuristics,":[33],"so-called":[35],"\u2113<inf>1</inf>":[36],"nuclear":[39],"norm":[40],"$\\left({l_1^":[41],"*":[42],"}\\right)$":[43],"minimizations,":[44],"their":[46,153],"accompanying":[47],"phase":[48,145],"transitions":[49,146],"(PT)":[50],"phenomena.":[51],"For":[52],"concreteness,":[53],"consider":[55],"standard":[57],"types":[58,83,92,132],"PTs,":[60],"first":[62],"obtained":[63,70],"by":[64,71],"imposing":[65,73],"sparsity":[66],"second":[69],"additionally":[72],"nonnegativity.":[74],"We":[75,98],"establish":[76],"an":[77],"explicit":[78],"relation":[79],"between":[80,103],"these":[81],"PTs":[85,94,104],"in":[86,95,105,116,158],"CS,":[87],"corresponding":[91],"LRR.":[97,108],"also":[99],"uncover":[100],"a":[101,117,159,168],"connection":[102],"CS":[106],"results":[110],"make":[111],"it":[112],"possible":[113],"to":[114],"compare":[115],"mathematically":[118],"rigorous":[119],"way":[120,164],"both":[121],"level":[123],"heuristics\u2019":[125],"successes":[126],"effects":[129],"that":[130],"different":[131],"structuring":[134],"can":[135,155],"have":[136],"process.":[140],"Quite":[141],"surprisingly,":[142],"although":[143],"themselves":[147],"admit":[148],"fairly":[149],"complicated":[150],"mathematical":[151],"formulations,":[152],"relations":[154],"be":[156],"expressed":[157],"very":[160],"neat":[161],"elegant":[163],"which":[165],"allows":[166],"for":[167],"quick":[169],"assessment":[170],"heuristic":[173],"approximation":[174],"quality.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}