Learning the Pareto Front with Hypernetworks
Aviv Navon, Aviv Shamsian, Gal Chechik, Ethan Fetaya

TL;DR
This paper introduces Pareto HyperNetworks (PHNs), a method that learns the entire Pareto front in multi-objective optimization problems using a single hypernetwork, enabling efficient and flexible model selection post-training.
Contribution
The paper proposes a novel Pareto-Front Learning approach with HyperNetworks that efficiently learns the full Pareto front in a single model, allowing dynamic trade-off selection after training.
Findings
PHNs learn the entire Pareto front simultaneously with comparable time to a single point.
PHNs outperform traditional methods in solution quality.
PHNs scale to large models like ResNet18.
Abstract
Multi-objective optimization (MOO) problems are prevalent in machine learning. These problems have a set of optimal solutions, called the Pareto front, where each point on the front represents a different trade-off between possibly conflicting objectives. Recent MOO methods can target a specific desired ray in loss space however, most approaches still face two grave limitations: (i) A separate model has to be trained for each point on the front; and (ii) The exact trade-off must be known before the optimization process. Here, we tackle the problem of learning the entire Pareto front, with the capability of selecting a desired operating point on the front after training. We call this new setup Pareto-Front Learning (PFL). We describe an approach to PFL implemented using HyperNetworks, which we term Pareto HyperNetworks (PHNs). PHN learns the entire Pareto front simultaneously using a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsRobot Manipulation and Learning · Robotic Mechanisms and Dynamics · Evolutionary Algorithms and Applications
MethodsHyperNetwork
