← Search

Thomas Moreau

22 accepted papers

2025

FiRe: Fixed-points of Restoration Priors for Solving Inverse Problems

CVPR 2025poster

Selecting an appropriate prior to compensate for information loss due to the measurement operator is a fundamental challenge in imaging inverse problems. Implicit priors based on denoising neural networks have become central to widely-used frameworks such as Plug-and-Play (PnP) algorithms. In this w…

2024

A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization

AISTATS 2024poster

Bilevel optimization problems, which are problems where two optimization problems are nested, have more and more applications in machine learning. In many practical cases, the upper and the lower objectives correspond to empirical risk minimization problems and therefore have a sum structure. In thi…

Cited by 11SourcePDFScholar
2023

FaDIn: Fast Discretized Inference for Hawkes Processes with General Parametric Kernels

ICML 2023poster

Temporal point processes (TPP) are a natural tool for modeling event-based data. Among all TPP models, Hawkes processes have proven to be the most widely used, mainly due to their adequate modeling for various applications, particularly when considering exponential or non-parametric kernels. Althoug…

Cited by 7SourcePDFScholar
2023

Sliced-Wasserstein on Symmetric Positive Definite Matrices for M/EEG Signals

ICML 2023poster

When dealing with electro or magnetoencephalography records, many supervised prediction tasks are solved by working with covariance matrices to summarize the signals. Learning with these matrices requires the usage of Riemanian geometry to account for their structure. In this paper, we propose a new…

Cited by 27SourcePDFScholar
2022

A framework for bilevel optimization that enables stochastic and global variance reduction algorithms

NeurIPS 2022accept

Bilevel optimization, the problem of minimizing a value function which involves the arg-minimum of another function, appears in many areas of machine learning. In a large scale empirical risk minimization setting where the number of samples is huge, it is crucial to develop stochastic methods, which…

2022

Benchopt: Reproducible, efficient and collaborative optimization benchmarks

NeurIPS 2022accept

Numerical validation is at the core of machine learning research as it allows us to assess the actual impact of new methods, and to confirm the agreement between theory and practice. Yet, the rapid development of the field poses several challenges: researchers are confronted with a profusion of meth…

2022

CADDA: Class-wise Automatic Differentiable Data Augmentation for EEG Signals

ICLR 2022poster

Data augmentation is a key element of deep learning pipelines, as it informs the network during training about transformations of the input data that keep the label unchanged. Manually finding adequate augmentation methods and parameters for a given pipeline is however rapidly cumbersome. In particu…

Cited by 50SourcePDFScholar
2022

Deep invariant networks with differentiable augmentation layers

NeurIPS 2022accept

Designing learning systems which are invariant to certain data transformations is critical in machine learning. Practitioners can typically enforce a desired invariance on the trained model through the choice of a network architecture, e.g. using convolutions for translations, or using data augmenta…

2022

DriPP: Driven Point Processes to Model Stimuli Induced Patterns in M/EEG Signals

ICLR 2022poster

The quantitative analysis of non-invasive electrophysiology signals from electroencephalography (EEG) and magnetoencephalography (MEG) boils down to the identification of temporal patterns such as evoked responses, transient bursts of neural oscillations but also blinks or heartbeats for data cleani…

Cited by 9SourcePDFScholar
2022

SHINE: SHaring the INverse Estimate from the forward pass for bi-level optimization and implicit models

ICLR 2022spotlight

In recent years, implicit deep learning has emerged as a method to increase the depth of deep neural networks. While their training is memory-efficient, they are still significantly slower to train than their explicit counterparts. In Deep Equilibrium Models~(DEQs), the training is performed as a bi…

Cited by 35SourcePDFScholar
2022

Understanding approximate and unrolled dictionary learning for pattern recovery

ICLR 2022poster

Dictionary learning consists of finding a sparse representation from noisy data and is a common way to encode data-driven prior knowledge on signals. Alternating minimization (AM) is standard for the underlying optimization, where gradient descent steps alternate with sparse coding procedures. The m…

2021

HNPE: Leveraging Global Parameters for Neural Posterior Estimation

NeurIPS 2021poster

Inferring the parameters of a stochastic model based on experimental observations is central to the scientific method. A particularly challenging setting is when the model is strongly indeterminate, i.e. when distinct sets of parameters yield identical observations. This arises in many practical sit…

2020

Learning to solve TV regularised problems with unrolled algorithms

NeurIPS 2020poster

Total Variation (TV) is a popular regularization strategy that promotes piece-wise constant signals by constraining the ℓ1-norm of the first order derivative of the estimated signal. The resulting optimization problem is usually solved using iterative algorithms such as proximal gradient descent, pr…

2020

NeuMiss networks: differentiable programming for supervised learning with missing values.

NeurIPS 2020oral

The presence of missing values makes supervised learning much more challenging. Indeed, previous work has shown that even when the response is a linear function of the complete data, the optimal predictor is a complex function of the observed entries and the missingness indicator. As a result, the c…

2020

Super-efficiency of automatic differentiation for functions defined as a minimum

ICML 2020poster

In min-min optimization or max-min optimization, one has to compute the gradient of a function defined as a minimum. In most cases, the minimum has no closed-form, and an approximation is obtained via an iterative algorithm. There are two usual ways of estimating the gradient of the function: using…

2019

Learning step sizes for unfolded sparse coding

NeurIPS 2019poster

Sparse coding is typically solved by iterative optimization techniques, such as the Iterative Shrinkage-Thresholding Algorithm (ISTA). Unfolding and learning weights of ISTA using neural networks is a practical way to accelerate estimation. In this paper, we study the selection of adapted step sizes…

2019

Sparsity-based Blind Deconvolution of Neural Activation Signal in FMRI

ICASSP 2019accepted

The estimation of the hemodynamic response function (HRF) in functional magnetic resonance imaging (fMRI) is critical to deconvolve a time-resolved neural activity and get insights on the underlying cognitive processes. Existing methods propose to estimate the HRF using the experimental paradigm (EP…

Cited by 0SourceScholar
2018

DICOD: Distributed Convolutional Coordinate Descent for Convolutional Sparse Coding

ICML 2018oral

In this paper, we introduce DICOD, a convolutional sparse coding algorithm which builds shift invariant representations for long signals. This algorithm is designed to run in a distributed setting, with local message passing, making it communication efficient. It is based on coordinate descent and u…

2018

Multivariate Convolutional Sparse Coding for Electromagnetic Brain Signals

NeurIPS 2018poster

Frequency-specific patterns of neural activity are traditionally interpreted as sustained rhythmic oscillations, and related to cognitive mechanisms such as attention, high level visual processing or motor control. While alpha waves (8--12\,Hz) are known to closely resemble short sinusoids, and thus…

Cited by 67SourcePDFScholar