{"id":"https://openalex.org/W4289655252","doi":"https://doi.org/10.1109/isit50566.2022.9834449","title":"The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs","display_name":"The Optimal Sample Complexity of Matrix Completion with Hierarchical Similarity Graphs","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655252","doi":"https://doi.org/10.1109/isit50566.2022.9834449"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834449","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/A5058569552","display_name":"Adel Elmahdy","orcid":"https://orcid.org/0000-0002-2977-2237"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Adel Elmahdy","raw_affiliation_strings":["University of Minnesota,ECE"],"affiliations":[{"raw_affiliation_string":"University of Minnesota,ECE","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078458762","display_name":"Junhyung Ahn","orcid":"https://orcid.org/0009-0003-0345-1608"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]},{"id":"https://openalex.org/I4210099236","display_name":"Kootenay Association for Science & Technology","ror":"https://ror.org/011pv9p44","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210099236"]}],"countries":["CA","KR"],"is_corresponding":false,"raw_author_name":"Junhyung Ahn","raw_affiliation_strings":["KAIST,EE"],"affiliations":[{"raw_affiliation_string":"KAIST,EE","institution_ids":["https://openalex.org/I4210099236","https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026043799","display_name":"Soheil Mohajer","orcid":"https://orcid.org/0000-0003-2254-1652"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soheil Mohajer","raw_affiliation_strings":["University of Minnesota,ECE"],"affiliations":[{"raw_affiliation_string":"University of Minnesota,ECE","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003738785","display_name":"Changho Suh","orcid":"https://orcid.org/0000-0002-3101-4291"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]},{"id":"https://openalex.org/I4210099236","display_name":"Kootenay Association for Science & Technology","ror":"https://ror.org/011pv9p44","country_code":"CA","type":"nonprofit","lineage":["https://openalex.org/I4210099236"]}],"countries":["CA","KR"],"is_corresponding":false,"raw_author_name":"Changho Suh","raw_affiliation_strings":["KAIST,EE"],"affiliations":[{"raw_affiliation_string":"KAIST,EE","institution_ids":["https://openalex.org/I4210099236","https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058569552"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":0.2909,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.42964353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"2409","last_page":"2414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9887999892234802,"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/matrix-completion","display_name":"Matrix completion","score":0.7143819332122803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5359955430030823},{"id":"https://openalex.org/keywords/stochastic-block-model","display_name":"Stochastic block model","score":0.535921573638916},{"id":"https://openalex.org/keywords/recommender-system","display_name":"Recommender system","score":0.5317382216453552},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5248404145240784},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5072843432426453},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.4985165596008301},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48525166511535645},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.477285772562027},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.44001710414886475},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.4257334768772125},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4184597134590149},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39813515543937683},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3718046247959137},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2508699893951416},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2378021478652954},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17275181412696838},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.13380166888237}],"concepts":[{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.7143819332122803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5359955430030823},{"id":"https://openalex.org/C2779982251","wikidata":"https://www.wikidata.org/wiki/Q25053762","display_name":"Stochastic block model","level":3,"score":0.535921573638916},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.5317382216453552},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5248404145240784},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5072843432426453},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.4985165596008301},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48525166511535645},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.477285772562027},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.44001710414886475},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.4257334768772125},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4184597134590149},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39813515543937683},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3718046247959137},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2508699893951416},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2378021478652954},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17275181412696838},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.13380166888237},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"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/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"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/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/isit50566.2022.9834449","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834449","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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5600000023841858}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W120301130","https://openalex.org/W1530218127","https://openalex.org/W1544449255","https://openalex.org/W1657130172","https://openalex.org/W2039613841","https://openalex.org/W2051305477","https://openalex.org/W2051638434","https://openalex.org/W2054141820","https://openalex.org/W2072422262","https://openalex.org/W2073235443","https://openalex.org/W2083390547","https://openalex.org/W2084527756","https://openalex.org/W2093219534","https://openalex.org/W2108119513","https://openalex.org/W2119825970","https://openalex.org/W2121947440","https://openalex.org/W2130354913","https://openalex.org/W2135598826","https://openalex.org/W2138825227","https://openalex.org/W2144487656","https://openalex.org/W2165874743","https://openalex.org/W2219655028","https://openalex.org/W2244405900","https://openalex.org/W2602671714","https://openalex.org/W2610153490","https://openalex.org/W2624407581","https://openalex.org/W2755989002","https://openalex.org/W2891886048","https://openalex.org/W2912792453","https://openalex.org/W2957946950","https://openalex.org/W2963264680","https://openalex.org/W2963974511","https://openalex.org/W2963979542","https://openalex.org/W2964211741","https://openalex.org/W2964214140","https://openalex.org/W3012416884","https://openalex.org/W3034148639","https://openalex.org/W3100144903","https://openalex.org/W3104431711","https://openalex.org/W4394657965","https://openalex.org/W6604797525","https://openalex.org/W6631990664","https://openalex.org/W6632433782","https://openalex.org/W6641171924","https://openalex.org/W6676321539","https://openalex.org/W6684578312","https://openalex.org/W6735855921","https://openalex.org/W6737558694","https://openalex.org/W6754390637","https://openalex.org/W6766301470","https://openalex.org/W6775646925","https://openalex.org/W6786055384","https://openalex.org/W6801618375"],"related_works":["https://openalex.org/W2952489973","https://openalex.org/W4300776969","https://openalex.org/W2108753466","https://openalex.org/W2736398265","https://openalex.org/W2054519467","https://openalex.org/W2055706496","https://openalex.org/W2963858139","https://openalex.org/W2619650408","https://openalex.org/W2567119175","https://openalex.org/W2750905689"],"abstract_inverted_index":{"We":[0,24,42],"study":[1],"a":[2,8,44,53,84,110],"matrix":[3,46,77,111],"completion":[4,112],"problem":[5],"that":[6,26,58,120],"leverages":[7],"hierarchical":[9,54],"structure":[10],"of":[11,21,33,75,86,89],"social":[12,62],"similarity":[13],"graphs":[14],"as":[15,83],"side":[16,91],"information":[17,92],"in":[18],"the":[19,49,69,73,87,104,121,125],"context":[20],"recommender":[22],"systems.":[23],"assume":[25],"users":[27],"are":[28],"categorized":[29],"into":[30],"clusters,":[31],"each":[32],"which":[34],"comprises":[35],"sub-clusters":[36],"(or":[37],"what":[38],"we":[39,67,108],"call":[40],"\u201cgroups\u201d).":[41],"consider":[43],"low-rank":[45],"model":[47,57],"for":[48],"rating":[50],"matrix,":[51],"and":[52,100,114],"stochastic":[55],"block":[56],"well":[59],"respects":[60],"practically-relevant":[61],"graphs.":[63],"Under":[64],"this":[65],"setting,":[66],"characterize":[68],"information-theoretic":[70],"limit":[71],"on":[72,103],"number":[74],"observed":[76],"entries":[78],"(i.e.,":[79],"optimal":[80,126],"sample":[81,105,127],"complexity)":[82],"function":[85],"quality":[88],"graph":[90],"(to":[93],"be":[94],"detailed)":[95],"by":[96],"proving":[97],"sharp":[98],"upper":[99],"lower":[101],"bounds":[102],"complexity.":[106,128],"Furthermore,":[107],"develop":[109],"algorithm":[113,123],"empirically":[115],"demonstrate":[116],"via":[117],"extensive":[118],"experiments":[119],"proposed":[122],"achieves":[124]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}