← Search

Sai Surya Duvvuri

8 accepted papers

2026

Let's (not) just put things in Context: Test-time Training for Long-context LLMs

ICLR 2026poster

Advances in training and architectural design have enabled LLMs with million-token context windows, yet in practice these models often read far more than they can reliably use. While inference-time compute scaling—typically via “thinking tokens”—can help on short multi-step reasoning tasks, our cont…

Cited by 0SourcecodeScholar
2026

The Art of Scaling Reinforcement Learning Compute for LLMs

ICLR 2026oral

Reinforcement learning (RL) has become central to training large language models (LLMs), yet the field lacks predictive scaling methodologies comparable to those established for pre-training. Despite rapidly rising compute budgets, there is no principled understanding of how to evaluate algo…

Cited by 0SourceScholar
2025

LoRA Done RITE: Robust Invariant Transformation Equilibration for LoRA Optimization

ICLR 2025oral

Low-rank adaption (LoRA) is a widely used parameter-efficient finetuning method for LLM that reduces memory requirements. However, current LoRA optimizers lack transformation invariance, meaning the updates depending on how the two LoRA factors are scaled or rotated. This deficiency leads to ineffic…

2024

Combining Axes Preconditioners through Kronecker Approximation for Deep Learning

ICLR 2024poster

Adaptive regularization based optimization methods such as full-matrix Adagrad which use gradient second-moment information hold significant potential for fast convergence in deep neural network (DNN) training, but are memory intensive and computationally demanding for large neural nets. We develop…

Cited by 6SourcePDFScholar
2023

A Computationally Efficient Sparsified Online Newton Method

NeurIPS 2023poster

Second-order methods hold significant promise for enhancing the convergence of deep neural network training; however, their large memory and computational demands have limited their practicality. Thus there is a need for scalable second-order methods that can efficiently train large models. In this…

2023

Block Low-Rank Preconditioner with Shared Basis for Stochastic Optimization

NeurIPS 2023poster

Adaptive methods with non-diagonal preconditioning have shown state-of-the-art results on various tasks. However, their computational complexity and memory requirement makes it challenging to scale these methods to modern neural network architectures. To address this challenge, some previous works h…

Cited by 4SourcePDFScholar