{"id":"https://openalex.org/W1994521750","doi":"https://doi.org/10.1137/100816705","title":"Approximate Sparse Recovery: Optimizing Time and Measurements","display_name":"Approximate Sparse Recovery: Optimizing Time and Measurements","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1994521750","doi":"https://doi.org/10.1137/100816705","mag":"1994521750"},"language":"en","primary_location":{"id":"doi:10.1137/100816705","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100816705","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anna C. Gilbert","raw_affiliation_strings":["annacg@umich.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"annacg@umich.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090676285","display_name":"Yi Li","orcid":"https://orcid.org/0000-0002-6420-653X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yi Li","raw_affiliation_strings":["leeyi@umich.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"leeyi@umich.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049614530","display_name":"Ely Porat","orcid":"https://orcid.org/0000-0001-6912-5766"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ely Porat","raw_affiliation_strings":["porately@cs.biu.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"porately@cs.biu.ac.il#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107196494","display_name":"Martin J. Strauss","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin J. Strauss","raw_affiliation_strings":["martinjs@umich.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"martinjs@umich.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4454,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.95935246,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"41","issue":"2","first_page":"436","last_page":"453"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9970999956130981,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.6930334568023682},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5714573860168457},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4668854773044586},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.42834898829460144},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.4153313934803009},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4141371548175812},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2921154499053955},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1985989511013031}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6930334568023682},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5714573860168457},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4668854773044586},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.42834898829460144},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.4153313934803009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4141371548175812},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2921154499053955},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1985989511013031},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100816705","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100816705","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2080745194","https://openalex.org/W2118653712","https://openalex.org/W2141556672","https://openalex.org/W2162032433","https://openalex.org/W2163258822","https://openalex.org/W2164452299","https://openalex.org/W2289917018","https://openalex.org/W4250955649"],"related_works":["https://openalex.org/W2170731169","https://openalex.org/W1580606225","https://openalex.org/W1582484623","https://openalex.org/W226879351","https://openalex.org/W3196742378","https://openalex.org/W3010402188","https://openalex.org/W3216760150","https://openalex.org/W2165712250","https://openalex.org/W3198024154","https://openalex.org/W2224672067"],"abstract_inverted_index":{"A":[0],"Euclidean":[1],"approximate":[2],"sparse":[3],"recovery":[4],"system":[5,26,78,114],"consists":[6],"of":[7,98,103,174,198,206],"parameters":[8],"$k,N$,":[9],"an":[10],"m-by-N":[11],"measurement":[12],"matrix,":[13],"$\\bm{\\Phi}$,":[14,256],"and":[15,100,169,172,181,187,232,252,272],"a":[16,21,113,119,124,132,137,166,217],"decoding":[17,105,127],"algorithm,":[18,106],"$\\mathcal{D}$.":[19,107],"Given":[20],"vector,":[22],"${\\mathbf":[23,28,52,60,75,227],"x}$,":[24,76],"the":[25,55,77,87,95,101,104,143,147,154,160,170,175,183],"approximates":[27],"x}$":[29,65],"by":[30,152,165],"$\\widehat":[31,243],"{\\mathbf":[32,34,40,43,49,244,248,263],"x}=\\mathcal{D}(\\bm{\\Phi}":[33],"x})$,":[35],"which":[36,207],"must":[37,79],"satisfy":[38],"$|\\widehat":[39],"x}":[41,47,245,249,260],"-":[42,48,261],"x}|_2\\le":[44],"C":[45],"|{\\mathbf":[46],"x}_k|_2$,":[50],"where":[51,230],"x}_k$":[53],"denotes":[54],"optimal":[56,191],"k-term":[57],"approximation":[58,221],"to":[59,123,136,149,156,162,178,193],"x}$.":[61],"(The":[62],"output":[63],"$\\widehat{\\mathbf":[64],"may":[66],"have":[67,200],"more":[68],"than":[69],"k":[70],"terms.)":[71],"For":[72],"each":[73,205],"vector":[74],"succeed":[80],"with":[81,115],"probability":[82],"at":[83,201],"least":[84],"3/4.":[85],"Among":[86],"goals":[88],"in":[89,211],"designing":[90],"such":[91],"systems":[92],"are":[93,190,235],"minimizing":[94],"number":[96],"m":[97],"measurements":[99,158,271],"runtime":[102],"In":[108],"this":[109],"paper,":[110],"we":[111,257],"give":[112],"$m=O(k":[116],"\\log(N/k))$":[117],"measurements\u2014matching":[118],"lower":[120,133],"bound,":[121],"up":[122,135,192],"constant":[125,212],"factor\u2014and":[126],"time":[128,145,148,155,161,274],"$k\\log^{O(1)}":[129],"N$,":[130],"matching":[131],"bound":[134],"polylog$(N)$":[138],"factor.":[139],"We":[140],"also":[141],"consider":[142],"encode":[144,186],"(i.e.,":[146,159],"multiply":[150,163],"$\\bm{\\Phi}$":[151,164,199],"x),":[153,168],"update":[157,188],"1-sparse":[167],"robustness":[171],"stability":[173],"algorithm":[176],"(resilience":[177],"noise":[179],"before":[180],"after":[182],"measurements).":[184],"Our":[185,214],"times":[189],"$\\log(k)$":[194],"factors.":[195],"The":[196],"columns":[197],"most":[202],"$O(\\log^2(k)\\log(N/k))$":[203],"nonzeros,":[204],"can":[208],"be":[209],"found":[210],"time.":[213],"full":[215],"result,":[216],"fully":[218],"polynomial":[219],"randomized":[220],"scheme,":[222],"is":[223],"as":[224,239],"follows.":[225],"If":[226],"x}={\\mathbf":[228],"x}_k+\\nu_1$,":[229],"$\\nu_1$":[231],"$\\nu_2$":[233],"(below)":[234],"arbitrary":[236],"vectors":[237],"(regarded":[238],"noise),":[240],"then":[241],"setting":[242],"=":[246],"\\mathcal{D}(\\Phi":[247],"+":[250,267],"\\nu_2)$,":[251],"for":[253,275],"properly":[254],"normalized":[255],"get":[258],"$\\left|{\\mathbf":[259],"\\widehat":[262],"x}\\right|_2^2":[264],"\\le":[265],"(1+\\epsilon)\\left|\\nu_1\\right|_2^2":[266],"\\epsilon\\left|\\nu_2\\right|_2^2$":[268],"using":[269],"$O((k/\\epsilon)\\log(N/k))$":[270],"$(k/\\epsilon)\\log^{O(1)}(N)$":[273],"decoding.":[276]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}