{"id":"https://openalex.org/W2164431108","doi":"https://doi.org/10.1109/isit.2014.6875152","title":"A fast approximation algorithm for tree-sparse recovery","display_name":"A fast approximation algorithm for tree-sparse recovery","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2164431108","doi":"https://doi.org/10.1109/isit.2014.6875152","mag":"2164431108"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875152","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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/A5066142047","display_name":"Chinmay Hegde","orcid":"https://orcid.org/0000-0003-4574-8066"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chinmay Hegde","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076056716","display_name":"Piotr Indyk","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Piotr Indyk","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110578233","display_name":"Ludwig Schmidt","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ludwig Schmidt","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066142047"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":5.777,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.96463347,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1842","last_page":"1846"},"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/T10688","display_name":"Image and Signal Denoising Methods","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11447","display_name":"Blind Source Separation Techniques","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.739124059677124},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.7356898784637451},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6854413747787476},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6809293627738953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6279385089874268},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5028244853019714},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.480313241481781},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.46379122138023376},{"id":"https://openalex.org/keywords/signal","display_name":"SIGNAL (programming language)","score":0.44654396176338196},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2881208062171936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23649108409881592},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18024063110351562}],"concepts":[{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.739124059677124},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.7356898784637451},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6854413747787476},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6809293627738953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6279385089874268},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5028244853019714},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.480313241481781},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.46379122138023376},{"id":"https://openalex.org/C2779843651","wikidata":"https://www.wikidata.org/wiki/Q7390335","display_name":"SIGNAL (programming language)","level":2,"score":0.44654396176338196},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2881208062171936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23649108409881592},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18024063110351562},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2014.6875152","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.9476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.9476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://home.engineering.iastate.edu/%7Echinmay/files/papers/isit_trees.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1497745584","https://openalex.org/W2009234246","https://openalex.org/W2015780581","https://openalex.org/W2044762091","https://openalex.org/W2053691921","https://openalex.org/W2056751685","https://openalex.org/W2067893494","https://openalex.org/W2115755118","https://openalex.org/W2125680629","https://openalex.org/W2130084903","https://openalex.org/W2134929491","https://openalex.org/W2145096794","https://openalex.org/W2281354239","https://openalex.org/W2289917018","https://openalex.org/W2296616510","https://openalex.org/W3125735862","https://openalex.org/W3181761506","https://openalex.org/W4245119805","https://openalex.org/W4250955649","https://openalex.org/W6629935912","https://openalex.org/W6797817604"],"related_works":["https://openalex.org/W2071459461","https://openalex.org/W2093885745","https://openalex.org/W2351266481","https://openalex.org/W2132547887","https://openalex.org/W2516987005","https://openalex.org/W2907786475","https://openalex.org/W2963447120","https://openalex.org/W4289082820","https://openalex.org/W2092152400","https://openalex.org/W2963196945"],"abstract_inverted_index":{"Sparse":[0],"signals":[1,30],"whose":[2],"nonzeros":[3],"obey":[4],"a":[5,10,43,58,62,72,95,104,111,130],"tree-like":[6],"structure":[7],"occur":[8],"in":[9,28,129],"range":[11,121],"of":[12,33,75,107,114,122,154],"applications":[13],"such":[14],"as":[15],"image":[16],"modeling,":[17],"genetic":[18],"data":[19],"analysis,":[20],"and":[21,101,110],"compressive":[22,136],"sensing.":[23],"An":[24],"important":[25],"problem":[26,49],"encountered":[27],"recovering":[29],"is":[31,92,118],"that":[32,138],"optimal":[34],"tree-projection,":[35],"i.e.,":[36],"finding":[37],"the":[38,67,119,123,152],"closest":[39],"tree-sparse":[40,88,135],"signal":[41,60],"for":[42,55,99,134],"given":[44],"query":[45],"signal.":[46,124],"However,":[47],"this":[48,127],"can":[50,78],"be":[51,80],"computationally":[52],"very":[53],"demanding:":[54],"optimally":[56],"projecting":[57],"length-n":[59],"onto":[61],"tree":[63],"with":[64],"sparsity":[65],"k,":[66],"best":[68],"existing":[69],"algorithms":[70],"incur":[71],"high":[73],"runtime":[74,106],"O(nk).":[76],"This":[77],"often":[79],"impractical.":[81],"We":[82,125],"suggest":[83],"an":[84],"alternative":[85],"approach":[86,91,128],"to":[87,142],"recovery.":[89],"Our":[90],"based":[93],"on":[94,147],"specific":[96],"approximation":[97],"algorithm":[98,133],"tree-projection":[100],"provably":[102],"has":[103],"near-linear":[105],"O(n":[108],"log(kr))":[109],"memory":[112],"cost":[113],"O(n),":[115],"where":[116],"r":[117],"dynamic":[120],"leverage":[126],"fast":[131],"recovery":[132],"sensing":[137],"scales":[139],"extremely":[140],"well":[141],"high-dimensional":[143],"datasets.":[144],"Experimental":[145],"results":[146],"several":[148],"test":[149],"cases":[150],"demonstrate":[151],"validity":[153],"our":[155],"approach.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}