← Search

Jeremy Bernstein

7 accepted papers

2024

Scalable Optimization in the Modular Norm

NeurIPS 2024poster

To improve performance in contemporary deep learning, one is interested in scaling up the neural network in terms of both the number and the size of the layers. When ramping up the width of a single layer, graceful scaling of training has been linked to the need to normalize the weights and their up…

2021

Learning by Turning: Neural Architecture Aware Optimisation

ICML 2021spotlight

Descent methods for deep networks are notoriously capricious: they require careful tuning of step size, momentum and weight decay, and which method will work best on a new benchmark is a priori unclear. To address this problem, this paper conducts a combined study of neural architecture and optimisa…

2020

Learning compositional functions via multiplicative weight updates

NeurIPS 2020poster

Compositionality is a basic structural feature of both biological and artificial neural networks. Learning compositional functions via gradient descent incurs well known problems like vanishing and exploding gradients, making careful learning rate tuning essential for real-world applications. This p…

2020

On the distance between two neural networks and the stability of learning

NeurIPS 2020poster

This paper relates parameter distance to gradient breakdown for a broad class of nonlinear compositional functions. The analysis leads to a new distance function called deep relative trust and a descent lemma for neural networks. Since the resulting learning rule seems to require little to no learni…

2019

signSGD with Majority Vote is Communication Efficient and Fault Tolerant

ICLR 2019poster

Training neural networks on large datasets can be accelerated by distributing the workload over a network of machines. As datasets grow ever larger, networks of hundreds or thousands of machines become economically viable. The time cost of communicating gradients limits the effectiveness of using su…

Cited by 227SourcePDFScholar
2018

signSGD: Compressed Optimisation for Non-Convex Problems

ICML 2018oral

Training large neural networks requires distributing learning across multiple workers, where the cost of communicating gradients can be a significant bottleneck. signSGD alleviates this problem by transmitting just the sign of each minibatch stochastic gradient. We prove that it can get the best of…