Lune

ICLR2025Top-tier venue

Joint Gradient Balancing for Data Ordering in Finite-Sum Multi-Objective Optimization

Hansi Yang, James T. Kwok

Abstract

In finite-sum optimization problems, the sample orders for parameter updates can significantly influence the convergence rate of optimization algorithms. While numerous sample ordering techniques have been proposed in the context of single-objective optimization, the problem of sample ordering in finite-sum multiobjective optimization has not been thoroughly explored. To address this gap, we propose a sample ordering method called JoGBa (Joint Gradient Balancing), which finds the sample orders for multiple objectives by jointly performing online vector balancing on the gradients of all objectives. Our theoretical analysis demonstrates that this approach outperforms the standard baseline of random ordering and accelerates the convergence rate for the MGDA algorithm. Empirical evaluation across various datasets with different multi-objective optimization algorithms further demonstrates that JoGBa can achieve faster convergence and superior final performance than other data ordering strategies.

Ask Lune

Ask anything. The answer quotes the paper.

Lune reads all of it and the papers around it, then shows you the passages behind every answer.

Questions to start from

Lune answers from

the full paper · 1 top-tier paper that cites it · related work

Get the answer

Free to start. No credit card required.

Cited by top-tier papers1

  1. A Unified Analysis of Stochastic Gradient Descent with Arbitrary Data Permutations and BeyondYipeng Li, Xinchen Lyu, Zhenyu LiuNeurIPS 2025

Builds on14

  1. Gradient Surgery for Multi-Task LearningTianhe Yu, Saurabh Kumar, Abhishek Gupta, Sergey Levine et al.NeurIPS 2020 · 2,261 citations
  2. Conflict-Averse Gradient Descent for Multi-task learningBo Liu, Xingchao Liu, Xiaojie Jin, Peter Stone et al.NeurIPS 2021 · 686 citations
  3. Multi-Task Learning as a Bargaining GameAviv Navon, Aviv Shamsian, Idan Achituve, Haggai Maron et al.ICML 2022 · 243 citations
  4. In Defense of the Unitary Scalarization for Deep Multi-Task LearningVitaly Kurin, Alessandro De Palma, Ilya Kostrikov, Shimon Whiteson et al.NeurIPS 2022 · 96 citations
  5. Do Current Multi-Task Optimization Methods in Deep Learning Even Help?Derrick Xin, Behrooz Ghorbani, Justin Gilmer, Ankush Garg et al.NeurIPS 2022 · 91 citations

Related papers

  1. Three-Way Trade-Off in Multi-Objective Learning: Optimization, Generalization and Conflict-AvoidanceLisha Chen, Heshan Devaka Fernando, Yiming Ying, Tianyi ChenNeurIPS 2023 · 53 citations
  2. Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent ApproachHeshan Devaka Fernando, Han Shen, Miao Liu, Subhajit Chaudhury et al.ICLR 2023 · 2 citations
  3. Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax OptimizationAniket Das, Bernhard Schölkopf, Michael MuehlebachNeurIPS 2022 · 11 citations
  4. SMG: A Shuffling Gradient-Based Method with MomentumTrang H. Tran, Lam M. Nguyen, Quoc Tran-DinhICML 2021 · 25 citations
  5. Variance Reduction via Accelerated Dual Averaging for Finite-Sum OptimizationChaobing Song, Yong Jiang, Yi MaNeurIPS 2020 · 25 citations
Dusk over the sea between two cliffs drawn in fine vertical lines