{"id":"https://openalex.org/W2622391651","doi":"https://doi.org/10.1145/3078505.3080573","title":"Matrix Factorization at the Frontier of Non-convex Optimizations","display_name":"Matrix Factorization at the Frontier of Non-convex Optimizations","publication_year":2017,"publication_date":"2017-06-05","ids":{"openalex":"https://openalex.org/W2622391651","doi":"https://doi.org/10.1145/3078505.3080573","mag":"2622391651"},"language":"en","primary_location":{"id":"doi:10.1145/3078505.3080573","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3078505.3080573","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","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/A5028243041","display_name":"Sewoong Oh","orcid":"https://orcid.org/0000-0002-8975-8306"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sewoong Oh","raw_affiliation_strings":["University of illinois at Urbana-Champaign, Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"University of illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028243041"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06301615,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"62","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9979000091552734,"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":0.9979000091552734,"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/T11447","display_name":"Blind Source Separation Techniques","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9793999791145325,"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/matrix-decomposition","display_name":"Matrix decomposition","score":0.6533612608909607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5690798759460449},{"id":"https://openalex.org/keywords/robust-principal-component-analysis","display_name":"Robust principal component analysis","score":0.5570216178894043},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5406484603881836},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5050469040870667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47659653425216675},{"id":"https://openalex.org/keywords/non-negative-matrix-factorization","display_name":"Non-negative matrix factorization","score":0.47414156794548035},{"id":"https://openalex.org/keywords/principal-component-analysis","display_name":"Principal component analysis","score":0.4710756838321686},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45332425832748413},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4438299536705017},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.4324921667575836},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.4224601984024048},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37157320976257324},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3573625087738037},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3226727247238159},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26879239082336426}],"concepts":[{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.6533612608909607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5690798759460449},{"id":"https://openalex.org/C2777749129","wikidata":"https://www.wikidata.org/wiki/Q17148469","display_name":"Robust principal component analysis","level":3,"score":0.5570216178894043},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5406484603881836},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5050469040870667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47659653425216675},{"id":"https://openalex.org/C152671427","wikidata":"https://www.wikidata.org/wiki/Q10843505","display_name":"Non-negative matrix factorization","level":4,"score":0.47414156794548035},{"id":"https://openalex.org/C27438332","wikidata":"https://www.wikidata.org/wiki/Q2873","display_name":"Principal component analysis","level":2,"score":0.4710756838321686},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45332425832748413},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4438299536705017},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.4324921667575836},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.4224601984024048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37157320976257324},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3573625087738037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3226727247238159},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26879239082336426},{"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/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"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/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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3078505.3080573","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3078505.3080573","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2060132011","https://openalex.org/W2293190623","https://openalex.org/W2963582277","https://openalex.org/W3209583484","https://openalex.org/W2531644717","https://openalex.org/W2583779396","https://openalex.org/W2589063463","https://openalex.org/W2783661942","https://openalex.org/W2952822330","https://openalex.org/W4229918824"],"abstract_inverted_index":{"Principal":[0],"Component":[1,6],"Analysis":[2,7],"(PCA)":[3],"and":[4,33,43,99,103],"Canonical":[5],"(CCA)":[8],"are":[9,69],"two":[10],"of":[11,15,36,64,78,81],"the":[12,31,60,76],"few":[13],"examples":[14],"non-convex":[16,62,82],"optimization":[17,83],"problems":[18],"that":[19],"can":[20],"be":[21],"solved":[22],"efficiently":[23],"with":[24,72],"sharp":[25],"guarantees.":[26],"This":[27],"is":[28],"achieved":[29],"by":[30,55],"classical":[32],"well-established":[34],"understanding":[35,80],"matrix":[37,52,97],"factorizations.":[38],"Recently,":[39],"several":[40,88],"new":[41],"theoretical":[42],"algorithmic":[44],"challenges":[45],"have":[46],"arisen":[47],"in":[48,91,94],"statistical":[49],"learning":[50],"over":[51],"factorizations,":[53],"motivated":[54],"various":[56],"real-world":[57],"applications.":[58],"Despite":[59],"inherent":[61],"nature":[63],"these":[65],"problem,":[66],"efficient":[67],"algorithms":[68],"being":[70],"discovered":[71],"provable":[73],"guarantees,":[74],"extending":[75],"frontier":[77],"our":[79],"problems.":[84],"I":[85],"will":[86],"present":[87],"recent":[89],"results":[90],"this":[92],"area":[93],"applications":[95],"to":[96],"completion":[98],"sensing,":[100],"crowdsourcing,":[101],"ranking,":[102],"tensor":[104],"factorization.":[105]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}