{"id":"https://openalex.org/W2584490256","doi":"https://doi.org/10.1109/isit.2017.8006949","title":"Information theoretic limits for linear prediction with graph-structured sparsity","display_name":"Information theoretic limits for linear prediction with graph-structured sparsity","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2584490256","doi":"https://doi.org/10.1109/isit.2017.8006949","mag":"2584490256"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5038594655","display_name":"Adarsh Barik","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Adarsh Barik","raw_affiliation_strings":["Krannert School of Management, Purdue University, West Lafayette, Indiana"],"affiliations":[{"raw_affiliation_string":"Krannert School of Management, Purdue University, West Lafayette, Indiana","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038965118","display_name":"Jean Honorio","orcid":"https://orcid.org/0000-0002-6448-0598"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean Honorio","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, Indiana"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, Indiana","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001767041","display_name":"Mohit Tawarmalani","orcid":"https://orcid.org/0000-0003-3085-0084"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohit Tawarmalani","raw_affiliation_strings":["Krannert School of Management, Purdue University, West Lafayette, Indiana"],"affiliations":[{"raw_affiliation_string":"Krannert School of Management, Purdue University, West Lafayette, Indiana","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038594655"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.2401,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2348","last_page":"2352"},"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.9991000294685364,"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.9991000294685364,"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/T10136","display_name":"Statistical Methods and Inference","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9764999747276306,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.645549476146698},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5631417036056519},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5552148222923279},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48091384768486023},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4447442293167114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4314740002155304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3949311375617981},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36469757556915283},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15915429592132568}],"concepts":[{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.645549476146698},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5631417036056519},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5552148222923279},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48091384768486023},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4447442293167114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4314740002155304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3949311375617981},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36469757556915283},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15915429592132568},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006949","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006949","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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":19,"referenced_works":["https://openalex.org/W182164380","https://openalex.org/W1527917680","https://openalex.org/W1538452572","https://openalex.org/W1826818071","https://openalex.org/W2030449718","https://openalex.org/W2068693086","https://openalex.org/W2096698247","https://openalex.org/W2108829665","https://openalex.org/W2125680629","https://openalex.org/W2137990311","https://openalex.org/W2164431108","https://openalex.org/W2289917018","https://openalex.org/W2478708596","https://openalex.org/W2584490256","https://openalex.org/W2963322354","https://openalex.org/W3125735862","https://openalex.org/W6607403468","https://openalex.org/W6631772773","https://openalex.org/W6638709362"],"related_works":["https://openalex.org/W2012531322","https://openalex.org/W2402761219","https://openalex.org/W2785900585","https://openalex.org/W2353730437","https://openalex.org/W2490303674","https://openalex.org/W2532801570","https://openalex.org/W4385627933","https://openalex.org/W2480127678","https://openalex.org/W2806270048","https://openalex.org/W4310605282"],"abstract_inverted_index":{"We":[0,27,56],"analyze":[1],"the":[2,43,58],"necessary":[3],"number":[4,39],"of":[5,40],"samples":[6,41],"for":[7,42],"sparse":[8],"vector":[9],"recovery":[10],"in":[11,70],"a":[12],"noisy":[13],"linear":[14,23],"prediction":[15],"setup.":[16],"This":[17],"model":[18,46],"includes":[19],"problems":[20],"such":[21],"as":[22,66],"regression":[24],"and":[25,50],"classification.":[26],"focus":[28],"on":[29,62],"structured":[30],"graph":[31,45],"models.":[32],"In":[33],"particular,":[34],"we":[35],"prove":[36],"that":[37],"sufficient":[38],"weighted":[44],"proposed":[47],"by":[48],"Hegde":[49],"others":[51],"[2]":[52],"is":[53],"also":[54],"necessary.":[55],"use":[57],"Fano's":[59],"inequality":[60],"[11]":[61],"well":[63],"constructed":[64],"ensembles":[65],"our":[67],"main":[68],"tool":[69],"establishing":[71],"information":[72],"theoretic":[73],"lower":[74],"bounds.":[75]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}