← Search

Guillaume Hennequin

11 accepted papers

2026

Exploiting weight-space symmetries for approximating curvature

ICML 2026poster

Many machine learning techniques rely on approximating a loss function's curvature, but this is notoriously hard to do at the scale of modern deep networks. Surprisingly, no previous work has exploited the curvature constraints that arise from well known weight-space symmetries in loss landscapes. B…

Cited by 0SourceScholar
2024

Exact, Tractable Gauss-Newton Optimization in Deep Reversible Architectures Reveal Poor Generalization

NeurIPS 2024poster

Second-order optimization has been shown to accelerate the training of deep neural networks in many applications, often yielding faster progress per iteration on the training loss compared to first-order optimizers. However, the generalization properties of second-order methods are still being debat…

2024

Learning interpretable control inputs and dynamics underlying animal locomotion

ICLR 2024poster

A central objective in neuroscience is to understand how the brain orchestrates movement. Recent advances in automated tracking technologies have made it possible to document behavior with unprecedented temporal resolution and scale, generating rich datasets which can be exploited to gain insights i…

Cited by 1SourcePDFScholar
2024

Second-order forward-mode optimization of recurrent neural networks for neuroscience

NeurIPS 2024spotlight

A common source of anxiety for the computational neuroscience student is the question “will my recurrent neural network (RNN) model finally learn that task?”. Unlike in machine learning where any architectural modification of an RNN (e.g. GRU or LSTM) is acceptable if it speeds up training, the RNN…

Cited by 0SourcePDFScholar
2023

Fisher-Legendre (FishLeg) optimization of deep neural networks

ICLR 2023top-25%

Incorporating second-order gradient information (curvature) into optimization can dramatically reduce the number of iterations required to train machine learning models. In natural gradient descent, such information comes from the Fisher information matrix which yields a number of desirable properti…

Cited by 11SourcePDFScholar
2022

iLQR-VAE : control-based learning of input-driven dynamics with applications to neural data

ICLR 2022oral

Understanding how neural dynamics give rise to behaviour is one of the most fundamental questions in systems neuroscience. To achieve this, a common approach is to record neural populations in behaving animals, and model these data as emanating from a latent dynamical system whose state trajectories…

Cited by 31SourcePDFScholar
2021

Natural continual learning: success is a journey, not (just) a destination

NeurIPS 2021poster

Biological agents are known to learn many different tasks over the course of their lives, and to be able to revisit previous tasks and behaviors with little to no loss in performance. In contrast, artificial agents are prone to ‘catastrophic forgetting’ whereby performance on previous tasks deterior…

2021

Scalable Bayesian GPFA with automatic relevance determination and discrete noise models

NeurIPS 2021poster

Latent variable models are ubiquitous in the exploratory analysis of neural population recordings, where they allow researchers to summarize the activity of large populations of neurons in lower dimensional ‘latent’ spaces. Existing methods can generally be categorized into (i) Bayesian methods that…

Cited by 25SourcePDFScholar
2020

Manifold GPLVMs for discovering non-Euclidean latent structure in neural data

NeurIPS 2020poster

A common problem in neuroscience is to elucidate the collective neural representations of behaviorally important variables such as head direction, spatial location, upcoming movements, or mental spatial transformations. Often, these latent variables are internal constructs not directly accessible to…

2020

Non-reversible Gaussian processes for identifying latent dynamical structure in neural data

NeurIPS 2020oral

A common goal in the analysis of neural data is to compress large population recordings into sets of interpretable, low-dimensional latent trajectories. This problem can be approached using Gaussian process (GP)-based methods which provide uncertainty quantification and principled model selection. H…

Cited by 26SourcePDFScholar
2018

Exact natural gradient in deep linear networks and its application to the nonlinear case

NeurIPS 2018poster

Stochastic gradient descent (SGD) remains the method of choice for deep learning, despite the limitations arising for ill-behaved objective functions. In cases where it could be estimated, the natural gradient has proven very effective at mitigating the catastrophic effects of pathological curvature…

Cited by 65SourcePDFScholar