mlsanityData to 7 Oct 2026

Multi-Objective Optimization via Wasserstein-Fisher-Rao Gradient Flow

arXiv 2311.13159 ↗First posted 22 Nov 2023cs.LG math.OC stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Multi-objective optimization (MOO) aims to optimize multiple, possibly conflicting objectives with widespread applications. We introduce a novel interacting particle method for MOO inspired by molecular dynamics simulations. Our approach combines overdamped Langevin and birth-death dynamics, incorporating a "dominance potential" to steer particles toward global Pareto optimality. In contrast to previous methods, our method is able to relocate dominated particles, making it particularly adept at managing Pareto fronts of complicated geometries. Our method is also theoretically grounded as a Wasserstein-Fisher-Rao gradient flow with convergence guarantees. Extensive experiments confirm that our approach outperforms state-of-the-art methods on challenging synthetic and real-world datasets.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 61 references that are in the map. First posted on arXiv 22 Nov 2023.

Builds on

21 of 61 references.

References · 21

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2021Convex optimizationcited by 2,479
  3. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
  4. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  5. 2019Pareto Multi-Task Learningcited by 224
  6. 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
  7. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
  8. 2020Learning the Pareto Front with Hypernetworkscited by 122
  9. 2013Introducing LETOR 4.0 Datasetscited by 120
  10. 2013A Theoretical Analysis of NDCG Type Ranking Measurescited by 119
  11. 2020Controllable Pareto Multi-Task Learningcited by 51
  12. 2019Accelerating Langevin Sampling with Birth-deathcited by 45
9 more
  1. 2019The stochastic multi-gradient algorithm for multi-objective optimization and its application to supervised machine learningcited by 45
  2. 2021Scalable Pareto Front Approximation for Deep Multi-Objective Learningcited by 45
  3. 2022Joint Entropy Search for Multi-objective Bayesian Optimizationcited by 45
  4. 2022Uncertainty-Aware Search Framework for Multi-Objective Bayesian Optimizationcited by 43
  5. 2022Birth-death dynamics for sampling: Global convergence, approximations and their asymptoticscited by 30
  6. 2023Learning Gaussian Mixtures Using the Wasserstein-Fisher-Rao Gradient Flowcited by 25
  7. 2022Improving Pareto Front Learning via Multi-Sample Hypernetworkscited by 16
  8. 2022Multi-Label Learning to Rank through Multi-Objective Optimizationcited by 10
  9. 2021Multi-task problems are not multi-objectivecited by 3

Built on by

Cited by year

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

3 papers.