← Search

Yann Dauphin

14 accepted papers

2025

Avoiding spurious sharpness minimization broadens applicability of SAM

ICML 2025poster

Curvature regularization techniques like Sharpness Aware Minimization (SAM) have shown great promise in improving generalization on vision tasks. However, we find that SAM performs poorly in domains like natural language processing (NLP), often degrading performance --- even with twice the compute b…

Cited by 1SourcePDFScholar
2025

Capturing Individual Human Preferences with Reward Features

NeurIPS 2025poster

Reinforcement learning from human feedback usually models preferences using a reward function that does not distinguish between people. We argue that this is unlikely to be a good design choice in contexts with high potential for disagreement, like in the training of large language models. We formal…

Cited by 0SourceScholar
2024

Neglected Hessian component explains mysteries in sharpness regularization

NeurIPS 2024spotlight

Recent work has shown that methods that regularize second order information like SAM can improve generalization in deep learning. Seemingly similar methods like weight noise and gradient penalties often fail to provide such benefits. We investigate this inconsistency and reveal its connection to the…

Cited by 7SourcePDFScholar
2023

Tied-Augment: Controlling Representation Similarity Improves Data Augmentation

ICML 2023poster

Data augmentation methods have played an important role in the recent advance of deep learning models, and have become an indispensable component of state-of-the-art models in semi-supervised, self-supervised, and supervised training for vision. Despite incurring no additional latency at test time,…

2022

Gradient Flow in Sparse Neural Networks and How Lottery Tickets Win

AAAI 2022technical

Sparse Neural Networks (NNs) can match the generalization of dense NNs using a fraction of the compute/storage for inference, and have the potential to enable efficient training. However, naively training unstructured sparse NNs from random initialization results in significantly worse generalizatio…

2022

No One Representation to Rule Them All: Overlapping Features of Training Methods

ICLR 2022poster

Despite being able to capture a range of features of the data, high accuracy models trained with supervision tend to make similar predictions. This seemingly implies that high-performing models share similar biases regardless of training methodology, which would limit ensembling benefits and render…

Cited by 72SourcePDFScholar
2021

AUXILIARY TASK UPDATE DECOMPOSITION: THE GOOD, THE BAD AND THE NEUTRAL

ICLR 2021poster

While deep learning has been very beneficial in data-rich settings, tasks with smaller training set often resort to pre-training or multitask learning to leverage data from other tasks. In this case, careful consideration is needed to select tasks and model parameterizations such that updates from t…

Cited by 30SourcecodeScholar
2020

Robust and On-the-fly Dataset Denoising for Image Classification

ECCV 2020poster

Memorization in over-parameterized neural networks could severely hurt generalization in the presence of mislabeled examples. However, mislabeled examples are hard to avoid in extremely large datasets collected with weak supervision. We address this problem by reasoning counterfactually about the lo…

Cited by 18SourcePDFScholar
2019

Pay Less Attention with Lightweight and Dynamic Convolutions

ICLR 2019oral

Self-attention is a useful mechanism to build generative models for language and images. It determines the importance of context elements by comparing each element to the current time step. In this paper, we show that a very lightweight convolution can perform competitively to the best reported self…

2018

Empirical Analysis of the Hessian of Over-Parametrized Neural Networks

ICLR 2018workshop

We study the properties of common loss surfaces through their Hessian matrix. In particular, in the context of deep learning, we empirically show that the spectrum of the Hessian is composed of two parts: (1) the bulk centered near zero, (2) and outliers away from the bulk. We present numerical evid…

Cited by 435SourceScholar
2017

Parseval Networks: Improving Robustness to Adversarial Examples

ICML 2017poster

We introduce Parseval networks, a form of deep neural networks in which the Lipschitz constant of linear, convolutional and aggregation layers is constrained to be smaller than $1$. Parseval networks are empirically and theoretically motivated by an analysis of the robustness of the predictions made…

Cited by 958SourcePDFScholar
2015

Equilibrated adaptive learning rates for non-convex optimization

NeurIPS 2015spotlight

Parameter-specific adaptive learning rate methods are computationally efficient ways to reduce the ill-conditioning problems encountered when training large deep networks. Following recent work that strongly suggests that most of thecritical points encountered when training such networks are saddle…

Cited by 661SourcePDFScholar