Chris Pal

Biographie

Christopher Pal est titulaire d'une chaire en IA Canada-CIFAR, professeur titulaire à Polytechnique Montréal et professeur adjoint au Département d'informatique et de recherche opérationnelle (DIRO) de l'Université de Montréal. Il est également chercheur émérite à ServiceNow Research. Il est engagé dans la recherche sur l'intelligence artificielle et l'apprentissage automatique depuis plus de 25 ans, publiant souvent des travaux sur les méthodes de modélisation du langage à grande échelle et les techniques de modélisation générative. Il a obtenu un doctorat en informatique à l'Université de Waterloo.

Étudiants actuels

Mai Ababneh

Collaborateur·rice de recherche - Formerly McGill (but ending)

Paul Barde

Collaborateur·rice de recherche - McGill

Superviseur⋅e principal⋅e :

Maîtrise recherche - UdeM

Chris Beckham

Doctorat - Polytechnique

Can (Sam) Chen

Collaborateur·rice alumni - McGill

Superviseur⋅e principal⋅e :

Xue (Steve) Liu

Léa Demeule

Doctorat - UdeM

Superviseur⋅e principal⋅e :

Doctorat - Polytechnique

Chris Emezue

Maîtrise recherche - UdeM

Co-superviseur⋅e :

Collaborateur·rice alumni - Polytechnique

Roger Girgis

Doctorat - Polytechnique

Florian Golemo

Postdoctorat - McGill

Maîtrise recherche - Polytechnique

Doctorat - UdeM

Co-superviseur⋅e :

Yousef Kotp

Maîtrise recherche - Concordia

Co-superviseur⋅e :

Maîtrise recherche - UdeM

Olga Luo

Doctorat - UdeM

Doctorat - UdeM

Joel Moniz

Doctorat - Polytechnique

Jonathan Pilault

Doctorat - Polytechnique

Juan Rodriguez

Doctorat - École de technologie suprérieure

Spécification directe du comportement par apprentissage par renforcement sous contrainte

Luke Rowe

Doctorat - UdeM

Superviseur⋅e principal⋅e :

Gaurav Sahu

Postdoctorat - HEC

Superviseur⋅e principal⋅e :

Doctorat - Polytechnique

Superviseur⋅e principal⋅e :

Doctorat - McGill

Superviseur⋅e principal⋅e :

Doctorat - Polytechnique

Co-superviseur⋅e :

Doctorat - UdeM

Billets de blogue

Direct Behavior Specification via Constrained Reinforcement Learning

31 août 2022

par

Julien Roy

Roger Girgis

Joshua Romoff

Pierre-Luc Bacon

Chris Pal

Lire l'article

Publications

Overcoming challenges in leveraging GANs for few-shot data augmentation

Christopher Beckham

Issam Hadj Laradji

Pau Rodriguez

David Vazquez

Derek Nowrouzezahrai

2022-01-01

CoLLAs (publié)

proceedings.mlr.press

Towards good validation metrics for generative models in offline model-based optimisation

Christopher Beckham

Alexandre Piché

David Vazquez

In this work we propose a principled evaluation framework for model-based optimisation to measure how well a generative model can extrapolat… (voir plus)e. We achieve this by interpreting the training and validation splits as draws from their respective ‘truncated’ ground truth distributions, where examples in the validation set contain scores much larger than those in the training set. Model selection is performed on the validation set for some prescribed validation metric. A major research question however is in determining what validation metric correlates best with the expected value of generated candidates with respect to the ground truth oracle; work towards answering this question can translate to large economic gains since it is expensive to evaluate the ground truth oracle in the real world. We compare various validation metrics for generative adversarial networks using our framework. We also discuss limitations with our framework with respect to existing datasets and how progress can be made to mitigate them. 1

2022-01-01

arXiv.org (prépublication)

doi.org

Learned Image Compression for Machine Perception

Felipe Codevilla

Jean Gabriel Simard

Ross Goroshin

2021-11-03

ArXiv (prépublication)

From Machine Learning to Robotics: Challenges and Opportunities for Embodied Intelligence

Nicholas Roy

Ingmar Posner

T. Barfoot

Philippe Beaudoin

