Optimizing ML Training with Metagradient Descent

Logan Engstrom, Andrew Ilyas, Benjamin Chen, Axel Feldmann, William Moses +1 more
3/17/2025
stat.MLcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

A major challenge in training large-scale machine learning models is configuring the training process to maximize model performance, i.e., finding the best training setup from a vast design space. In this work, we unlock a gradient-based approach to this problem. We first introduce an algorithm for efficiently calculating metagradients -- gradients through model training -- at scale. We then introduce a "smooth model training" framework that enables effective optimization using metagradients. With metagradient descent (MGD), we greatly improve on existing dataset selection methods, outperform accuracy-degrading data poisoning attacks by an order of magnitude, and automatically find competitive learning rate schedules.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{engstrom2025optimizing,
  title  = {Optimizing ML Training with Metagradient Descent},
  author = {Logan Engstrom and Andrew Ilyas and Benjamin Chen and Axel Feldmann and William Moses and Aleksander Madry},
  year   = {2025},
  eprint = {2503.13751},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.13751v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.13751.svg)](https://codeofpaper.com/paper/2503.13751)

Discussion