← Search

Rohan Anil

11 accepted papers

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

Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions

NeurIPS 2023poster

Adaptive regularization methods that exploit more than the diagonal entries exhibit state of the art performance for many tasks, but can be prohibitive in terms of memory and running time. We find the spectra of the Kronecker-factored gradient covariance matrix in deep learning (DL) training tasks a…

Cited by 14SourcePDFScholar
2022

Knowledge Distillation: A Good Teacher Is Patient and Consistent

CVPR 2022oral

There is a growing discrepancy in computer vision between large-scale models that achieve state-of-the-art performance and models that are affordable in practical applications. In this paper we address this issue and significantly bridge the gap between these two types of models. Throughout our empi…

Cited by 358PDFcodeScholar
2021

Efficiently Identifying Task Groupings for Multi-Task Learning

NeurIPS 2021spotlight

Multi-task learning can leverage information learned by one task to benefit the training of other tasks. Despite this capacity, naively training all tasks together in one model often degrades performance, and exhaustively searching through combinations of task groupings can be prohibitively expensiv…

2020

Stochastic Optimization with Laggard Data Pipelines

NeurIPS 2020poster

State-of-the-art optimization is steadily shifting towards massively parallel pipelines with extremely large batch sizes. As a consequence, CPU-bound preprocessing and disk/memory/network operations have emerged as new performance bottlenecks, as opposed to hardware-accelerated gradient computations…

Cited by 17SourcePDFScholar
2019

Robust Bi-Tempered Logistic Loss Based on Bregman Divergences

NeurIPS 2019poster

We introduce a temperature into the exponential function and replace the softmax output layer of the neural networks by a high-temperature generalization. Similarly, the logarithm in the loss we use for training is replaced by a low-temperature logarithm. By tuning the two temperatures, we create lo…

2018

Large scale distributed neural network training through online distillation

ICLR 2018poster

Techniques such as ensembling and distillation promise model quality improvements when paired with almost any base model. However, due to increased test-time cost (for ensembles) and increased complexity of the training pipeline (for distillation), these techniques are challenging to use in industri…

Cited by 535SourcePDFScholar