{"id":"https://openalex.org/W2532988047","doi":"https://doi.org/10.1109/allerton.2008.4797556","title":"Practical near-optimal sparse recovery in the L1 norm","display_name":"Practical near-optimal sparse recovery in the L1 norm","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2532988047","doi":"https://doi.org/10.1109/allerton.2008.4797556","mag":"2532988047"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2008.4797556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5011458966","display_name":"Radu Berinde","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Berinde","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076056716","display_name":"Piotr Indyk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Indyk","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, MIT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, MIT, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"M. Ruzic","orcid":null},"institutions":[{"id":"https://openalex.org/I83467386","display_name":"IT University of Copenhagen","ror":"https://ror.org/02309jg23","country_code":"DK","type":"education","lineage":["https://openalex.org/I83467386"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"M. Ruzic","raw_affiliation_strings":["ITU Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITU Copenhagen, Denmark","institution_ids":["https://openalex.org/I83467386"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":17.1436,"has_fulltext":false,"cited_by_count":97,"citation_normalized_percentile":{"value":0.99285388,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"198","last_page":"205"},"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.9958000183105469,"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.9958000183105469,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.989799976348877,"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/sketch","display_name":"Sketch","score":0.627065122127533},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4948107600212097},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4616128206253052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41072118282318115},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3304532766342163},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3294081687927246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30606669187545776},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.12655887007713318}],"concepts":[{"id":"https://openalex.org/C2779231336","wikidata":"https://www.wikidata.org/wiki/Q7534724","display_name":"Sketch","level":2,"score":0.627065122127533},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4948107600212097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4616128206253052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41072118282318115},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3304532766342163},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3294081687927246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30606669187545776},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.12655887007713318},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/allerton.2008.4797556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797556","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/870fcaa0-c608-11dd-867b-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.itu.dk/portal/da/publications/870fcaa0-c608-11dd-867b-000ea68e967b","pdf_url":null,"source":{"id":"https://openalex.org/S4377196680","display_name":"IT University Of Copenhagen (IT University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83467386","host_organization_name":"IT University of Copenhagen","host_organization_lineage":["https://openalex.org/I83467386"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Ruzic, M, Berinde, R & Indyk, P 2009, Practical Near-Optimal Sparse Recovery in the L1 Norm. in 46th Annual Allerton Conference on Communication, Control, and Computing, 2008. IEEE. https://doi.org/10.1109/ALLERTON.2008.4797556","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.493","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.csail.mit.edu/~indyk/smp.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1493892051","https://openalex.org/W1527917680","https://openalex.org/W1620362451","https://openalex.org/W1635427980","https://openalex.org/W1654257729","https://openalex.org/W1974466705","https://openalex.org/W2006506233","https://openalex.org/W2020390700","https://openalex.org/W2033375925","https://openalex.org/W2047424291","https://openalex.org/W2059739152","https://openalex.org/W2097476744","https://openalex.org/W2106993026","https://openalex.org/W2107086875","https://openalex.org/W2109449402","https://openalex.org/W2120806354","https://openalex.org/W2122548617","https://openalex.org/W2127271355","https://openalex.org/W2130979540","https://openalex.org/W2135859872","https://openalex.org/W2145096794","https://openalex.org/W2150249649","https://openalex.org/W2164452299","https://openalex.org/W2194772305","https://openalex.org/W2289917018","https://openalex.org/W2296616510","https://openalex.org/W2803670972","https://openalex.org/W2963322354","https://openalex.org/W4250955649","https://openalex.org/W6629496199","https://openalex.org/W6631772773","https://openalex.org/W6636602937","https://openalex.org/W6679322288","https://openalex.org/W6681918002"],"related_works":["https://openalex.org/W2378994405","https://openalex.org/W2385974820","https://openalex.org/W2373478030","https://openalex.org/W2378679551","https://openalex.org/W3149739944","https://openalex.org/W2392363776","https://openalex.org/W2063051341","https://openalex.org/W1494563618","https://openalex.org/W2357022711","https://openalex.org/W2358910766"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,8,30,35,42,53,86,106],"approximate":[3],"sparse":[4,31,76],"recovery":[5,32,77,111],"problem,":[6],"where":[7,64],"goal":[9],"is":[10],"to":[11,60,82,92],"(approximately)":[12],"recover":[13],"a":[14,38],"high-dimensional":[15],"vector":[16],"x":[17,50],"\u2208":[18,24],"Rnfrom":[19],"its":[20],"lower-dimensional":[21],"sketch":[22,43,107],"Ax":[23],"Rm.":[25],"Specifically,":[26],"we":[27],"focus":[28],"on":[29],"problem":[33,78,94],"in":[34],"l1norm:":[36],"for":[37],"parameter":[39],"k,":[40],"given":[41],"Ax,":[44],"compute":[45],"an":[46],"approximation":[47],"x\u0302":[48],"of":[49],"such":[51,104],"that":[52],"l1approximation":[54],"error":[55],"\u2016x":[56],"\u2212":[57,62],"x\u0302\u20161is":[58],"close":[59],"minx\u2032\u2016x":[61],"x\u2032\u20161,":[63],"x\u2032":[65],"ranges":[66],"over":[67,85],"all":[68],"vectors":[69],"with":[70],"at":[71],"most":[72],"k":[73],"terms.":[74],"The":[75],"has":[79],"been":[80,96],"subject":[81],"extensive":[83],"research":[84],"last":[87],"few":[88],"years.":[89],"Many":[90],"solutions":[91],"this":[93],"have":[95],"discovered,":[97],"achieving":[98],"different":[99],"trade-offs":[100],"between":[101],"various":[102],"attributes,":[103],"as":[105],"length,":[108],"encoding":[109],"and":[110],"times.":[112]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":10}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}