{"id":"https://openalex.org/W2084439502","doi":"https://doi.org/10.1145/1536414.1536446","title":"A fast and efficient algorithm for low-rank approximation of a matrix","display_name":"A fast and efficient algorithm for low-rank approximation of a matrix","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2084439502","doi":"https://doi.org/10.1145/1536414.1536446","mag":"2084439502"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","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/A5103324660","display_name":"Nam H. Nguyen","orcid":"https://orcid.org/0000-0002-1254-0069"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nam H. Nguyen","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108518984","display_name":"T. Thong","orcid":null},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thong T. Do","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101413113","display_name":"Trac D. Tran","orcid":"https://orcid.org/0000-0002-0421-8416"},"institutions":[{"id":"https://openalex.org/I145311948","display_name":"Johns Hopkins University","ror":"https://ror.org/00za53h95","country_code":"US","type":"education","lineage":["https://openalex.org/I145311948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Trac D. Tran","raw_affiliation_strings":["Johns Hopkins University, Baltimore, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Johns Hopkins University, Baltimore, MD, USA","institution_ids":["https://openalex.org/I145311948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.3488,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.96248685,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"224"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9997000098228455,"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/T12303","display_name":"Tensor decomposition and applications","score":0.992900013923645,"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/mathematics","display_name":"Mathematics","score":0.6456485390663147},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.6248118877410889},{"id":"https://openalex.org/keywords/matrix-norm","display_name":"Matrix norm","score":0.6077470779418945},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5742674469947815},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.5707703828811646},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5541952848434448},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5000598430633545},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4916580319404602},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4664686620235443},{"id":"https://openalex.org/keywords/row-and-column-spaces","display_name":"Row and column spaces","score":0.4568721354007721},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.44655317068099976},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37799015641212463},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17121392488479614},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.12791088223457336},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08862650394439697}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6456485390663147},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.6248118877410889},{"id":"https://openalex.org/C92207270","wikidata":"https://www.wikidata.org/wiki/Q939253","display_name":"Matrix norm","level":3,"score":0.6077470779418945},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5742674469947815},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.5707703828811646},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5541952848434448},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5000598430633545},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4916580319404602},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4664686620235443},{"id":"https://openalex.org/C104140500","wikidata":"https://www.wikidata.org/wiki/Q2088159","display_name":"Row and column spaces","level":3,"score":0.4568721354007721},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.44655317068099976},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37799015641212463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17121392488479614},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.12791088223457336},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08862650394439697},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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":2,"locations":[{"id":"doi:10.1145/1536414.1536446","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536446","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.164.3549","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.3549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://thanglong.ece.jhu.edu/namnguyen/LRMA_STOC_Conf.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1573820523","https://openalex.org/W1597741994","https://openalex.org/W1970576574","https://openalex.org/W1979750072","https://openalex.org/W1998058722","https://openalex.org/W2044610104","https://openalex.org/W2045390367","https://openalex.org/W2077649571","https://openalex.org/W2080872718","https://openalex.org/W2093813380","https://openalex.org/W2119179493","https://openalex.org/W2124659530","https://openalex.org/W2147927736","https://openalex.org/W2152356156","https://openalex.org/W2152402969","https://openalex.org/W2155792383","https://openalex.org/W2610857016","https://openalex.org/W2798909945","https://openalex.org/W3037079313"],"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":{"The":[0,68,145,257],"low-rank":[1],"matrix":[2,17,45,106,167,198,290],"approximation":[3,33,75,134,306,333],"problem":[4,307],"involves":[5],"finding":[6],"of":[7,12,35,55,61,115,120,126,141,154,156,162,195,281,344],"a":[8,13,97,132,238,296,342],"rank":[9,40],"k":[10,204],"version":[11,34],"m":[14],"x":[15,310,317],"n":[16],"A,":[18,56,121],"labeled":[19],"Ak,":[20],"such":[21],"that":[22,58,187,321],"Ak":[23],"is":[24,70,135,148,180,284,292,335],"as":[25,27,182,276,278],"\"close\"":[26],"possible":[28],"to":[29,85,110,301,337],"the":[30,38,74,86,89,138,196,213,263,279,285,289,302,332,338],"best":[31,280],"SVD":[32],"A":[36,46,107,157,163,291,314],"at":[37,103,191,227,251],"same":[39],"level.":[41],"Previous":[42],"approaches":[43,79],"approximate":[44],"by":[47,150,164,188,322],"non-uniformly":[48],"adaptive":[49,90],"sampling":[50],"some":[51,125],"columns":[52,62,117,128,161],"(or":[53,118,129],"rows)":[54,119],"hoping":[57],"this":[59,93,299],"subset":[60],"contain":[63],"enough":[64],"information":[65,113],"about":[66],"A.":[67],"sub-matrix":[69],"then":[71,122],"used":[72],"for":[73],"process.":[76],"However,":[77],"these":[78,142],"are":[80],"often":[81],"computationally":[82],"intensive":[83],"due":[84],"complexity":[87],"in":[88,108,267],"sampling.":[91],"In":[92],"paper,":[94],"we":[95,211,236,319],"propose":[96],"fast":[98,171],"and":[99,158,265,346],"efficient":[100],"algorithm":[101,258,287],"which":[102],"first":[104],"pre-processes":[105],"order":[109],"spread":[111],"out":[112],"(energy)":[114],"every":[116],"randomly":[123,323],"selects":[124],"its":[127],"rows).":[130],"Finally,":[131],"rank-k":[133],"generated":[136],"from":[137],"row":[139],"space":[140],"selected":[143],"sets.":[144],"preprocessing":[146],"step":[147],"performed":[149],"uniformly":[151,189],"randomizing":[152],"signs":[153],"entries":[155],"transforming":[159],"all":[160],"an":[165],"orthonormal":[166],"F":[168],"with":[169,199,225,249,341,347],"existing":[170],"implementation":[172],"(e.g.":[173],"Hadamard,":[174],"FFT,":[175],"DCT...).":[176],"Our":[177],"main":[178],"contribution":[179],"summarized":[181],"follows.":[183],"1)":[184],"We":[185],"show":[186,320],"selecting":[190],"random":[192],"d":[193,200,234,271,325],"rows":[194],"preprocessed":[197],"=":[201,326],"(":[202],"1/\u03b7":[203],"max":[205],"{log":[206],"k,":[207],"log":[208,270,330],"1/\u03b2}":[209],"),":[210],"guarantee":[212],"relative":[214],"Frobenius":[215],"norm":[216,240],"error":[217,241],"approximation:":[218,242],"(1":[219,351],"+":[220,244,272],"\u03b7)":[221],"norm{A":[222,246,309],"-":[223,230,247,254,311,352],"Ak}F":[224],"probability":[226,250],"least":[228,252,304],"1":[229,253],"5\u03b2.":[231],"2)":[232],"With":[233],"above,":[235],"establish":[237],"spectral":[239],"(2":[243],"\u221a2m/d)":[245],"Ak}2":[248],"2\u03b2.":[255],"3)":[256],"requires":[259],"2":[260],"passes":[261],"over":[262],"data":[264],"runs":[266],"time":[268],"(mn":[269],"(m+n)":[273],"d2)":[274],"which,":[275],"far":[277],"our":[282],"knowledge,":[283],"fastest":[286],"when":[288],"dense.":[293],"4)":[294],"As":[295],"bonus,":[297],"applying":[298],"framework":[300],"well-known":[303],"square":[305],"min":[308],"b}":[312],"where":[313],"\u2208":[315],"Rm":[316],"r,":[318],"choosing":[324],"(1/\u03b7":[327],"\u03b3":[328],"r":[329],"m),":[331],"solution":[334],"proportional":[336],"optimal":[339],"one":[340],"factor":[343],"\u03b7":[345],"extremely":[348],"high":[349],"probability,":[350],"6":[353],"m-\u03b3),":[354],"say.":[355]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}