mlsanityData to 14 Oct 2026

LibMOON: A Gradient-based MultiObjective OptimizatioN Library in PyTorch

arXiv 2409.02969 ↗First posted 4 Sep 2024cs.MS cs.LG math.OCcited by 10

Not on the map. Why?

Abstract (arXiv)

Multiobjective optimization problems (MOPs) are prevalent in machine learning, with applications in multi-task learning, learning under fairness or robustness constraints, etc. Instead of reducing multiple objective functions into a scalar objective, MOPs aim to optimize for the so-called Pareto optimality or Pareto set learning, which involves optimizing more than one objective function simultaneously, over models with thousands / millions of parameters. Existing benchmark libraries for MOPs mainly focus on evolutionary algorithms, most of which are zeroth-order / meta-heuristic methods that do not effectively utilize higher-order information from objectives and cannot scale to large-scale models with thousands / millions of parameters. In light of the above gap, this paper introduces LibMOON, the first multiobjective optimization library that supports state-of-the-art gradient-based methods, provides a fair benchmark, and is open-sourced for the community.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 28 of its 70 references that are in the map. First posted on arXiv 4 Sep 2024.

Builds on

28 of 70 references.

References · 28

  1. 2021Convex optimizationcited by 2,515
  2. 2016HyperNetworkscited by 1,027
  3. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
  4. 2019Pareto Multi-Task Learningcited by 224
  5. 2020pymoo: Multi-objective Optimization in Pythoncited by 200
  6. 2019Inherent Tradeoffs in Learning Fair Representationscited by 144
  7. 2020Learning the Pareto Front with Hypernetworkscited by 125
  8. 2021Reasonable Effectiveness of Random Weighting: A Litmus Test for Multi-Task Learningcited by 101
  9. 2018A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizationscited by 99
  10. 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 83
  11. 2024Panacea: Pareto Alignment via Preference Adaptation for LLMscited by 80
  12. 2024Smooth Tchebycheff Scalarization for Multi-Objective Optimizationcited by 54
16 more
  1. 2020Controllable Pareto Multi-Task Learningcited by 51
  2. 2022Pareto Set Learning for Expensive Multi-Objective Optimizationcited by 51
  3. 2022Fair and Optimal Classification via Post-Processingcited by 51
  4. 2023Revisiting Scalarization in Multi-Task Learning: A Theoretical Perspectivecited by 51
  5. 2021Scalable Pareto Front Approximation for Deep Multi-Objective Learningcited by 45
  6. 2017PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimizationcited by 41
  7. 2024Robust Multi-Task Learning with Excess Riskscited by 24
  8. 2020Addressing Fairness in Classification with a Model-Agnostic Multi-Objective Algorithmcited by 23
  9. 2023EvoX: A Distributed GPU-accelerated Framework for Scalable Evolutionary Computationcited by 18
  10. 2021Multi-Objective Learning to Predict Pareto Fronts Using Hypervolume Maximizationcited by 16
  11. 2024Pareto Low-Rank Adapters: Efficient Multi-Task Learning with Preferencescited by 13
  12. 2016Gradient-Based Multiobjective Optimization with Uncertaintiescited by 11
  13. 2024PMGDA: A Preference-based Multiple Gradient Descent Algorithmcited by 10
  14. 2023EvoTorch: Scalable Evolutionary Computation in Pythoncited by 9
  15. 2024Efficient Pareto Manifold Learning with Low-Rank Structurecited by 9
  16. 2024UMOEA/D: A Multiobjective Evolutionary Algorithm for Uniform Pareto Objectives based on Decompositioncited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 7; 2026: 2.

10 papers.