{"id":"https://openalex.org/W4416250951","doi":"https://doi.org/10.1109/ijcnn64981.2025.11227230","title":"Combinatorial U-Curve Optimization for Multi-Task Learning: A Task Selection Approach","display_name":"Combinatorial U-Curve Optimization for Multi-Task Learning: A Task Selection Approach","publication_year":2025,"publication_date":"2025-06-30","ids":{"openalex":"https://openalex.org/W4416250951","doi":"https://doi.org/10.1109/ijcnn64981.2025.11227230"},"language":null,"primary_location":{"id":"doi:10.1109/ijcnn64981.2025.11227230","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11227230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","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/A5092457173","display_name":"Giovana Kerche Bon\u00e1s","orcid":"https://orcid.org/0009-0001-9460-8353"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Giovana K. Bon\u00e1s","raw_affiliation_strings":["Universidade Estadual de Campinas,Recod.Ai Lab, Institute of Computing,Campinas,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Estadual de Campinas,Recod.Ai Lab, Institute of Computing,Campinas,Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079620580","display_name":"Marcelo S. Reis","orcid":"https://orcid.org/0000-0002-3754-9115"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcelo S. Reis","raw_affiliation_strings":["Universidade Estadual de Campinas,Recod.Ai Lab, Institute of Computing,Campinas,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Estadual de Campinas,Recod.Ai Lab, Institute of Computing,Campinas,Brazil","institution_ids":["https://openalex.org/I181391015"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000356136","display_name":"Marcos M. Raimundo","orcid":"https://orcid.org/0000-0003-0499-2564"},"institutions":[{"id":"https://openalex.org/I181391015","display_name":"Universidade Estadual de Campinas (UNICAMP)","ror":"https://ror.org/04wffgt70","country_code":"BR","type":"education","lineage":["https://openalex.org/I181391015"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcos M. Raimundo","raw_affiliation_strings":["Universidade Estadual de Campinas,Recod.Ai Lab, Institute of Computing,Campinas,Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Estadual de Campinas,Recod.Ai Lab, Institute of Computing,Campinas,Brazil","institution_ids":["https://openalex.org/I181391015"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5092457173"],"corresponding_institution_ids":["https://openalex.org/I181391015"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19440528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.8815000057220459,"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.8815000057220459,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.019500000402331352,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.01140000019222498,"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/overfitting","display_name":"Overfitting","score":0.7894999980926514},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.7239999771118164},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6122999787330627},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.489300012588501},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4846999943256378},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4090999960899353},{"id":"https://openalex.org/keywords/synthetic-data","display_name":"Synthetic data","score":0.3752000033855438}],"concepts":[{"id":"https://openalex.org/C22019652","wikidata":"https://www.wikidata.org/wiki/Q331309","display_name":"Overfitting","level":3,"score":0.7894999980926514},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7239999771118164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7207000255584717},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.6779999732971191},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.664900004863739},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6122999787330627},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.489300012588501},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4846999943256378},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4090999960899353},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.38269999623298645},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.3752000033855438},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.3711000084877014},{"id":"https://openalex.org/C28006648","wikidata":"https://www.wikidata.org/wiki/Q6934509","display_name":"Multi-task learning","level":3,"score":0.33169999718666077},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.3102000057697296},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.2987000048160553},{"id":"https://openalex.org/C51632099","wikidata":"https://www.wikidata.org/wiki/Q3985153","display_name":"Training set","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C151956035","wikidata":"https://www.wikidata.org/wiki/Q1132755","display_name":"Logistic regression","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C207685749","wikidata":"https://www.wikidata.org/wiki/Q2088941","display_name":"Domain knowledge","level":2,"score":0.2547999918460846}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn64981.2025.11227230","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn64981.2025.11227230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 International Joint Conference on Neural Networks (IJCNN)","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":20,"referenced_works":["https://openalex.org/W2032612424","https://openalex.org/W2068589268","https://openalex.org/W2076587863","https://openalex.org/W2109034827","https://openalex.org/W2124659975","https://openalex.org/W2128255043","https://openalex.org/W2138019504","https://openalex.org/W2165698076","https://openalex.org/W2586778001","https://openalex.org/W2605323333","https://openalex.org/W2609731728","https://openalex.org/W2889552870","https://openalex.org/W2889705046","https://openalex.org/W2891244534","https://openalex.org/W2897896472","https://openalex.org/W2913340405","https://openalex.org/W2963498015","https://openalex.org/W3020445536","https://openalex.org/W4297173582","https://openalex.org/W4323020871"],"related_works":[],"abstract_inverted_index":{"Multi-task":[0],"learning":[1,21,37],"(MTL)":[2],"is":[3,30,139],"an":[4,81],"approach":[5,98,201],"where":[6,36],"a":[7,96,114,155,169],"single":[8],"model":[9],"learns":[10],"multiple":[11],"tasks":[12,29,39,103,112],"simultaneously,":[13],"potentially":[14,71],"reducing":[15],"overfitting":[16],"and":[17,58,120,125,132,151,158],"speeding":[18],"up":[19],"the":[20,25,162,177,182,199],"process.":[22],"However,":[23,60],"selecting":[24],"right":[26],"combination":[27],"of":[28,176],"crucial":[31],"to":[32,99],"avoid":[33],"negative":[34,127],"transfer,":[35],"additional":[38],"might":[40],"hinder":[41],"rather":[42],"than":[43],"enhance":[44],"performance.":[45],"Research":[46],"has":[47],"explored":[48],"task":[49],"relationships":[50],"through":[51],"shared":[52],"data":[53,91,219],"samples,":[54],"features,":[55,64],"relational":[56,62],"knowledge,":[57,63,70],"parameters.":[59],"sharing":[61],"or":[65,204,220],"parameters":[66],"often":[67],"requires":[68],"domain":[69,107],"introducing":[72],"artificial":[73],"connections":[74],"between":[75],"unrelated":[76],"tasks.":[77],"This":[78],"paper":[79],"presents":[80],"MTL":[82,144],"algorithm":[83,138,167],"based":[84],"on":[85,90,130],"combinatorial":[86],"U-curve":[87],"optimization,":[88],"focusing":[89],"sample":[92],"sharing.":[93],"It":[94],"uses":[95],"branch-and-bound-based":[97],"identify":[100],"beneficial":[101],"source":[102],"without":[104],"requiring":[105],"prior":[106],"knowledge.":[108],"The":[109],"method":[110],"organizes":[111],"into":[113],"tree,":[115],"optimizing":[116],"selection":[117],"with":[118,141,217],"backtracking":[119],"pruning":[121],"for":[122],"efficient":[123],"exploration":[124],"minimal":[126],"transfer.":[128],"Results":[129],"synthetic":[131],"real-world":[133],"datasets":[134],"show":[135],"that":[136,172],"our":[137,166],"competitive":[140],"more":[142],"sophisticated":[143],"frameworks":[145],"such":[146],"as":[147],"Logistic":[148,185],"L21,":[149],"Dirty,":[150],"rMTFL,":[152],"while":[153],"maintaining":[154],"simpler":[156],"design":[157],"fewer":[159],"assumptions.":[160],"In":[161],"Spam":[163],"(Landmine)":[164],"dataset,":[165],"yielded":[168,180],"mean":[170,178],"loss":[171,179],"was":[173],"45%":[174],"(62%)":[175],"by":[181],"second-best":[183],"approach,":[184],"Dirty":[186],"(Logistic":[187],"rMTFL).":[188],"Although":[189],"numerical":[190],"improvements":[191],"over":[192],"these":[193],"baselines":[194],"are":[195],"not":[196],"always":[197],"large,":[198],"proposed":[200],"consistently":[202],"matches":[203],"slightly":[205],"outperforms":[206],"them":[207],"in":[208,215],"most":[209],"tasks,":[210],"demonstrating":[211],"robust":[212],"performance":[213],"even":[214],"scenarios":[216],"limited":[218],"outliers.":[221]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-14T00:00:00"}