{"id":"https://openalex.org/W2203869917","doi":"https://doi.org/10.1109/tit.2017.2723898","title":"Low rank approximation and decomposition of large matrices using error correcting codes","display_name":"Low rank approximation and decomposition of large matrices using error correcting codes","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2203869917","doi":"https://doi.org/10.1109/tit.2017.2723898","mag":"2203869917"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2723898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2723898","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1512.09156","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Shashanka Ubaru","orcid":null},"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"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shashanka Ubaru","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Twin Cities, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Twin Cities, MN, USA","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Arya Mazumdar","orcid":null},"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"]},{"id":"https://openalex.org/I177605424","display_name":"Amherst College","ror":"https://ror.org/028vqfs63","country_code":"US","type":"education","lineage":["https://openalex.org/I177605424"]},{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arya Mazumdar","raw_affiliation_strings":["College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, USA","University of Minnesota, Twin Cities, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I177605424","https://openalex.org/I24603500"]},{"raw_affiliation_string":"University of Minnesota, Twin Cities, MN, USA","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yousef Saad","orcid":null},"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"]},{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yousef Saad","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Twin Cities, MN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Twin Cities, MN, USA","institution_ids":["https://openalex.org/I130238516","https://openalex.org/I4210101327"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.00272603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9235000014305115,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9235000014305115,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.047200001776218414,"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/T12303","display_name":"Tensor decomposition and applications","score":0.016699999570846558,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"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/low-rank-approximation","display_name":"Low-rank approximation","score":0.6044999957084656},{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"Singular value decomposition","score":0.4724000096321106},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4625999927520752},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.4521999955177307},{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.43470001220703125},{"id":"https://openalex.org/keywords/singular-value","display_name":"Singular value","score":0.428600013256073},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.424699991941452},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4235999882221222},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4124999940395355},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.3978999853134155}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6449000239372253},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.6044999957084656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5203999876976013},{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.4724000096321106},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4625999927520752},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.4521999955177307},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.43470001220703125},{"id":"https://openalex.org/C109282560","wikidata":"https://www.wikidata.org/wiki/Q4166054","display_name":"Singular value","level":3,"score":0.428600013256073},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.424699991941452},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4235999882221222},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4124999940395355},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.3978999853134155},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.39399999380111694},{"id":"https://openalex.org/C9936470","wikidata":"https://www.wikidata.org/wiki/Q6510405","display_name":"Least-squares function approximation","level":3,"score":0.3767000138759613},{"id":"https://openalex.org/C60292330","wikidata":"https://www.wikidata.org/wiki/Q1014065","display_name":"Hadamard transform","level":2,"score":0.37450000643730164},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.37070000171661377},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.36390000581741333},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.3434999883174896},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34150001406669617},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C75172450","wikidata":"https://www.wikidata.org/wiki/Q623950","display_name":"Fast Fourier transform","level":2,"score":0.30480000376701355},{"id":"https://openalex.org/C185142706","wikidata":"https://www.wikidata.org/wiki/Q1134404","display_name":"Covariance matrix","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.2971000075340271},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.28349998593330383},{"id":"https://openalex.org/C58663186","wikidata":"https://www.wikidata.org/wiki/Q6553462","display_name":"Linear least squares","level":3,"score":0.2809999883174896},{"id":"https://openalex.org/C61005703","wikidata":"https://www.wikidata.org/wiki/Q2145211","display_name":"Round-off error","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C169241690","wikidata":"https://www.wikidata.org/wiki/Q7828122","display_name":"Total least squares","level":3,"score":0.2703999876976013},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.2703000009059906},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.2590000033378601},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2017.2723898","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2723898","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1512.09156","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1512.09156","pdf_url":"https://arxiv.org/pdf/1512.09156","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1512.09156","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1512.09156","pdf_url":"https://arxiv.org/pdf/1512.09156","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2203869917.pdf","grobid_xml":"https://content.openalex.org/works/W2203869917.grobid-xml"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W1925032196","https://openalex.org/W1968691112","https://openalex.org/W1970576574","https://openalex.org/W1982114217","https://openalex.org/W1989938746","https://openalex.org/W2001943117","https://openalex.org/W2004026774","https://openalex.org/W2007399394","https://openalex.org/W2018063252","https://openalex.org/W2035080386","https://openalex.org/W2040387238","https://openalex.org/W2044610104","https://openalex.org/W2045390367","https://openalex.org/W2059867647","https://openalex.org/W2072773380","https://openalex.org/W2083774980","https://openalex.org/W2084439502","https://openalex.org/W2101043704","https://openalex.org/W2101520088","https://openalex.org/W2103560185","https://openalex.org/W2107599050","https://openalex.org/W2117756735","https://openalex.org/W2124659530","https://openalex.org/W2125444204","https://openalex.org/W2138451337","https://openalex.org/W2138621811","https://openalex.org/W2148541040","https://openalex.org/W2152402969","https://openalex.org/W2171810522","https://openalex.org/W2272279111","https://openalex.org/W2278163498","https://openalex.org/W2500090022","https://openalex.org/W2511396348","https://openalex.org/W2511916612","https://openalex.org/W2532988047","https://openalex.org/W2611015177","https://openalex.org/W2950958145","https://openalex.org/W2962768290","https://openalex.org/W2963455674","https://openalex.org/W2979473749","https://openalex.org/W3112410551","https://openalex.org/W4213311204","https://openalex.org/W4231916799","https://openalex.org/W4233413206","https://openalex.org/W4312258136","https://openalex.org/W6639303850","https://openalex.org/W6650267568","https://openalex.org/W6684281289","https://openalex.org/W6685688796","https://openalex.org/W6719172620","https://openalex.org/W6785567446","https://openalex.org/W7065283091"],"related_works":[],"abstract_inverted_index":{"Low":[0],"rank":[1,27,66],"approximation":[2,192,235],"is":[3,168,199],"an":[4,123],"important":[5],"tool":[6],"used":[7,41,61],"in":[8],"many":[9],"applications":[10],"of":[11,35,83,118,122,126,174],"signal":[12],"processing":[13],"and":[14,29,68,71,97,113,131,143],"machine":[15],"learning.":[16],"Recently,":[17],"randomized":[18],"sketching":[19],"algorithms":[20],"were":[21,40],"proposed":[22],"to":[23,42,62,75,95],"effectively":[24],"construct":[25],"low":[26,65],"approximations":[28,67,207],"obtain":[30],"approximate":[31],"singular":[32],"value":[33],"decompositions":[34],"large":[36,124],"matrices.":[37,146,176,215],"Similar":[38],"ideas":[39],"solve":[43],"least":[44,77,218],"squares":[45,78,219],"regression":[46,79,220],"problems.":[47,80],"In":[48,177],"this":[49],"paper,":[50],"we":[51],"show":[52],"how":[53],"matrices":[54,87,135,142,248],"from":[55],"error":[56,185,234],"correcting":[57],"codes":[58],"can":[59,186,208,236],"be":[60,187,209,237],"find":[63],"such":[64],"matrix":[69],"decompositions,":[70],"extend":[72],"the":[73,89,109,120,165,229],"framework":[74],"linear":[76],"The":[81],"benefits":[82],"using":[84],"these":[85],"code":[86,103,134,175,203,247],"are":[88,93,249],"following.":[90],"First,":[91],"they":[92,98],"easy":[94],"generate":[96],"reduce":[99],"randomness":[100],"significantly.":[101],"Second,":[102],"matrices,":[104,153,204],"with":[105,193,201,239,242],"mild":[106],"restrictions,":[107],"satisfy":[108],"subspace":[110,125],"embedding":[111],"property,":[112],"have":[114,136],"a":[115,162,190],"better":[116],"chance":[117],"preserving":[119],"geometry":[121],"vectors.":[127],"Third,":[128],"for":[129,161,171,189,211,217],"parallel":[130],"distributed":[132],"applications,":[133],"significant":[137],"advantages":[138],"over":[139],"structured":[140,202],"random":[141,145],"Gaussian":[144],"Fourth,":[147],"unlike":[148],"Fourier":[149],"or":[150],"Hadamard":[151],"transform":[152],"which":[154],"require":[155],"sampling":[156],"O(k":[157],"log":[158,166],"k)":[159],"columns":[160],"rank-k":[163,191],"approximation,":[164],"factor":[167],"not":[169],"necessary":[170],"certain":[172,246],"types":[173],"particular,":[178],"(1":[179,230],"+":[180,231],"\u03f5)":[181],"optimal":[182],"Frobenius":[183],"norm":[184],"achieved":[188,210,238],"O(k/\u03f5)":[194],"samples.":[195],"Fifth,":[196],"fast":[197,206],"multiplication":[198],"possible":[200],"so":[205],"general":[212],"dense":[213],"input":[214],"Sixth,":[216],"problem":[221],"min":[222],"\u2225Ax":[223],"-":[224],"b\u22252where":[225],"A":[226],"\u2208":[227],"Rn\u00d7d,":[228],"E)":[232],"relative":[233],"O(d/\u03f5)":[240],"samples,":[241],"high":[243],"probability,":[244],"when":[245],"used.":[250]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2016-06-24T00:00:00"}