mlsanityData to 14 Oct 2026

Careful with that Scalpel: Improving Gradient Surgery with an EMA

arXiv 2402.02998 ↗First posted 5 Feb 2024cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

Beyond minimizing a single training loss, many deep learning estimation pipelines rely on an auxiliary objective to quantify and encourage desirable properties of the model (e.g. performance on another dataset, robustness, agreement with a prior). Although the simplest approach to incorporating an auxiliary loss is to sum it with the training loss as a regularizer, recent works have shown that one can improve performance by blending the gradients beyond a simple sum; this is known as gradient surgery. We cast the problem as a constrained minimization problem where the auxiliary objective is minimized among the set of minimizers of the training loss. To solve this bilevel problem, we follow a parameter update direction that combines the training loss gradient and the orthogonal projection of the auxiliary gradient to the training gradient. In a setting where gradients come from mini-batches, we explain how, using a moving average of the training loss gradients, we can carefully maintain this critical orthogonality property. We demonstrate that our method, Bloop, can lead to much better performances on NLP and vision experiments than other gradient surgery methods without EMA.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 23 of its 37 references that are in the map. First posted on arXiv 5 Feb 2024.

Builds on

23 of 37 references.

References · 23

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
  3. 2020Gradient Surgery for Multi-Task Learningcited by 1,256
  4. 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
  5. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  6. 2018Multi-Task Learning as Multi-Objective Optimizationcited by 821
  7. 2023Textbooks Are All You Needcited by 569
  8. 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 539
  9. 2023Generative Multimodal Models are In-Context Learnerscited by 446
  10. 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
  11. 2023Demystifying CLIP Datacited by 270
  12. 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 233
11 more
  1. 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 195
  2. 2020Gradient Vaccine: Investigating and Improving Multi-task Optimization in Massively Multilingual Modelscited by 169
  3. 2018Adapting Auxiliary Losses Using Gradient Similaritycited by 100
  4. 2017A First Order Method for Solving Convex Bi-Level Optimization Problemscited by 67
  5. 2018The loss landscape of overparameterized neural networkscited by 39
  6. 2022MetaBalance: Improving Multi-Task Recommendations via Adapting Gradient Magnitudes of Auxiliary Taskscited by 34
  7. 2019Adversarial Lipschitz Regularizationcited by 30
  8. 2021Auxiliary Task Update Decomposition: The Good, The Bad and The Neutralcited by 17
  9. 2023Projection-Free Methods for Stochastic Simple Bilevel Optimization with Convex Lower-level Problemcited by 13
  10. 2023Adaptive Training Distributions with Scalable Online Bilevel Optimizationcited by 11
  11. 2023Multi-Objective Optimization for Sparse Deep Multi-Task Learningcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.