Introduction
Modern machine learning is increasingly characterized by the need to optimize multiple conflicting objectives within nested decision-making structures. This class of problems, known as Multi-Objective Bilevel Learning (MOBL), is foundational to tasks such as meta-learning, hyperparameter optimization, and robust training under data corruption. In a typical MOBL setting, an "outer" loop optimizes a set of objectives that depend on the optimal parameters found in an "inner" loop task.
The primary technical challenge in MOBL arises from the accumulation of errors. Because the inner loop is rarely solved to global optimality, the resulting hypergradients used to update the outer loop are inherently biased. This bias complicates the search for a Pareto-stationary point—a solution where no single objective can be improved without degrading another—particularly when specific user-defined preferences must be strictly enforced.
Methodology: The WC-MHGD Framework
To address these challenges, we present Weighted Chebyshev Multi-Hyper-Gradient-Descent (WC-MHGD). This framework provides the first finite-time convergence rates for preference-guided MOBL in both deterministic and stochastic environments.
The core innovation of WC-MHGD is a dynamic weighting subproblem solved at each iteration. This subproblem balances two critical components:
- Stationarity: A term that drives the model toward the Pareto front of optimal trade-offs.
- Preference Alignment: A term utilizing Weighted Chebyshev scalarization to ensure the final solution adheres to a user-provided preference vector (e.g., prioritizing accuracy over computational speed).
By adjusting a tunable parameter $u$ within the subproblem, the algorithm can transition between general Pareto exploration and strict adherence to specific preference vectors. To manage the computational complexity of second-order derivatives (Hessians) required for bilevel optimization, the framework employs hypergradient estimation techniques such as Conjugate Gradient (CG) or Neumann Series (NS) approximations, achieving a state-of-the-art convergence rate of $O(1/K)$.
Experimental Evaluation
The framework was rigorously evaluated on two benchmarks: meta-learning using the FC-100 (Fewshot-CIFAR-100) dataset and data hyper-cleaning on MNIST. In the meta-learning scenario, five distinct learning tasks were treated as potentially conflicting objectives to identify a robust shared model initialization.
As illustrated in the radar charts, WC-MHGD significantly outperforms existing baselines such as MOML and FORUM. The red boundary of WC-MHGD encompasses a larger area across the five objectives, indicating a more effective discovery of the Pareto front.
Furthermore, the algorithm's ability to respect specific user preferences was validated. By varying the preference vector, the model successfully shifted its performance focus toward the "preferred" objectives while maintaining overall stability across the task suite.
Conclusion and Future Work
WC-MHGD establishes a new theoretical and empirical benchmark for MOBL by providing $O(1/K)$ convergence guarantees and robust preference alignment. While the current theoretical framework assumes a strongly convex lower-level objective, future research will focus on extending these guarantees to non-convex inner loops common in deep learning. Additionally, scaling the framework to handle hundreds of objectives and applying it to decentralized settings like federated learning remain high-impact directions for the field.
Summary updated