{"id":"https://openalex.org/W2111604514","doi":"https://doi.org/10.1145/2213977.2213994","title":"Computing a nonnegative matrix factorization -- provably","display_name":"Computing a nonnegative matrix factorization -- provably","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2111604514","doi":"https://doi.org/10.1145/2213977.2213994","mag":"2111604514"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2213994","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2213994","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-fourth 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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sanjeev Arora","raw_affiliation_strings":["Princeton University and Center for Computational Intractability, Princeton, NJ, USA","Princeton University and Center for Computational Intractability, Princeton, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Princeton University and Center for Computational Intractability, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University and Center for Computational Intractability, Princeton, NJ, USA#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101636973","display_name":"Rong Ge","orcid":"https://orcid.org/0000-0003-2807-7168"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rong Ge","raw_affiliation_strings":["Princeton University and Center for Computational Intractability, Princeton, NJ, USA","Princeton University and Center for Computational Intractability, Princeton, NJ, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Princeton University and Center for Computational Intractability, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University and Center for Computational Intractability, Princeton, NJ, USA#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111706327","display_name":"Ravindran Kannan","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Ravindran Kannan","raw_affiliation_strings":["Microsoft Research India, Bangalore , India","Microsoft Research india, Bangalore, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bangalore , India","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research india, Bangalore, India#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045798295","display_name":"Ankur Moitra","orcid":"https://orcid.org/0000-0001-7047-0495"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankur Moitra","raw_affiliation_strings":["Institute for Advanced Study, Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103209777"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":24.2161,"has_fulltext":false,"cited_by_count":293,"citation_normalized_percentile":{"value":0.99702269,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.8680111169815063},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.6762610673904419},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.630142331123352},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5985413789749146},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5564563274383545},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.530670702457428},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.521637499332428},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5137127637863159},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47093191742897034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4695710837841034},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46405234932899475},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.44588035345077515},{"id":"https://openalex.org/keywords/exponential-family","display_name":"Exponential family","score":0.43371209502220154},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.42570385336875916},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4193309545516968},{"id":"https://openalex.org/keywords/nonnegative-matrix","display_name":"Nonnegative matrix","score":0.4178028404712677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4167150557041168},{"id":"https://openalex.org/keywords/polynomial-matrix","display_name":"Polynomial matrix","score":0.4125206768512726},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3996885418891907},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2292754054069519},{"id":"https://openalex.org/keywords/matrix-polynomial","display_name":"Matrix polynomial","score":0.22813886404037476},{"id":"https://openalex.org/keywords/symmetric-matrix","display_name":"Symmetric matrix","score":0.19923192262649536},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.1581527590751648},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.08357217907905579}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.8680111169815063},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.6762610673904419},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.630142331123352},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5985413789749146},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5564563274383545},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.530670702457428},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.521637499332428},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5137127637863159},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47093191742897034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4695710837841034},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46405234932899475},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44588035345077515},{"id":"https://openalex.org/C55974624","wikidata":"https://www.wikidata.org/wiki/Q1188504","display_name":"Exponential family","level":2,"score":0.43371209502220154},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.42570385336875916},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4193309545516968},{"id":"https://openalex.org/C139018669","wikidata":"https://www.wikidata.org/wiki/Q6961560","display_name":"Nonnegative matrix","level":4,"score":0.4178028404712677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4167150557041168},{"id":"https://openalex.org/C126352355","wikidata":"https://www.wikidata.org/wiki/Q2562273","display_name":"Polynomial matrix","level":4,"score":0.4125206768512726},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3996885418891907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2292754054069519},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.22813886404037476},{"id":"https://openalex.org/C54848796","wikidata":"https://www.wikidata.org/wiki/Q339011","display_name":"Symmetric matrix","level":3,"score":0.19923192262649536},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.1581527590751648},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.08357217907905579},{"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/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","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/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2213994","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2213994","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-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W199556903","https://openalex.org/W1488671644","https://openalex.org/W1548802052","https://openalex.org/W1550331971","https://openalex.org/W1553142094","https://openalex.org/W1612003148","https://openalex.org/W1729969041","https://openalex.org/W1880262756","https://openalex.org/W1902027874","https://openalex.org/W1972326413","https://openalex.org/W1985572324","https://openalex.org/W1990516625","https://openalex.org/W1991813962","https://openalex.org/W1998919258","https://openalex.org/W2012948111","https://openalex.org/W2013029404","https://openalex.org/W2024153162","https://openalex.org/W2027044307","https://openalex.org/W2043819507","https://openalex.org/W2049626882","https://openalex.org/W2059745395","https://openalex.org/W2060972166","https://openalex.org/W2061987651","https://openalex.org/W2073414385","https://openalex.org/W2082387287","https://openalex.org/W2095405086","https://openalex.org/W2101837070","https://openalex.org/W2118718620","https://openalex.org/W2124172487","https://openalex.org/W2128554561","https://openalex.org/W2135029798","https://openalex.org/W2140318696","https://openalex.org/W2147152072","https://openalex.org/W2148294996","https://openalex.org/W2151549243","https://openalex.org/W2152557171","https://openalex.org/W2167816765","https://openalex.org/W2318268489","https://openalex.org/W2911447274","https://openalex.org/W3143596294","https://openalex.org/W4205778870","https://openalex.org/W4298290503","https://openalex.org/W6636440780","https://openalex.org/W6639619044","https://openalex.org/W6653854142","https://openalex.org/W6674338859","https://openalex.org/W6680012447"],"related_works":["https://openalex.org/W2088770317","https://openalex.org/W3010134153","https://openalex.org/W2991398534","https://openalex.org/W2012642013","https://openalex.org/W1845372869","https://openalex.org/W2166191203","https://openalex.org/W2165495021","https://openalex.org/W2091334405","https://openalex.org/W1511345785","https://openalex.org/W2766677574"],"abstract_inverted_index":{"The":[0,172],"Nonnegative":[1],"Matrix":[2],"Factorization":[3],"(NMF)":[4],"problem":[5,53,63],"has":[6,29,132],"a":[7,42,58,70,78,90,118,133],"rich":[8],"history":[9],"spanning":[10],"quantum":[11],"mechanics,":[12],"probability":[13],"theory,":[14],"data":[15],"analysis,":[16],"polyhedral":[17],"combinatorics,":[18],"communication":[19],"complexity,":[20],"demography,":[21],"chemometrics,":[22],"etc.":[23],"In":[24],"the":[25,37,85,141,162],"past":[26],"decade":[27],"NMF":[28,97,103,124],"become":[30],"enormously":[31],"popular":[32],"in":[33,66,107,128,153,156,170,192],"machine":[34],"learning,":[35],"where":[36],"factorization":[38],"is":[39,54,64,104,112,179,188],"computed":[40],"using":[41],"variety":[43],"of":[44,60],"local":[45],"search":[46],"heuristics.":[47],"Vavasis":[48],"recently":[49],"proved":[50],"that":[51,121,151],"this":[52,62,116],"NP-complete.":[55],"We":[56,88,114,147],"initiate":[57],"study":[59],"when":[61,110],"solvable":[65],"polynomial":[67,155],"time.":[68],"Consider":[69],"nonnegative":[71],"m":[72,158],"x":[73],"n":[74],"matrix":[75],"$M$":[76],"and":[77,95,159,168,181],"target":[79],"inner-dimension":[80],"r.":[81,101],"Our":[82],"results":[83],"are":[84,144],"following:":[86],"-":[87,146],"give":[89,148],"polynomial-time":[91],"algorithm":[92,143,150,173],"for":[93,98],"exact":[94,123],"approximate":[96],"every":[99],"constant":[100],"Indeed":[102],"most":[105],"interesting":[106],"applications":[108],"precisely":[109],"r":[111,160],"small.":[113],"complement":[115],"with":[117],"hardness":[119],"result,":[120],"if":[122],"can":[125],"be":[126,175],"solved":[127],"time":[129,135,154],"(nm)o(r),":[130],"3-SAT":[131],"sub-exponential":[134],"algorithm.":[136],"Hence,":[137],"substantial":[138],"improvements":[139],"to":[140,190],"above":[142],"unlikely.":[145],"an":[149],"runs":[152],"n,":[157],"under":[161],"separablity":[163],"condition":[164],"identified":[165],"by":[166],"Donoho":[167],"Stodden":[169],"2003.":[171],"may":[174],"practical":[176,194],"since":[177],"it":[178],"simple":[180],"noise":[182],"tolerant":[183],"(under":[184],"benign":[185],"assumptions).":[186],"Separability":[187],"believed":[189],"hold":[191],"many":[193],"settings.":[195]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":23},{"year":2018,"cited_by_count":35},{"year":2017,"cited_by_count":40},{"year":2016,"cited_by_count":36},{"year":2015,"cited_by_count":31},{"year":2014,"cited_by_count":30},{"year":2013,"cited_by_count":24},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}