Yoshua Bengio

Jeannette Bohg

Oliver Brock

Isabelle Depatie

Dieter Fox

D. Koditschek

Tom'as Lozano-p'erez

Vikash K. Mansinghka

Blake Richards

Dorsa Sadigh

Stefan Schaal

G. Sukhatme

Denis Therien

Marc Emile Toussaint

Michiel van de Panne

2021-10-28

ArXiv (prépublication)

Systematic Evaluation of Causal Discovery in Visual Model Based Reinforcement Learning

Nan Rosemary Ke

Aniket Rajiv Didolkar

Danilo Jimenez Rezende

Yoshua Bengio

Michael Curtis Mozer

Inducing causal relationships from observations is a classic problem in machine learning. Most work in causality starts from the premise tha… (voir plus)t the causal variables themselves are observed. However, for AI agents such as robots trying to make sense of their environment, the only observables are low-level variables like pixels in images. To generalize well, an agent must induce high-level variables, particularly those which are causal or are affected by causal variables. A central goal for AI and causality is thus the joint discovery of abstract representations and causal structure. However, we note that existing environments for studying causal induction are poorly suited for this objective because they have complicated task-specific causal graphs which are impossible to manipulate parametrically (e.g., number of nodes, sparsity, causal chain length, etc.). In this work, our goal is to facilitate research in learning representations of high-level variables as well as causal structures among them. In order to systematically probe the ability of methods to identify these variables and structures, we design a suite of benchmarking RL environments. We evaluate various representation learning algorithms from the literature and find that explicitly incorporating structure and modularity in models can help causal induction in model-based reinforcement learning.

2021-10-11

NeurIPS.cc/2021/Track/Datasets_and_Benchmarks/Round2 (publié)

Action-Based Representation Learning for Autonomous Driving

Yi Xiao

Felipe Codevilla

Antonio M. López

Human drivers produce a vast amount of data which could, in principle, be used to improve autonomous driving systems. Unfortunately, seeming… (voir plus)ly straightforward approaches for creating end-to-end driving models that map sensor data directly into driving actions are problematic in terms of interpretability, and typically have significant difficulty dealing with spurious correlations. Alternatively, we propose to use this kind of action-based driving data for learning representations. Our experiments show that an affordance-based driving model pre-trained with this approach can leverage a relatively small amount of weakly annotated imagery and outperform pure end-to-end driving models, while being more interpretable. Further, we demonstrate how this strategy outperforms previous methods based on learning inverse dynamics models as well as other methods based on heavy human supervision (ImageNet).

2021-10-04

Proceedings of the 2020 Conference on Robot Learning (publié)

proceedings.mlr.press

Simple Video Generation using Neural ODEs

David Kanaa

Vikram Voleti

Samira Ebrahimi Kahou

Despite having been studied to a great extent, the task of conditional generation of sequences of frames, or videos, remains extremely chall… (voir plus)enging. It is a common belief that a key step towards solving this task resides in modelling accurately both spatial and temporal information in video signals. A promising direction to do so has been to learn latent variable models that predict the future in latent space and project back to pixels, as suggested in recent literature. Following this line of work and building on top of a family of models introduced in prior work, Neural ODE, we investigate an approach that models time-continuous dynamics over a continuous latent space with a differential equation with respect to time. The intuition behind this approach is that these trajectories in latent space could then be extrapolated to generate video frames beyond the time steps for which the model is trained. We show that our approach yields promising results in the task of future frame prediction on the Moving MNIST dataset with 1 and 2 digits.

2021-09-07

ArXiv (prépublication)

Deep Learning for Detecting Extreme Weather Patterns

Mayur Mudigonda

Mayur Mudigonda, Prabhat Ram

Prabhat Ram

Karthik Kashinath

Evan Racah

Ankur Mahesh

Yunjie Liu

Christopher Beckham

Jim Biard

Thorsten Kurth

Sookyung Kim

Samira Ebrahimi Kahou

Tegan Maharaj

Burlen Loring

Travis O'Brien

K. Kunkel

Kenneth E. Kunkel

M. Wehner

Michael F. Wehner … (voir 2 de plus)

W. Collins

William D. Collins

