Scalable Unidirectional Pareto Optimality for Multi-Task Learning with Constraints
Multi-objective optimization (MOO) problems require balancing competing objectives, often under constraints. The Pareto optimal solution set defines all possible optimal trade-offs over such objectives. In this work, we present a novel method for Pareto-front learning: inducing the full Pareto manifold at train-time so users can pick any desired optimal trade-off point at run-time. Our key insight is to exploit Fritz-John Conditions for a novel guided double gradient descent strategy. Evaluation on synthetic benchmark problems allows us to vary MOO problem difficulty in controlled fashion and measure accuracy vs. known analytic solutions. We further test scalability and generalization in learning optimal neural model parameterizations for Multi-Task Learning (MTL) on image classification. Results show consistent improvement in accuracy and efficiency over prior MTL methods as well as techniques from operations research.
Code (0)
등록된 구현이 없습니다.
Tasks
image-classificationImage ClassificationMulti-Task LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
Creating meaningful interpretations for black-box machine learning models involves balancing two often conflicting objectives: accuracy and explainability. Exploring the trade-off between these objectives is essential fo…
Pareto optimality, economy-effectiveness trade-offs and ion channel degeneracy: Improving population models of neurons
Nerve cells encounter unavoidable evolutionary trade-offs between multiple tasks. They must consume as little energy as possible (be energy-efficient or economical) but at the same time fulfil their functions (be functio…
Distributional Pareto-Optimal Multi-Objective Reinforcement Learning
Multi-objective reinforcement learning (MORL) has been proposed to learn control policies over multiple competing objectives with each possible preference over returns. However, current MORL algorithms fail to account fo…
Autonomous DrivingMulti-Objective Reinforcement Learningreinforcement-learningReinforcement LearningPareto Frontier Approximation Network (PA-Net) to Solve Bi-objective TSP
The travelling salesperson problem (TSP) is a classic resource allocation problem used to find an optimal order of doing a set of tasks while minimizing (or maximizing) an associated objective function. It is widely used…
Reinforcement Learning (RL)SchedulingCertifying Pareto-Optimality in Multi-Objective Maximum Satisfiability
Due to the wide employment of automated reasoning in the analysis and construction of correct systems, the results reported by automated reasoning engines must be trustworthy. For Boolean satisfiability (SAT) solvers - a…