{"id":"https://openalex.org/W1491344380","doi":"https://doi.org/10.1145/3039872","title":"For-All Sparse Recovery in Near-Optimal Time","display_name":"For-All Sparse Recovery in Near-Optimal Time","publication_year":2017,"publication_date":"2017-03-06","ids":{"openalex":"https://openalex.org/W1491344380","doi":"https://doi.org/10.1145/3039872","mag":"1491344380"},"language":"en","primary_location":{"id":"doi:10.1145/3039872","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3039872","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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":"https://openalex.org/A5042502878","display_name":"Anna C. Gilbert","orcid":"https://orcid.org/0000-0002-9627-9274"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anna C. Gilbert","raw_affiliation_strings":["Department of Mathematics. University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics. University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090676285","display_name":"Yi Li","orcid":"https://orcid.org/0000-0002-6420-653X"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Yi Li","raw_affiliation_strings":["Division of Mathematics, SPMS. Nanyang Technological University, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-6420-653X","affiliations":[{"raw_affiliation_string":"Division of Mathematics, SPMS. Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049614530","display_name":"Ely Porat","orcid":"https://orcid.org/0000-0001-6912-5766"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ely Porat","raw_affiliation_strings":["Department of Computer Science. Bar-Ilan University","Department of Computer Science, Bar-Ilan University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science. Bar-Ilan University","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, Bar-Ilan University#TAB#","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107196494","display_name":"Martin J. Strauss","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin J. Strauss","raw_affiliation_strings":["Department of Mathematics. University of Michigan, Ann Arbor, MI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics. University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0796,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.9070436,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"13","issue":"3","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.7200425267219543},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6420674324035645},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6007068157196045},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.548871636390686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4740290939807892},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.44700151681900024},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4345601797103882},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.42916184663772583},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3558087944984436},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09755131602287292}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.7200425267219543},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6420674324035645},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6007068157196045},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.548871636390686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4740290939807892},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.44700151681900024},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4345601797103882},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.42916184663772583},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3558087944984436},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09755131602287292},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3039872","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3039872","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1493892051","https://openalex.org/W1522964222","https://openalex.org/W1608916152","https://openalex.org/W1620362451","https://openalex.org/W1635427980","https://openalex.org/W1682116256","https://openalex.org/W1923547365","https://openalex.org/W1964678106","https://openalex.org/W1974466705","https://openalex.org/W1994521750","https://openalex.org/W2002912175","https://openalex.org/W2006506233","https://openalex.org/W2020390700","https://openalex.org/W2026709222","https://openalex.org/W2090418561","https://openalex.org/W2097796125","https://openalex.org/W2101675075","https://openalex.org/W2122548617","https://openalex.org/W2130979540","https://openalex.org/W2133589924","https://openalex.org/W2145096794","https://openalex.org/W2293852858","https://openalex.org/W2296616510","https://openalex.org/W2569988392","https://openalex.org/W2620883762","https://openalex.org/W2951988467","https://openalex.org/W2973707709","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W1529311266","https://openalex.org/W2065008672","https://openalex.org/W2047234016","https://openalex.org/W1608733163","https://openalex.org/W1543920729","https://openalex.org/W2623150993","https://openalex.org/W2055932080","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":{"An":[0],"approximate":[1],"sparse":[2],"recovery":[3,25,230,274,283,287,403,439,445],"system":[4,35,231,275,288],"in":[5,68,112,267,365,447,454],"\u2113":[6],"1":[7,52,60,117,179],"norm":[8],"consists":[9,289,405],"of":[10,136,255,262,290,315,323,374,383,406,410,470],"parameters":[11],"k":[12,58,102,107,116,143,148,166,176,186,200,217,237,242,246],",":[13,33,346,426],"\u03f5,":[14,225],"N":[15,20,105,120,146,169,178,188,204,219,240,244],";":[16],"an":[17,228],"m":[18,233,344,355,377,414,424,465],"-by-":[19],"measurement":[21],"\u03a6;":[22],"and":[23,95,110,160,182,264,318,362,386,417,452],"a":[24,30,70,172,272,281,291,301,308,341,352,389,478],"algorithm":[26,92,257,404,440],"R":[27,41],".":[28,61,87],"Given":[29],"vector,":[31],"x":[32,37,43,50,55,57,86],"the":[34,64,78,134,151,161,210,321,324,332,367,371,375,384,395,408,411,421,428,462,471],"approximates":[36],"by":[38,93,157,337],"x\u02c6":[39],"=":[40,234],"(\u03a6":[42],"),":[44],"which":[45,69,347,366,473],"must":[46],"satisfy":[47],"\u2016":[48,51,59],"x\u02c6-":[49],"\u2264":[53],"(1+\u03f5)\u2016":[54],"-":[56],"We":[62],"consider":[63],"\u201cfor":[65],"all\u201d":[66],"model,":[67],"single":[71],"matrix":[72],"\u03a6,":[73],"possibly":[74],"\u201cconstructed\u201d":[75],"non-explicitly":[76],"using":[77],"probabilistic":[79],"method,":[80],"is":[81,212,258,307,313,329,369,441],"used":[82,453],"for":[83,123,191,205,300],"all":[84,427],"signals":[85],"The":[88,252,285,304,327,400,438],"best":[89,152],"existing":[90,153],"sublinear":[91],"Porat":[94,263,361],"Strauss":[96,265,363],"[2012]":[97,266,364],"uses":[98],"O":[99,114,139,164,215,235],"(\u03f5":[100,140],"\u22123":[101],"log":[103,144,202],"(":[104,115,145,165,216,236,239],"/":[106,147,241],"))":[108],"measurements":[109,137],"runs":[111],"time":[113],"\u2212":[118,141,180],"\u03b1":[119,121,126,181],")":[122,189,247],"any":[124,192],"constant":[125],">":[127,197,208],"0.":[128,198],"In":[129,459],"this":[130,256],"article,":[131],"we":[132,226,269,387],"improve":[133],"number":[135],"to":[138,163,214,260,279,330,351,360,381,393,420,443,476],"2":[142],")),":[149],"matching":[150],"upper":[154],"bound":[155],"(attained":[156],"super-linear":[158],"algorithms),":[159],"runtime":[162,211],"1+\u03b2":[167],"poly(log":[168],",1/\u03f5)),":[170],"with":[171,232,296,340],"modest":[173],"restriction":[174],"that":[175,261,268,312,319,431],"\u2a7d":[177,184,201],"\u03f5":[183],"(log":[185],"/log":[187,245],"\u03b3":[190,196,248],"constants":[193],"\u03b1,":[194],"\u03b2,":[195],"When":[199],"c":[203,207],"some":[206],"0,":[209],"reduced":[213],"poly(":[218],",1/\u03f5)).":[220],"With":[221],"no":[222],"restrictions":[223],"on":[224],"have":[227],"approximation":[229],"/\u03f5log":[238],")((log":[243],"+":[249],"1/\u03f5))":[250],"measurements.":[251],"overall":[253],"architecture":[254],"similar":[259,442],"repeatedly":[270],"use":[271,388],"weak":[273,286],"(with":[276],"varying":[277],"parameters)":[278],"obtain":[280,477],"top-level":[282],"algorithm.":[284],"two-layer":[292],"hashing":[293,325],"procedure":[294,311],"(or":[295],"two":[297],"unbalanced":[298],"expanders":[299],"deterministic":[302],"algorithm).":[303],"algorithmic":[305],"innovation":[306],"novel":[309],"encoding":[310,368],"reminiscent":[314],"network":[316],"coding":[317],"reflects":[320],"structure":[322],"stages.":[326],"idea":[328],"encode":[331,394],"signal":[333],"position":[334],"index":[335],"i":[336,345,357,379,416,425,466],"associating":[338],"it":[339],"unique":[342],"message":[343,354,376],"will":[348],"be":[349,434],"encoded":[350],"longer":[353,412],"\u2032":[356,378,415],"(in":[358],"contrast":[359],"simply":[370],"identity).":[372],"Portions":[373],"correspond":[380],"repetitions":[382],"hashing,":[385,472],"regular":[390],"expander":[391],"graph":[392],"linkages":[396],"among":[397],"these":[398],"portions.":[399],"decoding":[401,419],"or":[402],"recovering":[407],"portions":[409],"messages":[413,423,463],"then":[418],"original":[422],"while":[429],"ensuring":[430],"corruptions":[432],"can":[433],"detected":[435],"and/or":[436],"corrected.":[437],"list":[444],"introduced":[446],"Indyk":[448],"et":[449,456],"al.":[450,457],"[2010]":[451],"Gilbert":[455],"[2013].":[458],"our":[460],"algorithm,":[461],"{":[464],"}":[467],"are":[468],"independent":[469],"enables":[474],"us":[475],"better":[479],"result.":[480]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2017,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}