{"id":"https://openalex.org/W3208989687","doi":"https://doi.org/10.1145/3459637.3482154","title":"New Tight Relaxations of Rank Minimization for Multi-Task Learning","display_name":"New Tight Relaxations of Rank Minimization for Multi-Task Learning","publication_year":2021,"publication_date":"2021-10-26","ids":{"openalex":"https://openalex.org/W3208989687","doi":"https://doi.org/10.1145/3459637.3482154","mag":"3208989687"},"language":"en","primary_location":{"id":"doi:10.1145/3459637.3482154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3459637.3482154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management","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/A5101979335","display_name":"Wei Chang","orcid":"https://orcid.org/0000-0001-6286-5462"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Chang","raw_affiliation_strings":["Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003222421","display_name":"Feiping Nie","orcid":"https://orcid.org/0000-0002-0871-6519"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feiping Nie","raw_affiliation_strings":["Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030351224","display_name":"Rong Wang","orcid":"https://orcid.org/0000-0001-9240-6726"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rong Wang","raw_affiliation_strings":["Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100740143","display_name":"Xuelong Li","orcid":"https://orcid.org/0000-0002-0019-4197"},"institutions":[{"id":"https://openalex.org/I17145004","display_name":"Northwestern Polytechnical University","ror":"https://ror.org/01y0j0j86","country_code":"CN","type":"education","lineage":["https://openalex.org/I17145004"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuelong Li","raw_affiliation_strings":["Northwestern Polytechnical University, Xi'an, China"],"affiliations":[{"raw_affiliation_string":"Northwestern Polytechnical University, Xi'an, China","institution_ids":["https://openalex.org/I17145004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101979335"],"corresponding_institution_ids":["https://openalex.org/I17145004"],"apc_list":null,"apc_paid":null,"fwci":0.8158,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78608975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2910","last_page":"2914"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","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"}},"topics":[{"id":"https://openalex.org/T11307","display_name":"Domain Adaptation and Few-Shot Learning","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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9995999932289124,"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/T12676","display_name":"Machine Learning and ELM","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.7092134952545166},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.6405805349349976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6338019371032715},{"id":"https://openalex.org/keywords/multi-task-learning","display_name":"Multi-task learning","score":0.6209253668785095},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5757827758789062},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5394516587257385},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.5303025245666504},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.47909098863601685},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4668847620487213},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.45182108879089355},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.42850032448768616},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4228418469429016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4083852767944336},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3832210600376129},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26911717653274536},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.09196442365646362}],"concepts":[{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.7092134952545166},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.6405805349349976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6338019371032715},{"id":"https://openalex.org/C28006648","wikidata":"https://www.wikidata.org/wiki/Q6934509","display_name":"Multi-task learning","level":3,"score":0.6209253668785095},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5757827758789062},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5394516587257385},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.5303025245666504},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47909098863601685},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4668847620487213},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.45182108879089355},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.42850032448768616},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4228418469429016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4083852767944336},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3832210600376129},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26911717653274536},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.09196442365646362},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3459637.3482154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3459637.3482154","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4300000071525574,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W195665135","https://openalex.org/W1492459858","https://openalex.org/W1497745584","https://openalex.org/W1975172027","https://openalex.org/W1986744686","https://openalex.org/W1998635907","https://openalex.org/W2018096278","https://openalex.org/W2024343065","https://openalex.org/W2047028564","https://openalex.org/W2065180801","https://openalex.org/W2102341081","https://openalex.org/W2102630986","https://openalex.org/W2118550318","https://openalex.org/W2130903752","https://openalex.org/W2135046866","https://openalex.org/W2135596338","https://openalex.org/W2157751286","https://openalex.org/W2172114485","https://openalex.org/W2186054958","https://openalex.org/W2604418621","https://openalex.org/W2753709519","https://openalex.org/W2809497023","https://openalex.org/W2913340405","https://openalex.org/W2979651795","https://openalex.org/W3028836324"],"related_works":["https://openalex.org/W1980381208","https://openalex.org/W2364594919","https://openalex.org/W2167092671","https://openalex.org/W1861706286","https://openalex.org/W2219338811","https://openalex.org/W2149583853","https://openalex.org/W2143002539","https://openalex.org/W4293472652","https://openalex.org/W2130386332","https://openalex.org/W2980357123"],"abstract_inverted_index":{"Multi-task":[0],"learning":[1,23,30,41,141],"has":[2],"been":[3],"observed":[4],"by":[5,56,113],"many":[6],"researchers,":[7],"which":[8,48,104],"supposes":[9],"that":[10,125],"different":[11],"tasks":[12,25],"can":[13,49,105,128],"share":[14],"a":[15,94,115],"low-rank":[16,132],"common":[17],"yet":[18],"latent":[19,54],"subspace.":[20],"It":[21],"means":[22],"multiple":[24],"jointly":[26],"is":[27],"better":[28],"than":[29,76],"them":[31],"independently.":[32],"In":[33],"this":[34],"paper,":[35],"we":[36,92],"propose":[37],"two":[38,45],"novel":[39,95],"multi-task":[40,140],"formulations":[42],"based":[43,97],"on":[44,121],"regularization":[46,66],"terms,":[47],"learn":[50],"the":[51,58,69,86,108,131],"optimal":[52],"shared":[53,134],"subspace":[55],"minimizing":[57],"exactly":[59],"k":[60],"minimal":[61],"singular":[62],"values.":[63],"The":[64],"proposed":[65],"terms":[67],"are":[68],"more":[70],"tight":[71],"approximations":[72],"of":[73],"rank":[74,88,110],"minimization":[75,89,111],"trace":[77],"norm.":[78],"But":[79],"it's":[80],"an":[81],"NP-hard":[82],"problem":[83,112],"to":[84,100],"solve":[85,101],"exact":[87,109],"problem.":[90],"Therefore,":[91],"design":[93],"re-weighted":[96],"iterative":[98],"strategy":[99],"our":[102,126],"models,":[103],"tactically":[106],"handle":[107],"setting":[114],"large":[116],"penalizing":[117],"parameter.":[118],"Experimental":[119],"results":[120],"benchmark":[122],"datasets":[123],"demonstrate":[124],"methods":[127],"correctly":[129],"recover":[130],"structure":[133],"across":[135],"tasks,":[136],"and":[137],"outperform":[138],"related":[139],"methods.":[142]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}