LGOCMLSep 5, 2020

Optimizing Mode Connectivity via Neuron Alignment

arXiv:2009.02439v2100 citations
AI Analysis

This work addresses the challenge of understanding and optimizing loss landscapes in deep learning, offering an incremental improvement for researchers and practitioners in neural network training and robustness.

The paper tackles the problem of connecting local minima in neural network loss landscapes by accounting for weight permutations, introducing neuron alignment to improve mode connectivity. The result shows that this method can significantly reduce the robust loss barrier and find more robust and accurate models on the path, with empirical verification of local optimality.

The loss landscapes of deep neural networks are not well understood due to their high nonconvexity. Empirically, the local minima of these loss functions can be connected by a learned curve in model space, along which the loss remains nearly constant; a feature known as mode connectivity. Yet, current curve finding algorithms do not consider the influence of symmetry in the loss surface created by model weight permutations. We propose a more general framework to investigate the effect of symmetry on landscape connectivity by accounting for the weight permutations of the networks being connected. To approximate the optimal permutation, we introduce an inexpensive heuristic referred to as neuron alignment. Neuron alignment promotes similarity between the distribution of intermediate activations of models along the curve. We provide theoretical analysis establishing the benefit of alignment to mode connectivity based on this simple heuristic. We empirically verify that the permutation given by alignment is locally optimal via a proximal alternating minimization scheme. Empirically, optimizing the weight permutation is critical for efficiently learning a simple, planar, low-loss curve between networks that successfully generalizes. Our alignment method can significantly alleviate the recently identified robust loss barrier on the path connecting two adversarial robust models and find more robust and accurate models on the path.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes