{"id":"https://openalex.org/W2039528926","doi":"https://doi.org/10.1109/isit.2010.5513545","title":"Information theoretic bounds for low-rank matrix completion","display_name":"Information theoretic bounds for low-rank matrix completion","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2039528926","doi":"https://doi.org/10.1109/isit.2010.5513545","mag":"2039528926"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513545","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 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/A5088120102","display_name":"Sriram Vishwanath","orcid":"https://orcid.org/0000-0003-3112-4885"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sriram Vishwanath","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Technology, Austin, USA","Department of Electrical and Computer Engineering, University of Texas at Austin, , USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Technology, Austin, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas at Austin, , USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5088120102"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":1.694,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8398314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1508","last_page":"1512"},"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/T11739","display_name":"Microwave Imaging and Scattering Analysis","score":0.9977999925613403,"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"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9969000220298767,"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/converse","display_name":"Converse","score":0.8928821086883545},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.7403146624565125},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6263927221298218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5995185375213623},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.5913985967636108},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5670415163040161},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5477830171585083},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.5175056457519531},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.512554407119751},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42929455637931824},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4201778471469879},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4065370559692383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3326971232891083},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2180916666984558},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1718873679637909},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07428798079490662}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.8928821086883545},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.7403146624565125},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6263927221298218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5995185375213623},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.5913985967636108},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5670415163040161},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5477830171585083},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.5175056457519531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.512554407119751},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42929455637931824},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4201778471469879},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4065370559692383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3326971232891083},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2180916666984558},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1718873679637909},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07428798079490662},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513545","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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":16,"referenced_works":["https://openalex.org/W1995416687","https://openalex.org/W1999405558","https://openalex.org/W2031327377","https://openalex.org/W2033672007","https://openalex.org/W2047071281","https://openalex.org/W2047537297","https://openalex.org/W2099111195","https://openalex.org/W2103972604","https://openalex.org/W2117377454","https://openalex.org/W2118550318","https://openalex.org/W2130350209","https://openalex.org/W2134332047","https://openalex.org/W2951328719","https://openalex.org/W6658373563","https://openalex.org/W6675529100","https://openalex.org/W6677554766"],"related_works":["https://openalex.org/W2952489973","https://openalex.org/W4300776969","https://openalex.org/W2106005123","https://openalex.org/W2788210652","https://openalex.org/W2266965707","https://openalex.org/W2972830027","https://openalex.org/W4387323768","https://openalex.org/W2084983808","https://openalex.org/W3144354057","https://openalex.org/W3213035342"],"abstract_inverted_index":{"This":[0],"paper":[1,33],"studies":[2],"the":[3,46],"low-rank":[4,25],"matrix":[5,26],"completion":[6,14,47],"problem":[7,15,21],"from":[8],"an":[9,23,29],"information":[10],"theoretic":[11],"perspective.":[12],"The":[13,32],"is":[16],"rephrased":[17],"as":[18],"a":[19],"communication":[20],"of":[22],"(uncoded)":[24],"source":[27],"over":[28],"erasure":[30],"channel.":[31],"then":[34],"uses":[35],"achievability":[36],"and":[37],"converse":[38],"arguments":[39],"to":[40],"present":[41],"order-wise":[42],"optimal":[43],"bounds":[44],"for":[45],"problem.":[48]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}