{"id":"https://openalex.org/W7162091986","doi":"https://doi.org/10.48550/arxiv.2605.22724","title":"Multiple Neural Operators Achieve Near-Optimal Rates for Multi-Task Learning","display_name":"Multiple Neural Operators Achieve Near-Optimal Rates for Multi-Task Learning","publication_year":2026,"publication_date":"2026-05-21","ids":{"openalex":"https://openalex.org/W7162091986","doi":"https://doi.org/10.48550/arxiv.2605.22724"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.22724","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22724","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.22724","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132910954","display_name":"Adrien Weihs","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weihs, Adrien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5086926394","display_name":"Hayden Schaeffer","orcid":"https://orcid.org/0000-0003-1379-1238"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schaeffer, Hayden","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.6467000246047974,"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.6467000246047974,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.09719999879598618,"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/T10320","display_name":"Neural Networks and Applications","score":0.05779999867081642,"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/operator","display_name":"Operator (biology)","score":0.619700014591217},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5577999949455261},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.5138000249862671},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4936000108718872},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.49140000343322754},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.484499990940094},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.47909998893737793},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4674000144004822}],"concepts":[{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.619700014591217},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5577999949455261},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.5138000249862671},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4986000061035156},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.49140000343322754},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.484499990940094},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4674000144004822},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.41769999265670776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39590001106262207},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38670000433921814},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3720000088214874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C2982736386","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Statistical learning","level":2,"score":0.29989999532699585},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29589998722076416},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.28110000491142273},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C43929395","wikidata":"https://www.wikidata.org/wiki/Q1198874","display_name":"Operator theory","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C2779915298","wikidata":"https://www.wikidata.org/wiki/Q7604400","display_name":"Statistical learning theory","level":3,"score":0.25270000100135803},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.25209999084472656}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.22724","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22724","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.22724","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.22724","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,88],"study":[1],"the":[2,21,46,73,80,115],"approximation":[3,41],"and":[4,42,56,103],"statistical":[5,43],"complexity":[6,55],"of":[7,10,30,53,96],"learning":[8,78],"collections":[9],"operators":[11],"in":[12],"a":[13,18,51,93,107],"shared":[14,66],"multi-task":[15,76,94],"setting,":[16],"with":[17,92],"focus":[19],"on":[20,99],"Multiple":[22],"Neural":[23],"Operators":[24],"(MNO)":[25],"architecture.":[26],"For":[27],"broad":[28],"classes":[29],"Lipschitz":[31],"multiple":[32],"operator":[33,77,86],"maps,":[34],"we":[35,49],"derive":[36],"near-optimal":[37],"upper":[38],"bounds":[39],"for":[40],"generalization.":[44],"On":[45],"lower-bound":[47],"side,":[48],"establish":[50],"curse":[52],"parametric":[54],"prove":[57],"corresponding":[58],"minimax":[59],"rates.":[60,118],"Together,":[61],"these":[62],"results":[63],"show":[64,104],"that":[65],"representations":[67],"across":[68],"tasks":[69],"do":[70],"not":[71],"increase":[72],"overall":[74],"cost:":[75],"follows":[79],"same":[81,116],"scaling":[82],"laws":[83],"as":[84],"single":[85],"learning.":[87],"also":[89],"compare":[90],"MNO":[91],"extension":[95],"DeepONet":[97],"based":[98],"concatenated":[100],"task":[101],"inputs":[102],"that,":[105],"from":[106],"worst-case":[108],"approximation-complexity":[109],"perspective,":[110],"both":[111],"architectures":[112],"satisfy":[113],"essentially":[114],"asymptotic":[117]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-23T00:00:00"}