Publications

Impact of a vaccine passport on first-dose COVID-19 vaccine coverage by age and area-level social determinants in the Canadian provinces of Quebec and Ontario: an interrupted time series analysis
Jorge Luis Flores Anato
Huiting Ma
M. Hamilton
Yiqing Xia
Sam Harper
Marc Brisson
Michael P. Hillmer
Kamil A. Malikov
Aidin Kerem
Reed Beall
S. Baral
Ève Dubé
Sharmistha Mishra
Mathieu Maheu-Giroux
Background: In Canada, all provinces implemented vaccine passports in 2021 to increase vaccine uptake and reduce transmission in non-essenti… (see more)al indoor spaces. We evaluate the impact of vaccine passport policies on first-dose COVID-19 vaccination coverage by age, area-level income and proportion racialized. Methods: We performed interrupted time-series analyses using vaccine registry data linked to census information in Quebec and Ontario (20.5 million people [≥]12 years; unit of analysis: dissemination area). We fit negative binomial regressions to weekly first-dose vaccination, using a natural spline to capture pre-announcement trends, adjusting for baseline vaccination coverage (start: July 3rd; end: October 23rd Quebec, November 13th Ontario). We obtain counterfactual vaccination rates and coverage, and estimated vaccine passports' impact on vaccination coverage (absolute) and new vaccinations (relative). Results: In both provinces, pre-announcement first-dose vaccination coverage was 82% ([≥]12 years). The announcement resulted in estimated increases in vaccination coverage of 0.9 percentage points (p.p.;95% CI: 0.4-1.2) in Quebec and 0.7 p.p. (95% CI: 0.5-0.8) in Ontario. In relative terms, these increases correspond to 23% (95% CI: 10-36%) and 19% (95% CI: 15-22%) more vaccinations. The impact was larger among people aged 12-39 (1-2 p.p.). There was little variability in the absolute impact by area-level income or proportion racialized in either province. Conclusions: In the context of high baseline vaccine coverage across two provinces, the announcement of vaccine passports led to a small impact on first-dose coverage, with little impact on reducing economic and racial inequities in vaccine coverage. Findings suggest the need for other policies to further increase vaccination coverage among lower-income and more racialized neighbourhoods and communities.
Intra-host viral populations of SARS-CoV-2 in immunosuppressed patients with hematologic cancers
Dominique Fournelle
Fatima Mostefai
Elsa Brunet-Ratnasingham
Raphael Poujol
Jean-Christophe Grenier
José Héctor Gálvez
Amélie Pagliuzza
Inès Levade
Sandrine Moreira
Simon Grandjean Lapierre
Nicolas Chomont
Daniel E. Kaufmann
Morgan Craig
Throughout the SARS-CoV-2 pandemic, several variants of concern (VOC) have been identified, many of which share recurrent mutations in the s… (see more)pike protein’s receptor binding domain (RBD). This region coincides with known epitopes and can therefore have an impact on immune escape. Protracted infections in immunosuppressed patients have been hypothesized to lead to an enrichment of such mutations and therefore drive evolution towards VOCs. Here, we show that immunosuppressed patients with hematologic cancers develop distinct populations with immune escape mutations throughout the course of their infection. Notably, by investigating the co-occurrence of substitutions on individual sequencing reads in the RBD, we found quasispecies harboring mutations that confer resistance to known monoclonal antibodies (mAbs) such as S:E484K and S:E484A. Furthermore, we provide the first evidence for a viral reservoir based on intra-host phylogenetics. Our results on viral reservoirs can shed light on protracted infections interspersed with periods where the virus is undetectable as well as an alternative explanation for some long-COVID cases. Our findings also highlight that protracted infections should be treated with combination therapies rather than by a single mAbs to clear pre-existing resistant mutations.
The Paradox of Choice: On the Role of Attention in Hierarchical Reinforcement Learning
Andrei Cristian Nica
Decision-making AI agents are often faced with two important challenges: the depth of the planning horizon, and the branching factor due to … (see more)having many choices. Hierarchical reinforcement learning methods aim to solve the first problem, by providing shortcuts that skip over multiple time steps. To cope with the breadth, it is desirable to restrict the agent's attention at each step to a reasonable number of possible choices. The concept of affordances (Gibson, 1977) suggests that only certain actions are feasible in certain states. In this work, we first characterize "affordances" as a "hard" attention mechanism that strictly limits the available choices of temporally extended options. We then investigate the role of hard versus soft attention in training data collection, abstract value learning in long-horizon tasks, and handling a growing number of choices. To this end, we present an online, model-free algorithm to learn affordances that can be used to further learn subgoal options. Finally, we identify and empirically demonstrate the settings in which the "paradox of choice" arises, i.e. when having fewer but more meaningful choices improves the learning speed and performance of a reinforcement learning agent.
Timeliness of reporting of SARS-CoV-2 seroprevalence results and their utility for infectious disease surveillance
Claire Donnici
Natasha Ilincic
Christian Cao
Caseng Zhang
Gabriel Deveaux
David A. Clifton
Niklas Bobrovitz
Rahul K. Arora
Author Correction: Gradient-based learning drives robust representations in recurrent neural networks by balancing compression and expansion
Maxwell J. Farrell
Stefano Recanatesi
Timothy Moore
Eric Todd SheaBrown
Causal inference from text: A commentary
David Blei
Aligning MAGMA by Few-Shot Learning and Finetuning
Jean-Charles Layoun
Alexis Roger
Adapting Triplet Importance of Implicit Feedback for Personalized Recommendation
Haolun Wu
Chen Ma
Yingxue Zhang
Ruiming Tang
Lifelong Online Learning from Accumulated Knowledge
Changjian Shui
William Wang
Ihsen Hedhli
Chi Man Wong
Feng Wan
Boyu Wang
In this article, we formulate lifelong learning as an online transfer learning procedure over consecutive tasks, where learning a given task… (see more) depends on the accumulated knowledge. We propose a novel theoretical principled framework, lifelong online learning, where the learning process for each task is in an incremental manner. Specifically, our framework is composed of two-level predictions: the prediction information that is solely from the current task; and the prediction from the knowledge base by previous tasks. Moreover, this article tackled several fundamental challenges: arbitrary or even non-stationary task generation process, an unknown number of instances in each task, and constructing an efficient accumulated knowledge base. Notably, we provide a provable bound of the proposed algorithm, which offers insights on the how the accumulated knowledge improves the predictions. Finally, empirical evaluations on both synthetic and real datasets validate the effectiveness of the proposed algorithm.
OptEmbed: Learning Optimal Embedding Table for Click-through Rate Prediction
Fuyuan Lyu
Xing Tang
Hong Zhu
Huifeng Guo
Yingxue Zhang
Ruiming Tang
Click-through rate (CTR) prediction model usually consists of three components: embedding table, feature interaction layer, and classifier. … (see more)Learning embedding table plays a fundamental role in CTR prediction from the view of the model performance and memory usage. The embedding table is a two-dimensional tensor, with its axes indicating the number of feature values and the embedding dimension, respectively. To learn an efficient and effective embedding table, recent works either assign various embedding dimensions for feature fields and reduce the number of embeddings respectively or mask the embedding table parameters. However, all these existing works cannot get an optimal embedding table. On the one hand, various embedding dimensions still require a large amount of memory due to the vast number of features in the dataset. On the other hand, decreasing the number of embeddings usually suffers from performance degradation, which is intolerable in CTR prediction. Finally, pruning embedding parameters will lead to a sparse embedding table, which is hard to be deployed. To this end, we propose an optimal embedding table learning framework OptEmbed, which provides a practical and general method to find an optimal embedding table for various base CTR models. Specifically, we propose pruning the redundant embeddings regarding corresponding features' importance by learnable pruning thresholds. Furthermore, we consider assigning various embedding dimensions as one single candidate architecture. To efficiently search the optimal embedding dimensions, we design a uniform embedding dimension sampling scheme to equally train all candidate architectures, meaning architecture-related parameters and learnable thresholds are trained simultaneously in one supernet. We then propose an evolution search method based on the supernet to find the optimal embedding dimensions for each field. Experiments on public datasets show that OptEmbed can learn a compact embedding table which can further improve the model performance.
Inductive biases for deep learning of higher-level cognition
Anirudh Goyal
Lookback for Learning to Branch
Prateek Gupta
Elias Boutros Khalil
Didier Chételat
M. Pawan Kumar