A traditional and intuitively appealing Multi-Task Multiple Kernel Learning (MT-MKL) method is to optimize the sum (thus, the average) of objective functions with (partially) shared kernel function, which allows information sharing amongst tasks. We point out that the obtained solution corresponds to a single point on the Pareto Front (PF) of a Multi-Objective Optimization (MOO) problem, which considers the concurrent optimization of all task objectives involved in the Multi-Task Learning (MTL) problem. Motivated by this last observation and arguing that the former approach is heuristic, we propose a novel Support Vector Machine (SVM) MT-MKL framework, that considers an implicitly-defined set of conic combinations of task objectives. We show that solving our framework produces solutions along a path on the aforementioned PF and that it subsumes the optimization of the average of objective functions as a special case. Using algorithms we derived, we demonstrate through a series of experimental results that the framework is capable of achieving better classification performance, when compared to other similar MTL approaches.
Divide and Conquer: Provably Unveiling the Pareto Front with Multi-Objective Reinforcement Learning
Vrije Universiteit Brussel(布鲁塞尔自由大学);Université de Montréal(蒙特利尔大学);Mila - Quebec AI Institute(米拉-魁北克人工智能研究所);University of Galway(戈尔韦大学);City of Amsterdam(阿姆斯特丹市);Utrecht University(乌得勒支大学)
InversionGNN: A Dual Path Network for Multi-Property Molecular Optimization
The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));The Hong Kong University of Science and Technology(香港科技大学);DAMO Academy, Alibaba Group(阿里巴巴达摩院);Tencent AI Lab(腾讯AI Lab);University of Texas, Arlington(德克萨斯大学阿灵顿分校)
Domain Switching on the Pareto Front: Multi-Objective Deep Kernel Learning in Automated Piezoresponse Force Microscopy
University of Tennessee(田纳西大学);Institute of Science Tokyo(东京科学大学);University of California, Berkeley(加州大学伯克利分校);Rice University(莱斯大学);Pacific Northwest National Laboratory(太平洋西北国家实验室)
Deep Learning Aided Packet Routing in Aeronautical Ad-Hoc Networks Relying on Real Flight Data: From Single-Objective to Near-Pareto Multi-Objective Optimization
Beihang University(北京航空航天大学);University of Southampton(南安普顿大学);Bournemouth University(伯恩茅斯大学)
Improving Pareto Set Learning for Expensive Multi-objective Optimization via Stein Variational Hypernetworks
College of Engineering and Computer Science, VinUniversity(VinUniversity工程与计算机科学学院);The Ohio State University(俄亥俄州立大学);Singapore University of Technology and Design(新加坡科技设计大学)
The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning
University of Verona(维罗纳大学);European Organization for Nuclear Research (CERN)(欧洲核子研究组织(CERN));University of Gdansk(格但斯克大学);Middlesex University(密德萨斯大学)
Dynamic Bicycle Dispatching of Dockless Public Bicycle-sharing Systems using Multi-objective Reinforcement Learning
Hunan University(湖南大学);State University of New York(纽约州立大学);University of Illinois at Chicago(伊利诺伊大学芝加哥分校);Agency for Science Technology and Research (A*STAR)(科学、技术与研究局(A*STAR));Institute for Infocomm Research(资讯通信研究院)
Sample Path Regularity of Gaussian Processes from the Covariance Kernel
Tübingen AI Center, University of Tübingen(图宾根人工智能中心、图宾根大学);Verses AI Research Lab & ELLIS Institute(Verses AI研究实验室及ELLIS研究所);University of Tübingen(图宾根大学)
Exploring the Pareto front of multi-objective COVID-19 mitigation policies using reinforcement learning
Vrije Universiteit Brussel(布鲁塞尔自由大学);National University of Ireland Galway(爱尔兰国立大学戈尔韦分校);University of Antwerp(安特卫普大学);Hasselt University(哈瑟尔特大学);HU University of Applied Sciences Utrecht(乌得勒支应用科学大学)
Path-Coordinated Continual Learning with Neural Tangent Kernel-Justified Plasticity: A Theoretical Framework with Near State-of-the-Art Performance
Department of Computer Science & Engineering, International Institute of Information Technology (IIIT), Bhubaneswar, India(计算机科学与工程系,国际信息学院(IIIT),巴赫拉瓦尔)