Demo Data from EDBT 2026 / reviewers in the wild / expert
David Warde-Farley
dblp:71/9421
· DBLP profile ↗
11ranked-venue papers
2as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 9 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
9 papers |
Reinforcement learning · 66% Trustworthy machine learning · 21% Generative modeling · 6% |
Topics — the 16 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
exploration |
1.1 | 2 | 2022 | Learning more skills through optimistic exploration · ICLR 2022 Entropic Desired Dynamics for Intrinsic Control · NeurIPS 2021 |
Machine learning › Reinforcement learning › hierarchical reinforcement learning
skill learning |
1.1 | 2 | 2022 | Learning more skills through optimistic exploration · ICLR 2022 Relative Variational Intrinsic Control · AAAI 2021 |
Machine learning › Trustworthy machine learning › fairness
bias evaluation |
0.8 | 1 | 2024 | Evaluating Model Bias Requires Characterizing its Mistakes · ICML 2024 |
Machine learning › Trustworthy machine learning
fairness |
0.8 | 1 | 2024 | Evaluating Model Bias Requires Characterizing its Mistakes · ICML 2024 |
Machine learning › Reinforcement learning › exploration
optimistic exploration |
0.6 | 1 | 2022 | Learning more skills through optimistic exploration · ICLR 2022 |
Machine learning › Reinforcement learning › hierarchical reinforcement learning › skill learning
skill discovery |
0.6 | 1 | 2022 | Learning more skills through optimistic exploration · ICLR 2022 |
Machine learning › Reinforcement learning
hierarchical reinforcement learning |
0.5 | 1 | 2021 | Relative Variational Intrinsic Control · AAAI 2021 |
Machine learning › Generative modeling
generative adversarial network |
0.5 | 2 | 2017 | Improving Generative Adversarial Networks with Denoising Feature Matching · ICLR (Poster) 2017 Generative Adversarial Nets · NIPS 2014 |
Machine learning › Reinforcement learning
task inference |
0.4 | 1 | 2020 | Fast Task Inference with Variational Intrinsic Successor Features · ICLR 2020 |
Machine learning › Reinforcement learning
reward learning |
0.4 | 1 | 2019 | Unsupervised Control Through Non-Parametric Discriminative Rewards · ICLR (Poster) 2019 |
Machine learning › Reinforcement learning
unsupervised reinforcement learning |
0.4 | 1 | 2019 | Unsupervised Control Through Non-Parametric Discriminative Rewards · ICLR (Poster) 2019 |
Computer vision › 3D vision
feature matching |
0.3 | 1 | 2017 | Improving Generative Adversarial Networks with Denoising Feature Matching · ICLR (Poster) 2017 |
Machine learning › Trustworthy machine learning › robustness
spurious correlation |
0.2 | 1 | 2024 | Evaluating Model Bias Requires Characterizing its Mistakes · ICML 2024 |
Machine learning › Deep learning architectures and training › regularization
dropout |
0.2 | 1 | 2013 | Maxout Networks · ICML (3) 2013 |
Machine learning › Deep learning architectures and training
regularization |
0.2 | 1 | 2013 | Maxout Networks · ICML (3) 2013 |
Computer vision › Image recognition and object detection
image classification |
0.0 | 1 | 2013 | Maxout Networks · ICML (3) 2013 |
Methods — techniques the papers use, named apart from their topics
hypothesis testing · 0.8effect size analysis · 0.8optimistic exploration · 0.6mutual information · 0.5latent dynamics · 0.5entropic desired dynamics · 0.5variational inference · 0.4successor features · 0.4non-parametric discriminative rewards · 0.4denoising feature matching · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Evaluating Model Bias Requires Characterizing its MistakesabstractThe ability to properly benchmark model performance in the face of spurious correlations is important to both build better predictors and increase confidence that models are operating as intended. We demonstrate that characterizing (as opposed to simply quantifying) model mistakes across subgroups is pivotal to properly reflect model biases, which are ignored by standard metrics such as worst-group accuracy or accuracy gap. Inspired by the hypothesis testing framework, we introduce SkewSize, a principled and flexible metric that captures bias from mistakes in a model's predictions. It can be used in multi-class settings or generalised to the open vocabulary setting of generative models. SkewSize is an aggregation of the effect size of the interaction between two categorical variables: the spurious variable representing the bias attribute the model's prediction. We demonstrate the utility of SkewSize in multiple settings including: standard vision models trained on synthetic data, vision models trained on ImageNet, and large scale vision-and-language models from the BLIP-2 family. In each case, the proposed SkewSize is able to highlight biases not captured by other metrics, while also providing insights on the impact of recently proposed techniques, such as instruction tuning. Isabela Albuquerque, Jessica Schrouff, David Warde-Farley, A. Taylan Cemgil, Sven Gowal, Olivia Wiles |
ICML | 3 |
| 2022 | Learning more skills through optimistic exploration
DJ Strouse, Kate Baumli, David Warde-Farley, Volodymyr Mnih, Steven Hansen 0001 |
ICLR | 3 |
| 2021 | Relative Variational Intrinsic ControlabstractIn the absence of external rewards, agents can still learn useful behaviors by identifying and mastering a set of diverse skills within their environment. Existing skill learning methods use mutual information objectives to incentivize each skill to be diverse and distinguishable from the rest. However, if care is not taken to constrain the ways in which the skills are diverse, trivially diverse skill sets can arise. To ensure useful skill diversity, we propose a novel skill learning objective, Relative Variational Intrinsic Control (RVIC), which incentivizes learning skills that are distinguishable in how they change the agent's relationship to its environment. The resulting set of skills tiles the space of affordances available to the agent. We qualitatively analyze skill behaviors on multiple environments and show how RVIC skills are more useful than skills discovered by existing methods in hierarchical reinforcement learning. Kate Baumli, David Warde-Farley, Steven Hansen 0001, Volodymyr Mnih |
AAAI | 2 |
| 2021 | Entropic Desired Dynamics for Intrinsic ControlabstractAn agent might be said, informally, to have mastery of its environment when it has maximised the effective number of states it can reliably reach. In practice, this often means maximizing the number of latent codes that can be discriminated from future states under some short time horizon (e.g. \cite{eysenbach2018diversity}). By situating these latent codes in a globally consistent coordinate system, we show that agents can reliably reach more states in the long term while still optimizing a local objective. A simple instantiation of this idea, \textbf{E}ntropic \textbf{D}esired \textbf{D}ynamics for \textbf{I}ntrinsic \textbf{C}on\textbf{T}rol (EDDICT), assumes fixed additive latent dynamics, which results in tractable learning and an interpretable latent space. Compared to prior methods, EDDICT's globally consistent codes allow it to be far more exploratory, as demonstrated by improved state coverage and increased unsupervised performance on hard exploration games such as Montezuma's Revenge. Steven Hansen 0001, Guillaume Desjardins, Kate Baumli, David Warde-Farley, Nicolas Heess, Simon Osindero, Volodymyr Mnih |
NeurIPS | 4 |
| 2020 | Fast Task Inference with Variational Intrinsic Successor Features
Steven Hansen 0001, Will Dabney, André Barreto 0001, David Warde-Farley, Tom Van de Wiele, Volodymyr Mnih |
ICLR | 4 |
| 2019 | Unsupervised Control Through Non-Parametric Discriminative Rewards
David Warde-Farley, Tom Van de Wiele, Tejas D. Kulkarni, Catalin Ionescu, Steven Hansen 0001, Volodymyr Mnih |
ICLR (Poster) | 1 |
| 2017 | Improving Generative Adversarial Networks with Denoising Feature Matching
David Warde-Farley, Yoshua Bengio |
ICLR (Poster) | 1 |
| 2017 | Brain tumor segmentation with Deep Neural Networks
Mohammad Havaei, Axel Davy, David Warde-Farley, Antoine Biard, Aaron C. Courville, Yoshua Bengio, Christopher Joseph Pal, Pierre-Marc Jodoin, Hugo Larochelle |
Medical Image Anal. | 3 |
| 2014 | Generative Adversarial Nets
Ian J. Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, David Warde-Farley, Sherjil Ozair, Aaron C. Courville, Yoshua Bengio |
NIPS | 5 |
| 2013 | Combining modality specific deep neural networks for emotion recognition in videoabstractIn this paper we present the techniques used for the University of Montréal's team submissions to the 2013 Emotion Recognition in the Wild Challenge. The challenge is to classify the emotions expressed by the primary human subject in short video clips extracted from feature length movies. This involves the analysis of video clips of acted scenes lasting approximately one-two seconds, including the audio track which may contain human voices as well as background music. Our approach combines multiple deep neural networks for different data modalities, including: (1) a deep convolutional neural network for the analysis of facial expressions within video frames; (2) a deep belief net to capture audio information; (3) a deep autoencoder to model the spatio-temporal information produced by the human actions depicted within the entire scene; and (4) a shallow network architecture focused on extracted features of the mouth of the primary human subject in the scene. We discuss each of these techniques, their performance characteristics and different strategies to aggregate their predictions. Our best single model was a convolutional neural network trained to predict emotions from static frames using two large data sets, the Toronto Face Database and our own set of faces images harvested from Google image search, followed by a per frame aggregation strategy that used the challenge training data. This yielded a test set accuracy of 35.58%. Using our best strategy for aggregating our top performing models into a single predictor we were able to produce an accuracy of 41.03% on the challenge test set. These compare favorably to the challenge baseline test set accuracy of 27.56%. Samira Ebrahimi Kahou, Christopher Joseph Pal, Xavier Bouthillier, Pierre Froumenty, Caglar Gulcehre, Roland Memisevic, Pascal Vincent, Aaron C. Courville, Yoshua Bengio, Raul Chandias Ferrari, Mehdi Mirza, Sébastien Jean, Pierre Luc Carrier, Yann N. Dauphin, Nicolas Boulanger-Lewandowski, Abhishek Aggarwal, Jeremie Zumer, Pascal Lamblin, Jean-Philippe Raymond, Guillaume Desjardins, Razvan Pascanu, David Warde-Farley, Atousa Torabi, Arjun Sharma, Emmanuel Bengio, Kishore Reddy Konda, Zhenzhou Wu |
ICMI | 22 |
| 2013 | Maxout NetworksabstractWe consider the problem of designing models to leverage a recently introduced approximate model averaging technique called dropout. We define a simple new model called maxout (so named because its output is the max of a set of inputs, and because it is a natural companion to dropout) designed to both facilitate optimization by dropout and improve the accuracy of dropout's fast approximate model averaging technique. We empirically verify that the model successfully accomplishes both of these tasks. We use maxout and dropout to demonstrate state of the art classification performance on four benchmark datasets: MNIST, CIFAR-10, CIFAR-100, and SVHN. Ian J. Goodfellow, David Warde-Farley, Mehdi Mirza, Aaron C. Courville, Yoshua Bengio |
ICML (3) | 2 |