Publications

The need for privacy with public digital contact tracing during the COVID-19 pandemic
Richard Janda
Yun William Yu
Daphne Ippolito
Max Jarvie
Dan Pilat
Brooke Struck
Sekoul Krastev
Abhinav Sharma
Training End-to-End Analog Neural Networks with Equilibrium Propagation
Jack D. Kendall
Ross D. Pantone
Kalpana Manickavasagam
We introduce a principled method to train end-to-end analog neural networks by stochastic gradient descent. In these analog neural networks,… (voir plus) the weights to be adjusted are implemented by the conductances of programmable resistive devices such as memristors [Chua, 1971], and the nonlinear transfer functions (or `activation functions') are implemented by nonlinear components such as diodes. We show mathematically that a class of analog neural networks (called nonlinear resistive networks) are energy-based models: they possess an energy function as a consequence of Kirchhoff's laws governing electrical circuits. This property enables us to train them using the Equilibrium Propagation framework [Scellier and Bengio, 2017]. Our update rule for each conductance, which is local and relies solely on the voltage drop across the corresponding resistor, is shown to compute the gradient of the loss function. Our numerical simulations, which use the SPICE-based Spectre simulation framework to simulate the dynamics of electrical circuits, demonstrate training on the MNIST classification task, performing comparably or better than equivalent-size software-based neural networks. Our work can guide the development of a new generation of ultra-fast, compact and low-power neural networks supporting on-chip learning.
Multi-Image Super-Resolution for Remote Sensing using Deep Recurrent Networks
Md Rifat Arefin
Pierre-Luc St-Charles
Alfredo Kalaitzis
Sookyung Kim
Samira E. Kahou
High-resolution satellite imagery is critical for various earth observation applications related to environment monitoring, geoscience, fore… (voir plus)casting, and land use analysis. However, the acquisition cost of such high-quality imagery due to the scarcity of providers and needs for high-frequency revisits restricts its accessibility in many fields. In this work, we present a data-driven, multi-image super resolution approach to alleviate these problems. Our approach is based on an end-to-end deep neural network that consists of an encoder, a fusion module, and a decoder. The encoder extracts co-registered highly efficient feature representations from low-resolution images of a scene. A Gated Re-current Unit (GRU)-based module acts as the fusion module, aggregating features into a combined representation. Finally, a decoder reconstructs the super-resolved image. The proposed model is evaluated on the PROBA-V dataset released in a recent competition held by the European Space Agency. Our results show that it performs among the top contenders and offers a new practical solution for real-world applications.
Population variability in social brain morphology for social support, household size and friendship satisfaction
Arezoo Taebi
Hannah Kiesow
Kai Vogeley
Leonhard Schilbach
Boris C. Bernhardt
The social brain hypothesis proposes that the complexity of human brains has coevolved with increasing complexity of social interactions in … (voir plus)primate societies. The present study explored the possible relationships between brain morphology and the richness of more intimate ‘inner’ and wider ‘outer’ social circles by integrating Bayesian hierarchical modeling with a large cohort sample from the UK Biobank resource (n = 10 000). In this way, we examined population volume effects in 36 regions of the ‘social brain’, ranging from lower sensory to higher associative cortices. We observed strong volume effects in the visual sensory network for the group of individuals with satisfying friendships. Further, the limbic network displayed several brain regions with substantial volume variations in individuals with a lack of social support. Our population neuroscience approach thus showed that distinct networks of the social brain show different patterns of volume variations linked to the examined social indices.
Restless bandits: indexability and computation of Whittle index
Restless bandits are a class of sequential resource allocation problems concerned with allocating one or more resources among several altern… (voir plus)ative processes where the evolution of the process depends on the resource allocated to them. Such models capture the fundamental trade-offs between exploration and exploitation. In 1988, Whittle developed an index heuristic for restless bandit problems which has emerged as a popular solution approach due to its simplicity and strong empirical performance. The Whittle index heuristic is applicable if the model satisfies a technical condition known as indexability. In this paper, we present two general sufficient conditions for indexability and identify simpler to verify refinements of these conditions. We then present a general algorithm to compute Whittle index for indexable restless bandits. Finally, we present a detailed numerical study which affirms the strong performance of the Whittle index heuristic.
GIANT: Scalable Creation of a Web-scale Ontology
Weidong Guo
Di Niu
Jinwen Luo
Chaoyue Wang
Zhen Wen
Yu Xu
Current works and future directions on application of machine learning in primary care
S. A. Rahimi
Vera Granikov
Pierre Pluye
In this short paper, we explained current machine learning works in primary care based on a scoping review that we performed. The performed … (voir plus)review was in line with the methodological framework proposed by Colquhoun and colleagues. Lastly, we discussed our observations and gave important directions to the future studies in this fast-growing area.
Minimisation in Logical Form
Nick Bezhanishvili
Marcello M. Bonsangue
Helle Hvid Hansen
Dexter Kozen
C. Kupke
Alexandra Silva
Failure to follow medication changes made at hospital discharge is associated with adverse events in 30 days
Daniala L. Weir
Aude Motulsky
Michal Abrahamowicz
Todd C. Lee
Steven Morgan
David L. Buckeridge
Robyn Tamblyn
To evaluate the hypothesis that nonadherence to medication changes made at hospital discharge is associated with an increased risk of advers… (voir plus)e events in the 30 days postdischarge. Patients admitted to hospitals in Montreal, Quebec, between 2014 and 2016. Prospective cohort study. Nonadherence to medication changes was measured by comparing medications dispensed in the community with those prescribed at hospital discharge. Patient, health system, and drug regimen‐level covariates were measured using medical services and pharmacy claims data as well as data abstracted from the patient's hospital chart. Multivariable Cox models were used to determine the association between nonadherence to medication changes and the risk of adverse events. Among 2655 patients who met our inclusion criteria, mean age was 69.5 years (SD 14.7) and 1581 (60%) were males. Almost half of patients (n = 1161, 44%) were nonadherent to at least one medication change, and 860 (32%) were readmitted to hospital, visited the emergency department, or died in the 30 days postdischarge. Patients who were not adherent to any of their medication changes had a 35% higher risk of adverse events compared to those who were adherent to all medication changes (1.41 vs 1.27 events/100 person‐days, adjusted hazard ratio: 1.35, 95% CI: 1.06‐1.71). Almost half of all patients were not adherent to some or all changes made to their medications at hospital discharge. Nonadherence to all changes was associated with an increased risk of adverse events. Interventions addressing barriers to adherence should be considered moving forward.
Evaluating White Matter Lesion Segmentations with Refined Sørensen-Dice Analysis
Aaron Carass
Snehashis Roy
Adrian Gherman
Jacob C. Reinhold
Andrew Jesson
Oskar Maier
Heinz Handels
Mohsen Ghafoorian
Bram Platel
Ariel Birenbaum
Hayit Greenspan
Dzung L. Pham
Ciprian M. Crainiceanu
Peter A. Calabresi
Jerry L. Prince
William R. Gray Roncal
Russell T. Shinohara
Ipek Oguz
Depth Prediction for Monocular Direct Visual Odometry
Ran Cheng
Christopher Agia
Depth prediction from monocular images with deep CNNs is a topic of increasing interest to the community. Advances have lead to models capab… (voir plus)le of predicting disparity maps with consistent scale, which are an acceptable prior for gradient-based direct methods. With this in consideration, we exploit depth prediction as a candidate prior for the coarse initialization, tracking, and marginalization steps of the direct visual odometry system, enabling the second-order optimizer to converge faster into a precise global minimum. In addition, the given depth prior supports large baseline stereo scenarios, maintaining robust pose estimations against challenging motion states such as in-place rotation. We further refine our pose estimation with semi-online loop closure. The experiments on KITTI demonstrate that our proposed method achieves state- of-the-art performance compared to both traditional direct visual odometry and learning-based counterparts.
Story Forest
Fred X. Han
Di Niu
Linglong Kong
Kunfeng Lai
Yu Xu
Extracting events accurately from vast news corpora and organize events logically is critical for news apps and search engines, which aim to… (voir plus) organize news information collected from the Internet and present it to users in the most sensible forms. Intuitively speaking, an event is a group of news documents that report the same news incident possibly in different ways. In this article, we describe our experience of implementing a news content organization system at Tencent to discover events from vast streams of breaking news and to evolve news story structures in an online fashion. Our real-world system faces unique challenges in contrast to previous studies on topic detection and tracking (TDT) and event timeline or graph generation, in that we (1) need to accurately and quickly extract distinguishable events from massive streams of long text documents, and (2) must develop the structures of event stories in an online manner, in order to guarantee a consistent user viewing experience. In solving these challenges, we propose Story Forest, a set of online schemes that automatically clusters streaming documents into events, while connecting related events in growing trees to tell evolving stories. A core novelty of our Story Forest system is EventX, a semi-supervised scheme to extract events from massive Internet news corpora. EventX relies on a two-layered, graph-based clustering procedure to group documents into fine-grained events. We conducted extensive evaluations based on (1) 60 GB of real-world Chinese news data, (2) a large Chinese Internet news dataset that contains 11,748 news articles with truth event labels, and (3) the 20 News Groups English dataset, through detailed pilot user experience studies. The results demonstrate the superior capabilities of Story Forest to accurately identify events and organize news text into a logical structure that is appealing to human readers.