2021-08-20

Deep Learning for the Earth Sciences (publié)

doi.org

Improving Continuous Normalizing Flows using a Multi-Resolution Framework

Vikram Voleti

Chris Finlay

Adam M. Oberman

Recent work has shown that Continuous Normalizing Flows (CNFs) can serve as generative models of images with exact likelihood calculation an… (voir plus)d invertible generation/density estimation. In this work we introduce a Multi-Resolution variant of such models (MRCNF). We introduce a transformation between resolutions that allows for no change in the log likelihood. We show that this approach yields comparable likelihood values for various image datasets, with improved performance at higher resolutions, with fewer parameters, using only 1 GPU.

2021-06-15

ICML.cc/2021/Workshop/INNF (poster)

Predicting Infectiousness for Proactive Contact Tracing

Prateek Gupta

Nasim Rahaman

Pierre-Luc St-Charles

Hannah Alsdurf

gaetan caron

satya ortiz gagne

Bernhard Schölkopf … (voir 3 de plus)

Abhinav Sharma

Jian Tang

Andrew Robert Williams

The COVID-19 pandemic has spread rapidly worldwide, overwhelming manual contact tracing in many countries and resulting in widespread lockdo… (voir plus)wns for emergency containment. Large-scale digital contact tracing (DCT) has emerged as a potential solution to resume economic and social activity while minimizing spread of the virus. Various DCT methods have been proposed, each making trade-offs between privacy, mobility restrictions, and public health. The most common approach, binary contact tracing (BCT), models infection as a binary event, informed only by an individual's test results, with corresponding binary recommendations that either all or none of the individual's contacts quarantine. BCT ignores the inherent uncertainty in contacts and the infection process, which could be used to tailor messaging to high-risk individuals, and prompt proactive testing or earlier warnings. It also does not make use of observations such as symptoms or pre-existing medical conditions, which could be used to make more accurate infectiousness predictions. In this paper, we use a recently-proposed COVID-19 epidemiological simulator to develop and test methods that can be deployed to a smartphone to locally and proactively predict an individual's infectiousness (risk of infecting others) based on their contact history and other information, while respecting strong privacy constraints. Predictions are used to provide personalized recommendations to the individual via an app, as well as to send anonymized messages to the individual's contacts, who use this information to better predict their own infectiousness, an approach we call proactive contact tracing (PCT). We find a deep-learning based PCT method which improves over BCT for equivalent average mobility, suggesting PCT could help in safe re-opening and second-wave prevention.

2021-01-12

ICLR.cc/2021/Conference (spotlight)

Reinforcement Learning with Random Delays

Simon Ramstedt

Action and observation delays commonly occur in many Reinforcement Learning applications, such as remote control scenarios. We study the ana… (voir plus)tomy of randomly delayed environments, and show that partially resampling trajectory fragments in hindsight allows for off-policy multi-step value estimation. We apply this principle to derive Delay-Correcting Actor-Critic (DCAC), an algorithm based on Soft Actor-Critic with significantly better performance in environments with delays. This is shown theoretically and also demonstrated practically on a delay-augmented version of the MuJoCo continuous control benchmark.

2021-01-12

ICLR.cc/2021/Conference (poster)

Accounting for Variance in Machine Learning Benchmarks

Naz Sepah

Edward Raff

Kanika Madan

Vikram Voleti

Samira Ebrahimi Kahou

Strong empirical evidence that one machine-learning algorithm A outperforms another one B ideally calls for multiple trials optimizing the l… (voir plus)earning pipeline over sources of variation such as data sampling, data augmentation, parameter initialization, and hyperparameters choices. This is prohibitively expensive, and corners are cut to reach conclusions. We model the whole benchmarking process, revealing that variance due to data sampling, parameter initialization and hyperparameter choice impact markedly the results. We analyze the predominant comparison methods used today in the light of this variance. We show a counter-intuitive result that adding more sources of variation to an imperfect estimator approaches better the ideal estimator at a 51 times reduction in compute cost. Building on these results, we study the error rate of detecting improvements, on five different deep-learning tasks/architectures. This study leads us to propose recommendations for performance comparisons.

2021-01-01

MLSys (publié)