{"id":"https://openalex.org/W4289713237","doi":"https://doi.org/10.1109/isit50566.2022.9834705","title":"On (1 + \u03f5)-Approximate Block Sparse Recovery","display_name":"On (1 + \u03f5)-Approximate Block Sparse Recovery","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289713237","doi":"https://doi.org/10.1109/isit50566.2022.9834705"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834705","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5069174098","display_name":"Bar\u0131\u015f Can Esmer","orcid":"https://orcid.org/0000-0001-5694-1465"},"institutions":[{"id":"https://openalex.org/I4210128801","display_name":"Helmholtz Center for Information Security","ror":"https://ror.org/02njgxr09","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I4210128801"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bar\u0131\u015f Can Esmer","raw_affiliation_strings":["CISPA Helmholtz Center for Information Security"],"affiliations":[{"raw_affiliation_string":"CISPA Helmholtz Center for Information Security","institution_ids":["https://openalex.org/I4210128801"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054359620","display_name":"Vasileios Nakos","orcid":"https://orcid.org/0000-0003-2703-2750"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vasileios Nakos","raw_affiliation_strings":["RelationalAI"],"affiliations":[{"raw_affiliation_string":"RelationalAI","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069174098"],"corresponding_institution_ids":["https://openalex.org/I4210128801"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21866295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1815","last_page":"1820"},"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.9994000196456909,"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/T11739","display_name":"Microwave Imaging and Scattering Analysis","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.7058662176132202},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.693085789680481},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.6508394479751587},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.601909875869751},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.551824688911438},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5112266540527344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47861164808273315},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43540841341018677},{"id":"https://openalex.org/keywords/row-and-column-spaces","display_name":"Row and column spaces","score":0.4148250222206116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37062862515449524},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2909826636314392}],"concepts":[{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.7058662176132202},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.693085789680481},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.6508394479751587},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.601909875869751},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.551824688911438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5112266540527344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47861164808273315},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43540841341018677},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.4148250222206116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37062862515449524},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2909826636314392},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834705","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834705","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W143004564","https://openalex.org/W1826818071","https://openalex.org/W1971402995","https://openalex.org/W2020301027","https://openalex.org/W2025086029","https://openalex.org/W2029816571","https://openalex.org/W2033419225","https://openalex.org/W2091904714","https://openalex.org/W2098996169","https://openalex.org/W2104987624","https://openalex.org/W2114595593","https://openalex.org/W2125680629","https://openalex.org/W2126444227","https://openalex.org/W2129638195","https://openalex.org/W2135780853","https://openalex.org/W2145096794","https://openalex.org/W2157529069","https://openalex.org/W2160798840","https://openalex.org/W2168831133","https://openalex.org/W2402968514","https://openalex.org/W2919126668","https://openalex.org/W2951592336","https://openalex.org/W2971388462","https://openalex.org/W4230548574","https://openalex.org/W4230981723","https://openalex.org/W4247353359","https://openalex.org/W4250955649","https://openalex.org/W4300634415","https://openalex.org/W6638709362","https://openalex.org/W6657077120"],"related_works":["https://openalex.org/W2313440505","https://openalex.org/W3123744736","https://openalex.org/W2137691148","https://openalex.org/W1505848319","https://openalex.org/W4281399881","https://openalex.org/W3166006430","https://openalex.org/W4281971614","https://openalex.org/W2049180840","https://openalex.org/W1992086467","https://openalex.org/W3121299875"],"abstract_inverted_index":{"Learning":[0],"approximately":[1],"block":[2],"sparse":[3,18,86],"vectors":[4],"using":[5,32],"a":[6,13,24,37,100],"small":[7],"number":[8,119],"of":[9,53,96,103,120],"linear":[10,48],"measurements":[11],"is":[12,57,99,123],"standard":[14],"task":[15],"in":[16,46,50,90],"the":[17,51,54,73,91,104,110,118],"recovery/compressed":[19],"sensing":[20],"literature.":[21,92],"Schemes":[22],"achieving":[23,40],"constant":[25,64],"factor":[26],"approximation":[27],"are":[28,113],"long":[29],"known,":[30],"e.g.":[31],"model-based":[33],"RIP.":[34],"We":[35],"give":[36],"new":[38],"scheme":[39,76,88],"(1+":[41],"\u03f5)":[42],"approximation,":[43],"which":[44],"runs":[45],"near":[47],"time":[49],"length":[52],"vector":[55],"and":[56,117],"likely":[58],"to":[59,63,125],"be":[60],"optimal":[61],"up":[62],"factors.":[65],"As":[66],"an":[67],"intriguing":[68],"side":[69],"result,":[70],"we":[71],"obtain":[72],"simplest":[74],"known":[75],"measurement-optimal":[77],"\u2113":[78],"<inf":[79,83],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[80,84],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[81,85],"/\u2113":[82],"recovery":[87],"recorded":[89],"The":[93],"main":[94],"component":[95],"our":[97],"algorithm":[98],"subtle":[101],"variant":[102],"classic":[105],"COUNTSKETCH":[106],"data":[107],"structure":[108],"where":[109],"random":[111],"signs":[112],"substituted":[114],"by":[115],"Gaussians":[116],"repetitions":[121],"(rows)":[122],"tuned":[124],"smaller":[126],"than":[127],"usual.":[128]},"counts_by_year":[],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}