{"id":"https://openalex.org/W4416626293","doi":"https://doi.org/10.1145/3760622.3760628","title":"Unrolling Nonnegative Matrix Factorization via Learning Single Optimization Step in Alternating Optimization","display_name":"Unrolling Nonnegative Matrix Factorization via Learning Single Optimization Step in Alternating Optimization","publication_year":2025,"publication_date":"2025-04-26","ids":{"openalex":"https://openalex.org/W4416626293","doi":"https://doi.org/10.1145/3760622.3760628"},"language":"en","primary_location":{"id":"doi:10.1145/3760622.3760628","doi":"https://doi.org/10.1145/3760622.3760628","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3760622.3760628","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3760622.3760628","source":{"id":"https://openalex.org/S7407088535","display_name":"International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 9th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3760622.3760628","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042479218","display_name":"Toshimitsu Aritake","orcid":"https://orcid.org/0000-0003-1322-9157","observed_orcids":["https://orcid.org/0000-0003-1322-9157"]},"institutions":[{"id":"https://openalex.org/I111428342","display_name":"Hitotsubashi University","ror":"https://ror.org/04jqj7p05","country_code":"JP","type":"education","lineage":["https://openalex.org/I111428342"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Toshimitsu Aritake","raw_affiliation_strings":["Hitotsubashi Institute of Advanced Study, Hitotsubashi University, Kunitachi-shi, Tokyo, Japan"],"raw_orcid":"https://orcid.org/0000-0003-1322-9157","affiliations":[{"raw_affiliation_string":"Hitotsubashi Institute of Advanced Study, Hitotsubashi University, Kunitachi-shi, Tokyo, Japan","institution_ids":["https://openalex.org/I111428342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042479218"],"corresponding_institution_ids":["https://openalex.org/I111428342"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"169","last_page":"173"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.8529999852180481,"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.8529999852180481,"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/T10057","display_name":"Face and Expression Recognition","score":0.05220000073313713,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.04050000011920929,"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/unrolling","display_name":"unrolling","score":0.9020000100135803},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"non-negative matrix factorization","score":0.968999981880188},{"id":"https://openalex.org/keywords/alternating-optimization","display_name":"alternating optimization","score":0.8169999718666077},{"id":"https://openalex.org/keywords/learning-to-optimize","display_name":"learning to optimize","score":0.843999981880188},{"id":"https://openalex.org/keywords/nonconvex-optimization","display_name":"non-convex optimization","score":0.8930000066757202},{"id":"https://openalex.org/keywords/training-strategies","display_name":"training strategies","score":0.7080000042915344}],"concepts":[{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.7820000052452087},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5756999850273132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5601000189781189},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4860000014305115},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4846000075340271},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.453000009059906},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4350999891757965},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43299999833106995},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.42989999055862427},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4146000146865845},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.3296000063419342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.326200008392334},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.325300008058548},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3183000087738037},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3142000138759613},{"id":"https://openalex.org/C180623205","wikidata":"https://www.wikidata.org/wiki/Q1268589","display_name":"Outer product","level":3,"score":0.31349998712539673},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.2971999943256378},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.29179999232292175},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.28679999709129333},{"id":"https://openalex.org/C76970557","wikidata":"https://www.wikidata.org/wiki/Q1869750","display_name":"Loop unrolling","level":3,"score":0.28380000591278076},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.2671999931335449},{"id":"https://openalex.org/C49766605","wikidata":"https://www.wikidata.org/wiki/Q207643","display_name":"Linear map","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.25920000672340393},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.2524000108242035},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3760622.3760628","doi":"https://doi.org/10.1145/3760622.3760628","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3760622.3760628","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3760622.3760628","source":{"id":"https://openalex.org/S7407088535","display_name":"International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 9th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3760622.3760628","doi":"https://doi.org/10.1145/3760622.3760628","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3760622.3760628","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3760622.3760628","source":{"id":"https://openalex.org/S7407088535","display_name":"International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 9th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3421574170","display_name":"Development of a Fast and Accurate Computational Method through Learning-based Iterative Alternating Optimization","funder_award_id":"23K16953","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416626293.pdf","grobid_xml":"https://content.openalex.org/works/W4416626293.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1457323852","https://openalex.org/W1594523130","https://openalex.org/W1906770428","https://openalex.org/W2100556411","https://openalex.org/W2110096996","https://openalex.org/W2404400936","https://openalex.org/W2798559986","https://openalex.org/W2902719825","https://openalex.org/W2995038946","https://openalex.org/W2998785217","https://openalex.org/W3188921881","https://openalex.org/W4383220030"],"related_works":["https://openalex.org/W4414129191","https://openalex.org/W7114988713","https://openalex.org/W2023781725","https://openalex.org/W2110096996","https://openalex.org/W2032532623","https://openalex.org/W4362511129","https://openalex.org/W2804176448","https://openalex.org/W2155151262","https://openalex.org/W4296870992","https://openalex.org/W3201945250"],"abstract_inverted_index":{"Unrolling,":[0],"a":[1,46,56],"technique":[2],"within":[3],"the":[4,61,80],"learning-to-optimize":[5],"framework,":[6],"seeks":[7],"to":[8,30,54,78],"enhance":[9],"optimization":[10,26,53,85],"speed":[11],"and":[12,96],"effectiveness":[13,99],"through":[14,100],"supervised":[15],"learning.":[16],"While":[17],"conventional":[18],"unrolling":[19,39],"methods":[20],"have":[21],"pridominantly":[22],"focused":[23],"on":[24],"convex":[25],"problems,":[27],"their":[28],"application":[29],"nonconvex":[31],"problems":[32],"remains":[33],"limited.":[34],"This":[35],"paper":[36],"proposes":[37],"an":[38,90],"method":[40],"for":[41,94],"nonnegative":[42,57,65],"matrix":[43,59],"factorization":[44],"(NMF),":[45],"simple":[47],"linear":[48],"model":[49],"that":[50],"requires":[51],"alternating":[52],"decompose":[55],"data":[58],"into":[60],"product":[62],"of":[63],"two":[64],"matrices.":[66],"Our":[67],"method,":[68],"termed":[69],"Neural":[70],"Adaptive":[71],"Gradient":[72],"NMF":[73],"(NAG-NMF),":[74],"employs":[75],"neural":[76],"networks":[77],"estimate":[79],"update":[81],"vectors":[82],"at":[83],"each":[84],"step.":[86],"We":[87],"also":[88],"introduce":[89],"efficient":[91],"training":[92],"strategy":[93],"NAG-NMF":[95],"demonstrate":[97],"its":[98],"experimental":[101],"evaluations.":[102]},"counts_by_year":[],"updated_date":"2026-10-28T10:33:24.094632","created_date":"2025-11-25T00:00:00"}