activity
20222026
most citedAmortized Planning with Large-Scale Transformers: A Case Study on Chess

8 citations · 18 across the 8 of their papers we have counts for

collaborators

9 papers

cs.IR2026

Personalized LLM Recommendation with Semantic IDs: Autoregressive Beam Search vs. Multi-Token Prediction

Sejoon Oh, Fernando Amat Gil, Evan Smothers +11

Large-scale personalization is shifting from embedding-table retrieval to LLM-based recommenders that generate the Semantic ID (SID) of the item to recommend, where each SID is a s…

cs.LG2025

How far away are truly hyperparameter-free learning algorithms?

Priya Kasimbeg, Vincent Roulet, Naman Agarwal +4

Despite major advances in methodology, hyperparameter tuning remains a crucial (and expensive) part of the development of machine learning systems. Even ignoring architectural choi…

cs.LG2025

Learning by solving differential equations

Benoit Dherin, Michael Munn, Hanna Mazzawi +3

Modern deep learning algorithms use variations of gradient descent as their main learning methods. Gradient descent can be understood as the simplest Ordinary Differential Equation…

cs.LG2025

Training neural networks faster with minimal tuning using pre-computed lists of hyperparameters for NAdamW

Sourabh Medapati, Priya Kasimbeg, Shankar Krishnan +2

If we want to train a neural network using any of the most popular optimization algorithms, we are immediately faced with a dilemma: how to set the various optimization and regular…

cs.LG2025★ 2 cited

Accelerating Neural Network Training: An Analysis of the AlgoPerf Competition

Priya Kasimbeg, Frank Schneider, Runa Eschenhagen +11

The goal of the AlgoPerf: Training Algorithms competition is to evaluate practical speed-ups in neural network training achieved solely by improving the underlying training algorit…

cs.CV2024

Towards flexible perception with visual memory

Robert Geirhos, Priyank Jaini, Austin Stone +5

Training a neural network is a monolithic endeavor, akin to carving knowledge into stone: once the process is completed, editing the knowledge in a network is hard, since all infor…

cs.LG2024★ 8 cited

Amortized Planning with Large-Scale Transformers: A Case Study on Chess

Anian Ruoss, Grégoire Delétang, Sourabh Medapati +7

This paper uses chess, a landmark planning problem in AI, to assess transformers' performance on a planning task where memorization is futile $\unicode{x2013}$ even at a large scal…

cs.LG2023★ 6 cited

Benchmarking Neural Network Training Algorithms

George E. Dahl, Frank Schneider, Zachary Nado +22

Training algorithms, broadly construed, are an essential part of every deep learning pipeline. Training algorithm improvements that speed up training across a wide variety of workl…

cs.LG2022★ 2 cited

Adaptive Gradient Methods at the Edge of Stability

Jeremy M. Cohen, Behrooz Ghorbani, Shankar Krishnan +8

Very little is known about the training dynamics of adaptive gradient methods like Adam in deep learning. In this paper, we shed light on the behavior of these algorithms in the fu…