← Search

Damien Vincent

8 accepted papers

2024

MusicRL: Aligning Music Generation to Human Preferences

ICML 2024poster

We propose MusicRL, the first music generation system finetuned from human feedback. Appreciation of text-to-music models is particularly subjective since the concept of musicality as well as the specific intention behind a caption are user-dependent (e.g. a caption such as “upbeat workout music” ca…

2022

Continuous Control with Action Quantization from Demonstrations

ICML 2022spotlight

In this paper, we propose a novel Reinforcement Learning (RL) framework for problems with continuous action spaces: Action Quantization from Demonstrations (AQuaDem). The proposed approach consists in learning a discretization of continuous action spaces from human demonstrations. This discretizatio…

2021

Hyperparameter Selection for Imitation Learning

ICML 2021oral

We address the issue of tuning hyperparameters (HPs) for imitation learning algorithms in the context of continuous-control, when the underlying reward function of the demonstrating expert cannot be observed at any time. The vast literature in imitation learning mostly considers this reward function…

2021

What Matters for Adversarial Imitation Learning?

NeurIPS 2021poster

Adversarial imitation learning has become a popular framework for imitation in continuous control. Over the years, several variations of its components were proposed to enhance the performance of the learned policies as well as the sample complexity of the algorithm. In practice, these choices are r…

Cited by 88SourcePDFScholar
2019

Adaptive Temporal-Difference Learning for Policy Evaluation with Per-State Uncertainty Estimates

NeurIPS 2019poster

We consider the core reinforcement-learning problem of on-policy value function approximation from a batch of trajectory data, and focus on various issues of Temporal Difference (TD) learning and Monte Carlo (MC) policy evaluation. The two methods are known to achieve complementary bias-variance tra…

Cited by 10SourcePDFScholar
2019

Episodic Curiosity through Reachability

ICLR 2019poster

Rewards are sparse in the real world and most of today's reinforcement learning algorithms struggle with such sparsity. One solution to this problem is to allow the agent to create rewards for itself - thus making rewards dense and more suitable for learning. In particular, inspired by curious behav…

2018

Improved Lossy Image Compression With Priming and Spatially Adaptive Bit Rates for Recurrent Networks

CVPR 2018poster

We propose a method for lossy image compression based on recurrent, convolutional neural networks that outper- forms BPG (4:2:0), WebP, JPEG2000, and JPEG as mea- sured by MS-SSIM. We introduce three improvements over previous research that lead to this state-of-the-art result us- ing a single model…

Cited by 483SourcePDFScholar
2017

Full Resolution Image Compression With Recurrent Neural Networks

CVPR 2017oral

This paper presents a set of full-resolution lossy image compression methods based on neural networks. Each of the architectures we describe can provide variable compression rates during deployment without requiring retraining of the network: each network need only be trained once. All of our archit…

Cited by 1111PDFScholar