489 citations · 600 across the 8 of their papers we have counts for
7 papers · 2 filters
Efficient Learning in Non-Stationary Linear Markov Decision Processes
Ahmed Touati, Pascal Vincent
We study episodic reinforcement learning in non-stationary linear (a.k.a. low-rank) Markov Decision Processes (MDPs), i.e, both the reward and transition kernel are linear with res…
Implicit Regularization via Neural Feature Alignment
Aristide Baratin, Thomas George, César Laurent +4
We approach the problem of implicit regularization in deep learning from a geometrical viewpoint. We highlight a regularization effect induced by a dynamical alignment of the neura…
Stochastic Hamiltonian Gradient Methods for Smooth Games
Nicolas Loizou, Hugo Berard, Alexia Jolicoeur-Martineau +3
The success of adversarial formulations in machine learning has brought renewed motivation for smooth games. In this work, we focus on the class of stochastic Hamiltonian methods a…
Sharp Analysis of Smoothed Bellman Error Embedding
Ahmed Touati, Pascal Vincent
The \textit{Smoothed Bellman Error Embedding} algorithm~\citep{dai2018sbeed}, known as SBEED, was proposed as a provably convergent reinforcement learning algorithm with general no…
Adversarial Example Games
Avishek Joey Bose, Gauthier Gidel, Hugo Berard +4
The existence of adversarial examples capable of fooling trained neural network classifiers calls for a much better understanding of possible attacks to guide the development of sa…
Revisiting Loss Modelling for Unstructured Pruning
César Laurent, Camille Ballas, Thomas George +2
By removing parameters from deep neural networks, unstructured pruning methods aim at cutting down memory footprint and computational cost, while maintaining prediction accuracy. I…