all AI news
PMGDA: A Preference-based Multiple Gradient Descent Algorithm
Feb. 16, 2024, 5:41 a.m. | Xiaoyuan Zhang, Xi Lin, Qingfu Zhang
cs.LG updates on arXiv.org arxiv.org
Abstract: It is desirable in many multi-objective machine learning applications, such as multi-task learning and multi-objective reinforcement learning, to find a Pareto optimal solution that can exactly match a given preference of decision-makers. These problems are often large-scale with available gradient information but cannot be handled very well by the existing algorithms. To tackle this critical issue, this paper proposes a novel predict-and-correct framework for locating the exact Pareto optimal solutions required by a decision maker. …
abstract algorithm applications arxiv cs.lg decision gradient information machine machine learning machine learning applications makers match multi-objective multiple multi-task learning pareto reinforcement reinforcement learning scale solution type
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Lead Data Scientist, Commercial Analytics
@ Checkout.com | London, United Kingdom
Data Engineer I
@ Love's Travel Stops | Oklahoma City, OK, US, 73120