NeurIPS 2021 Competition Track
Below you will find a brief summary of accepted competitions NeurIPS 2021. Regular competitions take place before the NeurIPS, whereas live competitions will have their final phase during the competition session @NeurIPS2021.
Competitions are listed in alphabetical order, all prizes are tentative and depend solely on the organizing team of each competition and the corresponding sponsors. Please note that all information is subject to change, please visit the competition websites regularly and contact the organizers of each competition directly for more information.
NeurIPS 2021 Accepted Competitions
Rohin Shah, (UC Berkeley), Cody Wild (UC Berkeley), Steven H. Wang (UC Berkeley), Neel Alex (UC Berkeley), Brandon Houghton (OpenAI), William Guss (OpenAI), Sharada Mohanty (AIcrowd), Stephanie Milani (Carnegie Mellon University), Nicholay Topin (Carnegie Mellon University), Pieter Abbeel (UC Berkeley), Stuart Russell (UC Berkeley), Anca Dragan (UC Berkeley).
Short description: The Benchmark for Agents that Solve Almost-Lifelike Tasks (BASALT) competition aims to promote research in the area of learning from human feedback in order to enable agents that can pursue tasks that do not have crisp, easily defined reward functions. We provide tasks consisting of a simple English language description alongside a Gym environment, without any associated reward function, but with expert demos. Participants will train agents for these tasks using their preferred methods.
We expect typical solutions will use imitation learning, or learning from comparisons. Submitted agents will be evaluated based on how well they complete the tasks, as judged by humans given the same description of the tasks.
Harsha Vardhan Simhadri (Microsoft Research India), George Williams (GSI Technology), Martin Aumüller (IT University of Copenhagen), Artem Babenko(Yandex), Dmitry Baranchuk (Yandex), Qi Chen (Microsoft Research Asia), Matthijs Douze (Facebook AI Research), Ravishankar Krishnaswamy (Microsoft Research India, IIT Madras), Gopal Srinivasa (Microsoft Research India), Suhas Jayaram Subramanya (Carnegie Mellon University), Jingdong Wang (Microsoft Research Asia).
Approximate Nearest Neighbor Search (ANNS) amounts to finding nearby points to a given query point in a high-dimensional vector space. ANNS algorithms optimize a tradeoff between search speed, memory usage and accuracy with respect to an exact sequential search. Thanks to efforts like ann-benchmarks.com, the state of the art for ANNS on million-scale datasets is quite clear. This competition aims at pushing the scale to out-of-memory billion-scale datasets and other hardware configurations that are realistic in many current applications. The competition uses six representative billion-scale datasets -- many newly released for this competition -- with their associated accuracy metrics. There are three tracks depending on hardware settings: (T1) limited memory (T2) limited main memory + SSD (T3) any hardware configuration including accelerators and custom silicon. We will use two recent indexing algorithms, DiskANN and FAISS, as baselines for tracks T1 and T2. The anticipated impact is an understanding of the ideas that apply at a billion-point scale, bridging communities that work on ANNS problems, and a platform for newer researchers to contribute and develop this relatively new research area. We will provide Azure cloud compute credit to participants with promising ideas without necessary infrastructure to develop their submissions.
William Guss (OpenAI Inc., Carnegie Mellon University), Alara Dirik (Bogazici University), Byron Galbraith (Talla), Brandon Houghton (OpenAI Inc.), Anssi Kanervisto (University of Eastern Finland), Noboru Kuno (Microsoft Research), Stephanie Milani (Carnegie Mellon University), Sharada Mohanty (AICrowd), Karolis Ramanauskas ( N/A ), Ruslan Salakhutdinov (Carnegie Mellon University), Rohin Shah (UC Berkeley ), Nicholay Topin (Carnegie Mellon University), Steven Wang (UC Berkeley ), Cody Wild (UC Berkeley).
In the third MineRL Diamond competition, participants continue to develop algorithms which can efficiently leverage human demonstrations to drastically reduce the number of samples needed to solve a complex task in Minecraft. The competition environment features sparse-rewards, long-term planning, vision and sub-task hierarchies. To ensure that truly sample-efficient are developed, organizers re-train submitted systems on a fixed cloud-computing environment for a limited number of samples (4 days or 8 million samples). To ease the entry to machine learning research, the competition features two tracks: introduction, which allows agents developed using any method ranging from end-to-end machine learning solutions to programmatic approaches; and research, which requires participants develop novel imitation and reinforcement learning algorithms to solve this difficult sample-limited task.
Ewan Dunbar (University of Toronto), Alejandrina Cristia (École Normale Supérieure - CNRS), Okko Räsänen (Aalto University – Tampere University), Bertrand Higy (Tilburg University), Marvin Lavechin (École Normale Supérieure), Grzegorz Chrupała (Tilburg University), Afra Alishahi (Tilburg University), Chen Yu (University of Texas at Austin), Maureen de Seyssel (École Normale Supérieure - Inria), Tu Anh Nguyen (École Normale Supérieure - Inria), Mathieu Bernard (École Normale Supérieure - Inria), Nicolas Hamilakis (École Normale Supérieure - Inria), Emmanuel Dupoux (École Normale Supérieure - Inria).
The Zero Resource Speech Challenge is a series that has been running since 2015, which aims to advance research in unsupervised training of speech and dialogue tools, with an application in speech technology for under-resourced languages. This year, we are running an "enhanced" version of the newest challenge task, language modelling from speech. This task asks participants to learn a sequential model that can assign probabilities to sequences---like a typical language model---but which must be trained, and operate, without any text. Assessing and improving on our ability to build such a model is critical to expanding applications such as speech recognition and machine translation to languages without textual resources. The "enhanced" version makes two modifications: it expands the call for submissions to the "high GPU budget" category, encouraging very large models in addition to the smaller, "lower-budget" ones experimented with up to now; and it includes a new, experimental "multi-modal" track, which allows participants to assess the performance of models that include images in training, in addition to audio. Baseline models are already prepared and evaluated for the high-budget and multi-modal settings.
Andrew Gordon Wilson (New York University), Pavel Izmailov (New York University), Matthew D. Hoffman (Google Research), Yarin Gal (University of Oxford), Yingzhen Li (Imperial College London), Melanie F. Pradier (Microsoft Research Cambridge), Sharad Vikram (Google Research), Andrew Foong (University of Cambridge), Sanae Lotfi (New York University), Sebastian Farquhar (University of Oxford).
Understanding the fidelity of approximate inference has extraordinary value beyond the standard approach of measuring generalization on a particular task: if approximate inference is working correctly, then we can expect more reliable and accurate deployment across any number of real-world settings. In this regular competition, we invite the community to evaluate the fidelity of approximate Bayesian inference procedures in deep learning, using as a reference Hamiltonian Monte Carlo (HMC) samples obtained by parallelizing computations over hundreds of tensor processing unit (TPU) devices. We consider a variety of tasks, including image recognition, regression, covariate shift, and medical applications, such as diagnosing diabetic retinopathy. All data are publicly available, and we will release several baselines, including stochastic MCMC, variational methods, and deep ensembles.
Joseph Turian (unaffiliated), Jordie Shier (University of Victoria), Bhiksha Raj (Carnegie Mellon University), Björn W. Schuller (Imperial College London + University of Augsburg), Christian James Steinmetz (Queen Mary University of London), Colin Malloy (University of Victoria), George Tzanetakis (University of Victoria), Gissel Velarde (Universidad Privada Boliviana), Kirk McNally (University of Victoria), Max Henry (McGill University), Nicolas Pinto (Cygni Labs), Yonatan Bisk (Carnegie Mellon University), Gyanendra Das (Indian Institute of Technology (ISM)), Humair Raj Khan (unaffiliated), Camille Noufi (Stanford), Dorien Herremans (Singapore University of Technology and Design), Jesse Engel (Google Brain), Justin Salamon (Adobe Research), Philippe Esling (Institut de Recherche et de Coordination Acoustique/Musique), Pranay Manocha (Princeton), Shinji Watanabe (Carnegie Mellon University), Zeyu Jin (Adobe Research).
Humans can infer a wide range of properties from a perceived sound, such as information about the source (e.g. what generated the sound? where is it coming from?), the information the sound conveys (this is a word that means X, this is a musical note in scale Y), and how it compares to other sounds (these two sounds come/don't come from the same source and are/aren't identical). Can any one learned representation do the same? The aim of this competition is to develop a general-purpose audio representation that provides a meaningful basis for learning in a wide variety of tasks and scenarios. We challenge participants with the following questions: Is it possible to develop a single representation that models all psychoacoustic phenomena? What approach best generalizes to a wide range of downstream audio tasks without fine-tuning? What audio representation allows researchers to formulate and solve novel and societally-valuable problems in simple, repeatable ways? We will evaluate audio representations using a benchmark suite across a variety of domains, including speech, environmental sound, medical audio, and music. In the spirit of shared exchange, all participants must submit an audio embedding model, following a common API, that is general-purpose, open-source, and freely available to use.
Julia Kiseleva (Microsoft Research), Ziming Li (University of Amsterdam), Mohammad Aliannejadi (University of Amsterdam), Maartje ter Hoeve (University of Amsterdam), Mikhail Burtsev (MIPT — Moscow Institute of Physics and Technology), Alexey Skrynnik (MIPT — Moscow Institute of Physics and Technology, Artem Zholus(MIPT — Moscow Institute of Physics and Technology), Aleksandr Panov (MIPT — Moscow Institute of Physics and Technology), Katja Hofmann (Microsoft Research), Kavya Srinet (Facebook AI), Arthur Szlam (Facebook AI), Michel Galley (Microsoft Research), Ahmed Awadallah (Microsoft Research)
Human intelligence has the remarkable ability to quickly adapt to new tasks and environments. Starting from a very young age, humans acquire new skills and learn how to solve new tasks either by imitating the behavior of others or by following provided natural language instructions. To facilitate research in this direction, we propose IGLU: Interactive Grounded Language Understanding in a Collaborative Environment. The primary goal of the competition is to approach the problem of how to build interactive agents that learn to solve a task while provided with grounded natural language instructions in a collaborative environment. Understanding the complexity of the challenge, we split it into sub-tasks to make it feasible for participants.
Matthijs Douze (Facebook AI), Cristian Canton Ferrer (Facebook AI), Zoë Papakipos (Facebook AI), Lowik Chanussot (Facebook AI), Giorgos Tolias (Czech Technical University), Filip Radenovic (Facebook AI), Ondřej Chum (Czech Technical University).
Matching images by similarity consists in identifying the source of an altered image in a large collection of unrelated images. This technology is applied to a range of content moderation domains: misinformation, copyright infringement, scams, etc.
In these domains, it has concrete and real-world impact to protect the integrity of persons engaging in social media. This challenge aims at compiling a dataset focused on image similarity in order to provide a benchmark of efforts from academic researchers and industrial actors. The participants will be provided with a reference collection of one million images and a set of query images. The query images are transformed versions of reference images. The transformations include various types of image edition, collages, and re-encoding. The participants are tasked with finding the source image from the dataset. Baseline methods include all techniques from the instance matching literature (keypoint matching, global descriptor extraction). The anticipated scientific impact is to bring back image similarity detection as an important and challenging task in the computer vision domain and refresh the state of the art. Participants could adopt, for example, recent approaches from self-supervised learning.
Learning By Doing: Controlling a Dynamical System using Control Theory, Reinforcement Learning, or Causality
Sebastian Weichwald* (University of Copenhagen), Niklas Pfister* (University of Copenhagen), Dominik Baumann (RWTH Aachen University), Isabelle Guyon (Université Paris-Saclay, ChaLearn), Oliver Kroemer (Carnegie Mellon University), Timothy Lee (Carnegie Mellon University), Søren Wengel Mogensen (Lund University), Jonas Peters (University of Copenhagen), Sebastian Trimpe (RWTH Aachen University).
Control theory, reinforcement learning, and causality are all ways of mathematically describing how the world changes when we interact with it. Each field offers a different perspective with its own strengths and weaknesses. In this competition, we aim to bring together researchers from all three fields to encourage cross-disciplinary discussions. The competition is constructed to readily fit into the mathematical frameworks of all three fields and participants of any background are encouraged to participate. We designed two tracks that consider a dynamical system for which participants need to find controls/policies to optimally interact with a target process: an open loop/bandit track and a closed loop/online RL track.
Simon Bowly (Monash University), Chris Cameron (University of British Columbia), Quentin Cappart (Polytechnique Montréal), Jonas Charfreitag (University of Bonn), Laurent Charlin (HEC Montréal), Didier Chételat (Polytechnique Montréal), Justin Dumouchelle (Polytechnique Montréal), Maxime Gasse (Polytechnique Montréal), Ambros Gleixner (Zuse Institute Berlin), Aleksandr M. Kazachkov (University of Florida), Elias B. Khalil (University of Toronto), Pawel Lichocki (Google), Andrea Lodi (Polytechnique Montréal), Miles Lubin (Google), Chris J. Maddison (University of Toronto), Christopher Morris (Polytechnique Montréal), Augustin Parjadis (Polytechnique Montréal), Dimitri J. Papageorgiou (ExxonMobil), Sebastian Pokutta (Zuse Institute Berlin), Antoine Prouvost (Polytechnique Montréal), Lara Scavuzzo (TU Delft), Giulia Zarpellon (University of Toronto).
The Machine Learning for Combinatorial Optimization (ML4CO) competition aims at improving a state-of-the-art mathematical solver by replacing key heuristic components with machine learning models trained on historical data. To that end participants will compete on the three following challenges, each corresponding to a distinct control task arising in a branch-and-bound solver: producing good solutions (primal task), proving optimality via branching (dual task), and choosing the best solver parameters (configuration task). Each task is exposed through an OpenAI-gym Python API build on top of the open-source solver SCIP, using the Ecole library. Participants can compete in any subset of the proposed challenges. While we encourage solutions derived from the reinforcement learning paradigm, any algorithmic solution respecting the competition's API is accepted.
Daniel Suo (Princeton University), Naman Agarwal (Google), Xinyi Chen (Princeton University; Google), Udaya Ghai (Princeton University), Paula Gradu (Princeton University, Google AI Princeton), Edgar Minasyan (Princeton University), Karan Singh (Princeton University), Cyril Zhang (Microsoft Research), Elad Hazan (Princeton University and Google AI Princeton).
We consider the problem of controlling an invasive mechanical ventilator for pressure-controlled ventilation: a controller must let air in and out of a sedated patient’s lungs according to a trajectory of airway pressures specified by a clinician.
Hand-tuned PID controllers and similar variants have comprised the industry standard for decades, yet can behave poorly by over- or under-shooting their target or oscillating rapidly. In this competition, we have designed two tracks for a data-driven machine-learning approach: 1) train a model that simulates a ventilator-artificial lung system (the physical system) using data collected from the real system and 2) train a controller to control the real system.
In a first software-only phase, we will be providing inputs and sensor readings along with pre-trained simulators. In the second phase, participants will have regulated remote access to the physical system and will collect their own data. We have provided two baselines here. A state-of-art result from this competition represents a strong candidate for further testing in commercial ventilators and more sophisticated artificial lungs.
Adrian El Baz (ChaLearn, USA), Isabelle Guyon (ISN/INRIA/CNRS, Université Paris-Saclay, France, and ChaLearn, USA), Zhengying Liu (LISN/INRIA/CNRS, Université Paris-Saclay, France), Jan N. van Rijn (Leiden University, the Netherlands), Haozhe Sun (LISN/INRIACNRS, Université Paris-Saclay, France), Sebastien Treguer (ISN/INRIA/CNRS, Université Paris-Saclay, France, and ChaLearn, USA), Wei-Wei Tu (4Paradigm Inc., China and ChaLearn, USA), Ihsan Ullah (Université Paris-Saclay, France), Joaquin Vanschoren (TU Eindhoven, the Netherlands)
Meta-learning is an important machine learning paradigm leveraging experience from previous tasks to make better predictions on the task at hand. This competition focuses on supervised learning, and more particularly `few shot learning' classification settings, aiming at learning a good model from very few examples, typically 1 to 5 per class. A starting kit will be provided, consisting of a public dataset and various baseline implementations, including MAML (Finn et al., 2017) and Prototypical Networks (Snell et al., 2017). This way, it should be easy to get started and build upon the various resources in the field.
The competition consists of novel datasets from various domains, including healthcare, ecology, biology, and chemistry. The competition will consist of three phases: a public phase, a feedback phase, and a final phase. The last two phases will be run with code submissions, fully bind-tested on the Codalab challenge platform. A single (final) submission will be evaluated during the final phase, using five fresh datasets, currently unknown to the meta-learning community.
Daniel Burkhardt (Cellarity), Smita Krishnaswamy (Yale University), Malte Luecken (Helmholtz Zentrum München), Debora Marks (Harvard Medical School), Angela Pisco (Chan Zuckerberg Biohub), Bastian Rieck (ETH Zürich), Jian Tang (HEC Montreal), Fabian Theis (Helmholtz Zentrum München), Alexander Tong (Yale University), and Guy Wolf (Université de Montréal).
Scaling from a dozen cells a decade ago to millions of cells today, single-cell measurement technologies are driving a revolution in the life sciences. Recent advances make it possible to measure multiple high-dimensional modalities (e.g. DNA accessibility, RNA, and proteins) simultaneously in the same cell. This data provides, for the first time, a direct and comprehensive view into the layers of gene regulation that drive biological diversity and disease. In this competition, we present three critical tasks on multimodal single-cell data using public datasets and a first-of-its-kind multi-omics benchmarking dataset. Teams will predict one modality from another and learn representations of multiple modalities measured in the same cells. Progress will elucidate how a common genetic blueprint gives rise to distinct cell types and processes, as a foundation for improving human health.
Abhishek Das (Facebook AI Research), Muhammed Shuaibi (Carnegie Mellon University), Siddharth Goyal (Facebook AI Research), Adeesh Kolluru (Carnegie Mellon University), Janice Lan (Facebook AI Research), Aini Palizhati (Carnegie Mellon University), Anuroop Sriram (Facebook AI Research), Brandon Wood (National Energy Research Scientific Computing Center), Aditya Grover (Facebook AI Research), Devi Parikh (Facebook AI Research, Georgia Tech), Zachary Ulissi (Carnegie Mellon University), C. Lawrence Zitnick (Facebook AI Research).
Advancements to renewable energy processes are urgently needed to address climate change and energy scarcity around the world. Many of these processes, including the generation of electricity through fuel cells or fuel generation from renewable resources are driven through chemical reactions. The design of new catalysts for enabling new and more efficient reactions is a critical bottleneck in developing cost-effective solutions. Unfortunately, the discovery of new catalyst materials is limited due to the high cost of computational atomic simulations and experimental studies. Machine learning has the potential to significantly reduce the cost of computational simulations by orders of magnitude. By filtering potential catalyst materials based on these simulations, candidates of higher promise may be selected for experimental testing and the rate at which new catalysts are discovered could be greatly increased.
The Open Catalyst Challenge invites participants to submit results of machine learning models that simulate the interaction of a molecule on a catalyst's surface. ML models may either directly predict the relaxed state atomic configuration of the entire molecule + catalyst system, or iteratively predict and integrate per-atom forces to simulate how atoms will move around starting from an arbitrary initial state. By predicting this interaction accurately, the catalyst's impact on the overall rate of a chemical reaction may be estimated; a key factor in filtering potential catalysis materials and addressing the world’s energy needs.
The Open Catalyst Project is a collaborative research effort between Facebook AI Research (FAIR) and Carnegie Mellon University’s (CMU) Department of Chemical Engineering. The aim is to use AI to model and discover new catalysts for use in renewable energy storage to help in addressing climate change.
Stefan Bauer, (MPI for Intelligent Systems), Joel Akpo (MPI for Intelligent Systems), Manuel Wüthrich (RR-Learning), Rosemary Nan Ke (MILA, Deepmind), Anirudh Goyal (MILA), Thomas Steinbrenner (MPI for Intelligent Systems), Felix Widmaier (MPI for Intelligent Systems), Annika Buchholz (MPI for Intelligent Systems), Bernhard Schölkopf (MPI for Intelligent Systems), Dieter Büchler (MPI for Intelligent Systems), Ludovic Righetti (NYU), Franziska Meier (Facebook).
Despite recent successes of reinforcement learning (RL) in simulated environments, deploying or training algorithms in the real-world remains a challenge due to the significant cost of experimentation and limited datasets. While insights gained in simulation do not necessarily translate to real robots, we aim to close the gap between simulation and the real-world by offering participants the opportunity to submit their algorithm to a robotics benchmark in the cloud. This will allow teams to gather hundreds of hours of real robot data with minimal effort and submission to our cloud benchmark is as easy as using a simulator. Simulators, easy to use interfaces and large real-world datasets for pretraining are available. Show that your algorithm is practical by solving the tasks on different levels in the real-world and win prizes!
Ryan W. Gardner (Johns Hopkins University Applied Physics Laboratory - JHU/APL), Gino Perrotta, Corey Lowman (JHU/APL), Casey Richardson (JHU/APL), Andrew Newman (JHU/APL), Jared Markowitz (JHU/APL), Nathan Drenkow (JHU/APL), Barton Paulhamus (JHU/APL), Ashley J. Llorens (Microsoft Research), Todd W. Neller (Gettysburg College) Raman Arora (Johns Hopkins University), Bo Li (University of Illinois), Mykel J. Kochenderfer (Stanford University).
Reconnaissance Blind Chess is like chess except a player cannot see her opponent's pieces in general. Rather, each player chooses a 3x3 square of the board to privately observe each turn. Algorithms used to create agents for previous games like chess, Go, and poker break down in Reconnaissance Blind Chess for several reasons including the imperfect information, absence of obvious abstractions, and lack of common knowledge. In addition to this NeurIPS competition, the game is recently part of the new Hidden Information Games Competition (HIGC) that is organized with the AAAI Reinforcement Learning in Games workshop (2022). Build the best bot for this challenge in making strong decisions in multi-agent scenarios in the face of uncertainty.
Andrey Malinin (Yandex, HSE), Neil Band (University of Oxford), German Chesnokov (Yandex), Yarin Gal (University of Oxford, Alan Turing Institute), Alexander Ganshin (Yandex), Mark J. F. Gales (University of Cambridge), Alexey Noskov (Yandex), Andrey Ploskonosov (Yandex), Liudmila Prokhorenkova (Yandex, HSE, MIPT), Mariya Shmatova (Yandex), Vyas Raina (University of Cambridge), Vatsal Raina (University of Cambridge), Denis Roginskii (Yandex), Panos Tigas (University of Oxford), Boris Yangel (Yandex).
Mismatch between training and deployment data, known as distributional shift, adversely impacts ML models and is ubiquitous in real, industrial applications. In this competition the contestants’ goal is to develop models which are both robust to distributional shift and can detect it via uncertainty estimation. The broad aim of this competition is to raise awareness of the issue and stimulate the community to work on tasks and modalities taken from large-scale industrial applications. Thus, we provide the "Shifts Dataset" - a new, large dataset of genuine `in the wild' examples of distributional shift from weather prediction, machine translation, and vehicle motion prediction. Each task represents a particular data-modality and is uniquely challenging. Each task will have an associated competition track with prizes for top contestants.
Andrea Censi (ETH Zurich), Liam Paull (University of Montreal), Jacopo Tan (ETH Zurich), Emilio Frazzoli (ETH Zurich), Holger Caesar (Motional), Matthew R. Walter (TTIC), Andrea F. Daniele (TTIC), Sahika Genc (Amazon), Sharada Mohanty (AICrowd).
The AI Driving Olympics (AI-DO) is a series of embodied intelligence competitions in the field of autonomous vehicles. The overall objective of AI-DO is to provide accessible mechanisms for benchmarking progress in autonomy applied to the task of autonomous driving.
Eric Hambro (Facebook AI Research); Sharada Mohanty (AICrowd); Dipam Chakrabroty (AIcrowd); Edward Grefenstette (Facebook AI Research); Minqi Jiang (Facebook AI Research & University College London); Robert Kirk (University College London); Vitaly Kurin (University of Oxford); Heinrich Küttler (Facebook AI Research); Vegard Mella (Facebook); Nantas Nardelli (University of Oxford); Jack Parker-Holder (University of Oxford); Roberta Raileanu (NYU); Tim Rocktäschel (Facebook AI Research & University College London); Danielle Rothermel (Facebook); Mikayel Samvelyan (University College London & Facebook AI Research).
The NetHack Challenge is based on the NetHack Learning Environment (NLE), where teams will compete to build the best agents to play the game of NetHack. NetHack is a ASCII-rendered single-player dungeon crawl game that is one of the oldest and most difficult computer games in history. NetHack is procedurally-generated, with hundreds of different entities and complex environment dynamics, presenting an extremely challenging environment for both current state-of-the-art RL agents and humans, while crucially being lightning-fast to simulate. We are excited that this competition offers machine learning students, researchers and NetHack-bot builders the opportunity to participate in a grand challenge in AI without prohibitive computational costs—and we are eagerly looking forward to the wide variety of submissions.
Xiaoxi Wei (Imperial College London); Vinay Jayaram (Facebook Reality Labs); Sylvain Chevallier (University of Versailles); Giulia Luise (Imperial College London); Camille Jeunet (University of Bordeaux); Moritz Grosse-Wentrup (University of Vienna): Alexandre Gramfort (INRIA & Université Paris-Saclay); A. Aldo Faisal (Imperial College London).
The Benchmarks for EEG Transfer Learning (BEETL) is a competition that aims to stimulate the development of transfer and meta-learning algorithms applied to a prime example of what makes the use of biosignal data hard, EEG data. BEETL acts as a much-needed benchmark for domain adaptation algorithms in EEG decoding and provides a real-world stimulus goal for transfer learning and meta-learning developments for both academia and industry. Given the multitude of different EEG-based algorithms that exist, we offer two specific challenges: Task 1 is a cross-subject sleep stage decoding challenge reflecting the need for transfer learning in clinical diagnostics, and Task 2 is a cross-dataset motor imagery decoding challenge reflecting the need for transfer learning in human interfacing.
Traffic4cast 2021 – Temporal and Spatial Few-Shot Transfer Learning in Traffic Map Movie Forecasting
Moritz Neun (HERE Technologies, IARAI - Institute of Advanced Research in Artificial Intelligence Vienna (Austria)), Christian Eichenberger (IARAI), Henry Martin (ETH Zürich (Switzerland), IARAI), Pedro Herruzo (Polytechnic University of Catalonia (Spain), IARAI), David Jonietz (HERE Technologies), Daniel Springer (IARAI), Markus Spanring (IARAI), Avi Avidan (IARAI), Luis Ferro (IARAI), Fei Tang (HERE Technologies), Ali Soleymani (HERE Technologies), Rohit Gupta (HERE Technologies), Bo Xu (HERE Technologies), Kevin Malm, (HERE Technologies), Aleksandra Gruca (Silesian University of Technology Warsaw (Poland), IARAI), Johannes Brandstetter (The Amsterdam Machine Learning Lab (AMLab), Johannes Kepler University Linz (Austria), IARAI), Michael Kopp (HERE Technologies, IARAI), David P. Kreil (IARAI), Sepp Hochreiter (Johannes Kepler University Linz (Austria), IARAI).
Traffic is said to follow `hidden rules' that can be transferred across domain shifts. Our competition sets out to explore this meta topic with two few-shot learning tasks: predictions across a temporal shift brought about by COVID-19 and across a spatio-temporal shift in hitherto unseen cities. We provide an unprecedented, large data set from 1012 real world GPS probes in 10 cities binned in space and time into multi-channel movie frames, as well as static data on the basic road connections of the underlying road network. Thus participants can approach these transfer tasks using graph based approaches encoding knowledge about the road network or approaches from computer vision like U-nets, which were highly successful in our previous competitions. Any advance in these questions will have a large impact on smart city planning, on mobility in general and thus, ultimately, our way of living more sustainably.
Kate Saenko (BU & MIT-IBM Watson AI), Kuniaki Saito (BU), Donghyun Kim (BU), Samarth Mishra (BU), Ben Usman (BU), Piotr Teterwak (BU), Dina Bashkirova (BU), Dan Hendrycks (UC Berkeley).
Progress in machine learning is typically measured by training and testing a model on the same distribution of data, i.e., the same domain. However, in real world applications, models often encounter out-of-distribution data. The VisDA21 competition invites methods that can adapt to novel test distributions and handle distributional shifts. Our task is object classification, but we measure accuracy on novel domains, rather than the traditional in-domain benchmarking. Teams will be given labeled source data and unlabeled target data from a different distribution (such as novel viewpoints, backgrounds, image quality). In addition, the target data may have missing and/or novel classes. Successful approaches will improve classification accuracy of known categories on target-domain data while learning to deal with missing and/or unknown categories.
Yingshan Chang (LTI@CMU), Yonatan Bisk (LTI@CMU), Mridu Narang (Microsoft), Jared Fernandez (LTI@CMU), Levi Melnick (Microsoft), Guihong Cao (Microsoft), Hisami Suzuki (Microsoft), Jianfeng Gao (Microsoft)
WebQA is a new benchmark for multimodal multihop reasoning in which systems are presented with the same style of data as humans when searching the web: snippets and images. Upon seeing a question, the system must identify which candidates potentially inform the answer from a candidate pool. Then the system is expected to aggregate information from selected candidates with reasoning to generate an answer in natural language form. Each datum is a question paired with a series of potentially long snippets or images that serve as "knowledge carriers" over which to reason. Systems will be evaluated on both supporting fact retrieval and answer generation to measure correctness and interpretability. To demonstrate multihop multimodal reasoning ability, models should be able to 1) understand and represent knowledge from different modalities, 2) identify and aggregate relevant knowledge fragments scattered across multiple sources, 3) make inference and do natural language generation.
We are very grateful to the colleagues that helped us reviewing and selecting the competition proposals for this year:
Alexander I. Rudnicky (Carnegie Mellon University)
Antoine Marot (RTE France)
Aravind Mohan (Facebook)
Bogdan Emanuel Ionescu (University Politehnica of Bucharest)
Candace Ross (Massachusetts Institute of Technology)
Cecile Germain (Université Paris Sud)
Chiara Plizzari (Politecnico di Torino)
David Rousseau (IJCLab-Orsay)
Emilio Cartoni (Institute of Cognitive Sciences and Technologies )
Ethan Perez (New York University)
Evelyne Viegas (Microsoft Research)
Gino Perrotta (The George Washington University)
Gregory Clark (Google)
Hamed Firooz (Facebook)
Heather Gray (Lawrence Berkeley National Lab)
Hsueh-Cheng (Nick) Wang (National Chiao Tung University)
Hugo Jair Escalante (INAOE)
Isabelle Guyon (CNRS, INRIA, University Paris-Saclay and ChaLearn)
Jakob Foerster (University of Toronto)
Jared Markowitz (Johns Hopkins University Applied Physics Laboratory)
jean-roch vlimant (California Institute of Technology)
Jochen Triesch (Frankfurt Institute for Advanced Studies)
José Hernández-Orallo (Universitat Politècnica de València)
Julian Zilly (ETH Zürich)
Kurt Shuster (Facebook)
Lino A Rodriguez Coayahuitl (INAOE)
Marco Cannici (Politecnico di Milano)
Marco Gallieri (NNAISENSE)
Mark Jordan (SRC Technologies)
Matthew Crosby (Imperial College London)
Matthias Bruhns (University of Tübingen)
Michael Noukhovitch (Mila, Universite de Montreal)
Mikhail Burtsev (MIPT)
Mikhail Hushchyn (NRU HSE)
Nicholay Topin (Machine Learning Department, Carnegie Mellon University)
Noboru Kuno (Microsoft Research)
Odd Erik Gundersen (Norwegian University of Science and Technology)
Oliver Bent (IBM Research)
Robert Perrotta (Independent)
Ryan W Gardner (Johns Hopkins University Applied Physics Laboratory)
Sai Vemprala (Microsoft)
Sekou L Remy (IBM Research)
Sergio Escalera (Computer Vision Center (UAB) & University of Barcelona)
Sewon Min (University of Washington)
Sharada Mohanty (AICrowd)
Stephanie Milani (Carnegie Mellon University)
Tathagata Chakraborti (IBM Research AI)
Tim Taubner (ETH)
Timothy Highley (La Salle University)
Tom Kwiatkowski (Google)
Valentin Malykh (MIPT)
Wei Zhan (University of California, Berkeley)
Zhen Xu (4Paradigm)
Zhengying Liu (Inria)