Publications

What's in the Box? A Preliminary Analysis of Undesirable Content in the Common Crawl Corpus
Alexandra (Sasha) Luccioni
Joseph Viviano
Alexandra Luccioni, Joseph Viviano. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th Int… (voir plus)ernational Joint Conference on Natural Language Processing (Volume 2: Short Papers). 2021.
2021-07-31
Meeting of the Association for Computational Linguistics and International Joint Conference on Natural Language Processing (publié)
doi.org
Why do sleep disorders belong to mental disorder classifications? A network analysis of the "Sleep-Wake Disorders" section of the DSM-5.
Christophe Gauld
Régis Lopez
Charles Morin
Julien Maquet
Aileen McGonigal
Pierre A. GEOFFROY
Eric Fakra
Pierre Philip
Guillaume Dumas
Jean‐Arthur Micoulaud‐Franchi
2021-07-31
Journal of Psychiatric Research (publié)
doi.org
Atlas-Based Quantification of DTI Measures in a Typically Developing Pediatric Spinal Cord
Shiva Shahrampour
Benjamin De Leener
Mahdi Alizadeh
D. Middleton
Laura Krisa
Adam E. Flanders
S. Faro
Julien Cohen-Adad
F. Mohamed
2021-07-28
American Journal of Neuroradiology (publié)
doi.org
A Unified Few-Shot Classification Benchmark to Compare Transfer and Meta Learning Approaches
Vincent Dumoulin
Neil Houlsby
Utku Evci
Xiaohua Zhai
Ross Goroshin
Sylvain Gelly
Hugo Larochelle
Meta and transfer learning are two successful families of approaches to few-shot 1 learning. Despite highly related goals, state-of-the-art … (voir plus)advances in each family are 2 measured largely in isolation of each other. As a result of diverging evaluation 3 norms, a direct or thorough comparison of different approaches is challenging. 4 To bridge this gap, we introduce a few-shot classification evaluation protocol 5 named VTAB+MD with the explicit goal of facilitating sharing of insights from 6 each community. We demonstrate its accessibility in practice by performing a 7 cross-family study of the best transfer and meta learners which report on both a 8 large-scale meta-learning benchmark (Meta-Dataset, MD), and a transfer learning 9 benchmark (Visual Task Adaptation Benchmark, VTAB). We find that, on average, 10 large-scale transfer methods (Big Transfer, BiT) outperform competing approaches 11 on MD, even when trained only on ImageNet. In contrast, meta-learning approaches 12 struggle to compete on VTAB when trained and validated on MD. However, BiT 13 is not without limitations, and pushing for scale does not improve performance 14 on highly out-of-distribution MD tasks. We hope that this work contributes to 15 accelerating progress on few-shot learning research. 16
2021-07-28
NeurIPS.cc/2021/Track/Datasets_and_Benchmarks/Round1 (accepté)
openreview.net
openreview.net
Models of Computational Profiles to Study the Likelihood of DNN Metamorphic Test Cases
Ettore Merlo
Mira Marhaba
Foutse Khomh
Houssem Ben Braiek
Giuliano Antoniol
Neural network test cases are meant to exercise different reasoning paths in an architecture and used to validate the prediction outcomes. I… (voir plus)n this paper, we introduce "computational profiles" as vectors of neuron activation levels. We investigate the distribution of computational profile likelihood of metamorphic test cases with respect to the likelihood distributions of training, test and error control cases. We estimate the non-parametric probability densities of neuron activation levels for each distinct output class. Probabilities are inferred using training cases only, without any additional knowledge about metamorphic test cases. Experiments are performed by training a network on the MNIST Fashion library of images and comparing prediction likelihoods with those obtained from error control-data and from metamorphic test cases. Experimental results show that the distributions of computational profile likelihood for training and test cases are somehow similar, while the distribution of the random-noise control-data is always remarkably lower than the observed one for the training and testing sets. In contrast, metamorphic test cases show a prediction likelihood that lies in an extended range with respect to training, tests, and random noise. Moreover, the presented approach allows the independent assessment of different training classes and experiments to show that some of the classes are more sensitive to misclassifying metamorphic test cases than other classes. In conclusion, metamorphic test cases represent very aggressive tests for neural network architectures. Furthermore, since metamorphic test cases force a network to misclassify those inputs whose likelihood is similar to that of training cases, they could also be considered as adversarial attacks that evade defenses based on computational profile likelihood evaluation.
2021-07-27
arXiv (Cornell University) (prépublication)
doi.org
arxiv.org
Automated Data-Driven Generation of Personalized Pedagogical Interventions in Intelligent Tutoring Systems
Ekaterina Kochmar
Dung D. Vu
Robert Belfer
Varun Gupta
Iulian V. Serban
Joelle Pineau
2021-07-26
International Journal of Artificial Intelligence in Education (publié)
doi.org
Modelling Latent Translations for Cross-Lingual Transfer
Edoardo Ponti
Julia Kreutzer
Ivan Vulić
Siva Reddy
2021-07-22
ArXiv (prépublication)
arxiv.org
arxiv.org
Automatic multiclass intramedullary spinal cord tumor segmentation on MRI with deep learning
Andréanne Lemay
Charley Gros
Zhizheng Zhuo
Jie Zhang
Yunyun Duan
Julien Cohen-Adad
Yaou Liu
2021-07-21
NeuroImage : Clinical (publié)
doi.org
Exploration-Driven Representation Learning in Reinforcement Learning
Akram Erraqabi
Harry Zhao
Mingde Zhao
Marlos C. Machado
Yoshua Bengio
Sainbayar Sukhbaatar
Ludovic Denoyer
Alessandro Lazaric
Learning reward-agnostic representations is an emerging paradigm in reinforcement learning. These representations can be leveraged for sever… (voir plus)al purposes ranging from reward shaping to skill discovery. Nevertheless, in order to learn such representations, existing methods often rely on assuming uniform access to the state space. With such a privilege, the agent’s coverage of the environment can be limited which hurts the quality of the learned representations. In this work, we introduce a method that explicitly couples representation learning with exploration when the agent is not provided with a uniform prior over the state space. Our method learns representations that constantly drive exploration while the data generated by the agent’s exploratory behavior drives the learning of better representations. We empirically validate our approach in goal-achieving tasks, demonstrating that the learned representation captures the dynamics of the environment, leads to more accurate value estimation, and to faster credit assignment, both when used for control and for reward shaping. Finally, the exploratory policy that emerges from our approach proves to be successful at continuous navigation tasks with sparse rewards.
2021-07-21
ICML.cc/2021/Workshop/URL (poster)
openreview.net
openreview.net
Diffusion magnetic resonance imaging reveals tract‐specific microstructural correlates of electrophysiological impairments in non‐myelopathic and myelopathic spinal cord compression
Jan Valosek
René Labounek
Tomáš Horák
Magda Horáková
Petr Bednařík
Miloš Keřkovský
Jan Kočica
Tomáš Rohan
Christophe Lenglet
Julien Cohen‐Adad
Petr Hluštı́k
Eva Vlčková
Zdeněk Kadaňka
Josef Bednařík
Alena Svátková
Non‐myelopathic degenerative cervical spinal cord compression (NMDC) frequently occurs throughout aging and may progress to potentially ir… (voir plus)reversible degenerative cervical myelopathy (DCM). Whereas standard clinical magnetic resonance imaging (MRI) and electrophysiological measures assess compression severity and neurological dysfunction, respectively, underlying microstructural deficits still have to be established in NMDC and DCM patients. The study aims to establish tract‐specific diffusion MRI markers of electrophysiological deficits to predict the progression of asymptomatic NMDC to symptomatic DCM.
2021-07-20
European Journal of Neurology (publié)
doi.org
Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?
Dinghuai Zhang
Kartik Ahuja
Yilun Xu
Yisen Wang
Aaron Courville
Can models with particular structure avoid being biased towards spurious correlation in out-of-distribution (OOD) generalization? Peters et … (voir plus)al. (2016) provides a positive answer for linear cases. In this paper, we use a functional modular probing method to analyze deep model structures under OOD setting. We demonstrate that even in biased models (which focus on spurious correlation) there still exist unbiased functional subnetworks. Furthermore, we articulate and demonstrate the functional lottery ticket hypothesis: full network contains a subnetwork that can achieve better OOD performance. We then propose Modular Risk Minimization to solve the subnetwork selection problem. Our algorithm learns the subnetwork structure from a given dataset, and can be combined with any other OOD regularization methods. Experiments on various OOD generalization tasks corroborate the effectiveness of our method.
2021-07-19
International Conference on Machine Learning (Oral)
doi.org
proceedings.mlr.press
Continuous Coordination As a Realistic Scenario for Lifelong Learning
Hadi Nekoei
Akilesh Badrinaaraayanan
Aaron Courville
Sarath Chandar
Current deep reinforcement learning (RL) algorithms are still highly task-specific and lack the ability to generalize to new environments. L… (voir plus)ifelong learning (LLL), however, aims at solving multiple tasks sequentially by efficiently transferring and using knowledge between tasks. Despite a surge of interest in lifelong RL in recent years, the lack of a realistic testbed makes robust evaluation of LLL algorithms difficult. Multi-agent RL (MARL), on the other hand, can be seen as a natural scenario for lifelong RL due to its inherent non-stationarity, since the agents' policies change over time. In this work, we introduce a multi-agent lifelong learning testbed that supports both zero-shot and few-shot settings. Our setup is based on Hanabi -- a partially-observable, fully cooperative multi-agent game that has been shown to be challenging for zero-shot coordination. Its large strategy space makes it a desirable environment for lifelong RL tasks. We evaluate several recent MARL methods, and benchmark state-of-the-art LLL algorithms in limited memory and computation regimes to shed light on their strengths and weaknesses. This continual learning paradigm also provides us with a pragmatic way of going beyond centralized training which is the most commonly used training protocol in MARL. We empirically show that the agents trained in our setup are able to coordinate well with unseen agents, without any additional assumptions made by previous works. The code and all pre-trained models are available at https://github.com/chandar-lab/Lifelong-Hanabi.
2021-07-19
International Conference on Machine Learning (Spotlight)
doi.org
proceedings.mlr.press