{"id":"https://openalex.org/W4323521080","doi":"https://doi.org/10.1109/ieeeconf56349.2022.10051825","title":"Memory-Efficient Convex Optimization for Self-Dictionary Nonnegative Matrix Factorization","display_name":"Memory-Efficient Convex Optimization for Self-Dictionary Nonnegative Matrix Factorization","publication_year":2022,"publication_date":"2022-10-31","ids":{"openalex":"https://openalex.org/W4323521080","doi":"https://doi.org/10.1109/ieeeconf56349.2022.10051825"},"language":"en","primary_location":{"id":"doi:10.1109/ieeeconf56349.2022.10051825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeeconf56349.2022.10051825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 56th Asilomar Conference on Signals, Systems, and Computers","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/A5100611361","display_name":"Tri Nguyen","orcid":"https://orcid.org/0000-0003-1986-9841"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tri Nguyen","raw_affiliation_strings":["School of Electrical Engineering and Computer Science Oregon State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science Oregon State University","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015075381","display_name":"Xiao Fu","orcid":"https://orcid.org/0000-0003-4847-9586"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiao Fu","raw_affiliation_strings":["School of Electrical Engineering and Computer Science Oregon State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science Oregon State University","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057100970","display_name":"Ruiyuan Wu","orcid":"https://orcid.org/0000-0002-7751-4355"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ruiyuan Wu","raw_affiliation_strings":["The Chinese University of Hong Kong,Department of Electronic Engineering","Department of Electronic Engineering, The Chinese University of Hong Kong"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,Department of Electronic Engineering","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2031,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50855706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1372","last_page":"1376"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10057","display_name":"Face and Expression Recognition","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10689","display_name":"Remote-Sensing Image Classification","score":0.9883999824523926,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9587000012397766,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.7387112379074097},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6251006722450256},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47940537333488464},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.4685094654560089},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4669160842895508},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.44685792922973633},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43951404094696045},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4261718690395355},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.42024871706962585},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41901612281799316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4146963059902191},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.343990296125412},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.268579363822937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24072247743606567}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.7387112379074097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6251006722450256},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47940537333488464},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.4685094654560089},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4669160842895508},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.44685792922973633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43951404094696045},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4261718690395355},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.42024871706962585},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41901612281799316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4146963059902191},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.343990296125412},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.268579363822937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24072247743606567},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieeeconf56349.2022.10051825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeeconf56349.2022.10051825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 56th Asilomar Conference on Signals, Systems, and Computers","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1451640967","display_name":null,"funder_award_id":"W911NF19-1-0407","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1969013340","https://openalex.org/W1982755765","https://openalex.org/W2040399008","https://openalex.org/W2046793177","https://openalex.org/W2063790512","https://openalex.org/W2117986441","https://openalex.org/W2124172487","https://openalex.org/W2125118959","https://openalex.org/W2125126993","https://openalex.org/W2128521126","https://openalex.org/W2134328014","https://openalex.org/W2136885855","https://openalex.org/W2140318696","https://openalex.org/W2157321686","https://openalex.org/W2167732364","https://openalex.org/W2528824794","https://openalex.org/W2603483232","https://openalex.org/W2752365628","https://openalex.org/W2766055969","https://openalex.org/W2950143340","https://openalex.org/W2976088223","https://openalex.org/W3091551346","https://openalex.org/W3104256134","https://openalex.org/W3104744791","https://openalex.org/W3105145047","https://openalex.org/W3106158395","https://openalex.org/W3114089334","https://openalex.org/W3198728162","https://openalex.org/W3201362552","https://openalex.org/W6600043445","https://openalex.org/W6633456375","https://openalex.org/W6675907514","https://openalex.org/W6677605506","https://openalex.org/W6680770193","https://openalex.org/W6730067477","https://openalex.org/W6741565038","https://openalex.org/W6765217860","https://openalex.org/W6767394681","https://openalex.org/W6783569511"],"related_works":["https://openalex.org/W2127243424","https://openalex.org/W4390394189","https://openalex.org/W2037504162","https://openalex.org/W2539013788","https://openalex.org/W2792706544","https://openalex.org/W1568451138","https://openalex.org/W2156699640","https://openalex.org/W2045265907","https://openalex.org/W2972997031","https://openalex.org/W2075222291"],"abstract_inverted_index":{"The":[0,64,119],"separable":[1],"nonnegative":[2],"matrix":[3],"factorization":[4],"(NMF)":[5],"model":[6],"has":[7,66,76,122],"been":[8,67],"adopted":[9],"in":[10,106,129],"many":[11],"applications":[12],"(e.g.,":[13],"topic":[14],"modeling":[15],"and":[16,46,60,151],"community":[17],"detection),":[18],"as":[19,39],"it":[20,103],"ensures":[21],"identifiability":[22],"of":[23,162],"the":[24,86,100,130,141,159,163],"latent":[25],"factors":[26],"with":[27,97],"polynomial":[28],"time":[29],"algorithms":[30,47,84],"under":[31,48],"reasonable":[32],"assumptions.":[33],"Separable":[34],"NMF":[35],"is":[36,140],"often":[37],"formulated":[38],"a":[40,92,112,123],"self-dictionary":[41],"(SD)":[42],"sparse":[43,88],"regression":[44,89],"problem,":[45],"this":[49,117,139,147],"formulation":[50],"can":[51],"be":[52,70],"categorized":[53],"into":[54],"two":[55],"classes,":[56],"namely,":[57],"greedy":[58],"methods":[59],"all-at-once":[61],"convex":[62,82],"optimization.":[63],"latter":[65],"shown":[68],"to":[69,73,99,115,157],"more":[71],"resilient":[72],"noise,":[74],"but":[75],"serious":[77],"scalability":[78],"issues.":[79],"Particularly,":[80],"existing":[81],"optimization":[83],"for":[85,146],"SD":[87],"problem":[90],"cost":[91,125],"memory":[93,124,144,160],"that":[94,126],"grows":[95,127],"quadratically":[96],"respect":[98],"data":[101,131,153],"size-making":[102],"hardly":[104],"useful":[105],"practice.":[107],"This":[108],"work":[109],"puts":[110],"forth":[111],"Frank-Wolfe":[113],"algorithm":[114,145],"tackle":[116],"challenge.":[118],"proposed":[120,164],"method":[121],"linearly":[128],"size-with":[132],"provable":[133],"guarantees.":[134],"To":[135],"our":[136],"best":[137],"knowledge,":[138],"first":[142],"linear":[143],"long-existing":[148],"problem.":[149],"Synthetic":[150],"real":[152],"experiments":[154],"are":[155],"used":[156],"showcase":[158],"efficiency":[161],"algorithm.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}