Publications

Technologically-assisted communication attenuates inter-brain synchrony
Linoy Schwartz
Jonathan Levy
Yaara Endevelt-Shapira
Amir Djalovski
Olga Hayut
Guillaume Dumas
Ruth Pinkenson Feldman
2022-06-06
NeuroImage (published)
doi.org
How Can Digital Mental Health Enhance Psychiatry?
Emilie Stern
Jean-Arthur MICOULAUD FRANCHI
Guillaume Dumas
Jeverson Moreira
Stephane Mouchabac
Julia Maruani
Pierre Philip
Michel Lejoyeux
Pierre A. GEOFFROY
The use of digital technologies is constantly growing around the world. The wider-spread adoption of digital technologies and solutions in t… (see more)he daily clinical practice in psychiatry seems to be a question of when, not if. We propose a synthesis of the scientific literature on digital technologies in psychiatry and discuss the main aspects of its possible uses and interests in psychiatry according to three domains of influence that appeared to us: 1) assist and improve current care: digital psychiatry allows for more people to have access to care by simply being more accessible but also by being less stigmatized and more convenient; 2) develop new treatments: digital psychiatry allows for new treatments to be distributed via apps, and practical guidelines can reduce ethical challenges and increase the efficacy of digital tools; and 3) produce scientific and medical knowledge: digital technologies offer larger and more objective data collection, allowing for more detection and prevention of symptoms. Finally, ethical and efficacy issues remain, and some guidelines have been put forth on how to safely use these solutions and prepare for the future.
2022-06-04
The Neuroscientist (published)
doi.org
Modeling electronic health record data using a knowledge-graph-embedded topic model
Yuesong Zou
Ahmad Pesaranghader
Aman Verma
David Buckeridge
Yue Li
The rapid growth of electronic health record (EHR) datasets opens up promising opportunities to understand human diseases in a systematic wa… (see more)y. However, effective extraction of clinical knowledge from the EHR data has been hindered by its sparsity and noisy information. We present KG-ETM, an end-to-end knowledge graph-based multimodal embedded topic model. KG-ETM distills latent disease topics from EHR data by learning the embedding from the medical knowledge graphs. We applied KG-ETM to a large-scale EHR dataset consisting of over 1 million patients. We evaluated its performance based on EHR reconstruction and drug imputation. KG-ETM demonstrated superior performance over the alternative methods on both tasks. Moreover, our model learned clinically meaningful graph-informed embedding of the EHR codes. In additional, our model is also able to discover interpretable and accurate patient representations for patient stratification and drug recommendations.
2022-06-03
ArXiv (preprint)
doi.org
arxiv.org
Genetic correlates of phenotypic heterogeneity in autism
Varun Warrier
Xinhe Zhang
Patrick Reed
Alexandra Havdahl
Tyler M. Moore
Freddy Cliquet
Claire Leblond
Thomas Rolland
Anders Rosengren
Antonia San Jose Hannah Daisy Jessica Jessica Claire Betha Caceres Hayward Crawley Faulkner Sabet Ellis Oakle
Antonia San Jose Hannah Daisy Jessica Jessica Claire Bethany Eva Tony Declan Rosemary Jack Jessica Nicola Meng-Chuan Gwilym Amber Emily Hisham Julia Sara Ambrosino Sarai Yvonne Tabitha Miriam Alyssia Iris Maarten Anna Ver Loren Nico Sarah Larry Carsten Annika Daniel Ineke Yvette Maartje Elzbieta Elodie Kristiina Rouslan Guillaume Yang-Min Thomas Caceres
Antonia San José Cáceres
Hannah Hayward
Daisy Crawley
Jessica Faulkner
Jessica Sabet
Claire Ellis
Beth Oakley
Eva Loth
Tony Charman … (see 67 more)
Declan Murphy
Rosemary Holt
Jack Waldman
Jessica Upadhyay
Nicola Gunby
Meng-Chuan Lai
Gwilym Renouf
Amber N. V. Ruigrok
Emily Taylor
Hisham Ziauddeen
Julia Deakin
Sara Ambrosino di Bruttopilo
Sarai van Dijk
Yvonne Rijks
Tabitha Koops
Miriam Douma
Alyssia Spaan
Iris Selten
Maarten Steffers
Anna Ver Loren van Themaat
Nico Bast
Sarah Baumeister
Larry O’Dwyer
Carsten Bours
Annika Rausch
Daniel von Rhein
Ineke Cornelissen
Yvette de Bruin
Maartje Graauwmans
Elzbieta Kostrzewa
Elodie Cauvet
Kristiina Tammimies
Rouslan Sitnikow
Guillaume Dumas
Yang-Min Kim
Thomas Bourgeron
David M. Jonas Thomas Preben Bo Ole Merete Hougaard
David M. Hougaard
Jonas Bybjerg-Grauholm
Thomas Werge
Preben Bo Mortensen
Ole Mors
Merete Nordentoft
Dwaipayan Armandina Carrie Isabelle Tracey Paula Alex Graham J. Alexander E. P. Lidia V. Tal Madeline A. Deepak P. Jonathan Adhya
Dwaipayan Armandina Carrie Isabelle Tracey Paula Alex Graham Adhya Alamanza Allison Garvey Parsons Smith Tsompa
Dwaipayan Adhya
Armandina Alamanza
Carrie Allison
Isabelle Garvey
Tracey Parsons
Paula Smith
Alex Tsompanidis
Graham J. Burton
Alexander E. P. Heazell
Lidia V. Gabis
Tal Biron-Shental
Madeline A. Lancaster
Deepak P. Srivastava
Jonathan Mill
David H. Rowitch
Matthew E. Hurles
Daniel H. Geschwind
Anders D. Børglum
Elise B. Robinson
Jakob Grove
Hilary C. Martin
Simon Baron-Cohen
2022-06-02
Nature Genetics (published)
doi.org
Monocular Robot Navigation with Self-Supervised Pretrained Vision Transformers
Miguel Saavedra-Ruiz
Sacha Morin
Liam Paull
In this work, we consider the problem of learning a perception model for monocular robot navigation using few annotated images. Using a Visi… (see more)on Transformer (ViT) pretrained with a label-free self-supervised method, we successfully train a coarse image segmentation model for the Duckietown environment using 70 training images. Our model performs coarse image segmentation at the
2022-06-02
2022 19th Conference on Robots and Vision (CRV) (published)
doi.org
arxiv.org
Ageism and Artificial Intelligence: Protocol for a Scoping Review
Charlene H Chu
Kathleen Leslie
Jiamin Shi
Rune Nyrup
Andria Bianchi
Shehroz S Khan
Samira Abbasgholizadeh-Rahimi
Alexandra Lyn
Amanda Grenier
Background Artificial intelligence (AI) has emerged as a major driver of technological development in the 21st century, yet little attention… (see more) has been paid to algorithmic biases toward older adults. Objective This paper documents the search strategy and process for a scoping review exploring how age-related bias is encoded or amplified in AI systems as well as the corresponding legal and ethical implications. Methods The scoping review follows a 6-stage methodology framework developed by Arksey and O’Malley. The search strategy has been established in 6 databases. We will investigate the legal implications of ageism in AI by searching grey literature databases, targeted websites, and popular search engines and using an iterative search strategy. Studies meet the inclusion criteria if they are in English, peer-reviewed, available electronically in full text, and meet one of the following two additional criteria: (1) include “bias” related to AI in any application (eg, facial recognition) and (2) discuss bias related to the concept of old age or ageism. At least two reviewers will independently conduct the title, abstract, and full-text screening. Search results will be reported using the PRISMA-ScR (Preferred Reporting Items for Systematic Reviews and Meta-Analyses Extension for Scoping Reviews) reporting guideline. We will chart data on a structured form and conduct a thematic analysis to highlight the societal, legal, and ethical implications reported in the literature. Results The database searches resulted in 7595 records when the searches were piloted in November 2021. The scoping review will be completed by December 2022. Conclusions The findings will provide interdisciplinary insights into the extent of age-related bias in AI systems. The results will contribute foundational knowledge that can encourage multisectoral cooperation to ensure that AI is developed and deployed in a manner consistent with ethical values and human rights legislation as it relates to an older and aging population. We will publish the review findings in peer-reviewed journals and disseminate the key results with stakeholders via workshops and webinars. Trial Registration OSF Registries AMG5P; https://osf.io/amg5p International Registered Report Identifier (IRRID) DERR1-10.2196/33211
2022-06-01
JMIR Research Protocols (published)
doi.org
Aligning artificial intelligence with climate change mitigation
Lynn H. Kaack
Priya L. Donti
Emma Strubell
George Yoshito Kamiya
Felix Creutzig
David Rolnick
2022-06-01
Nature Climate Change (published)
doi.org
Conjugate Adder Net (CAddNet) - a Space-Efficient Approximate CNN
Lulan Shen
Maryam Ziaeefard
Brett Meyer
Warren Gross
James J. Clark
The AdderNet was recently developed as a way to implement deep neural networks without needing multiplication operations to combine weights … (see more)and inputs. Instead, absolute values of the difference between weights and inputs are used, greatly reducing the gate-level implementation complexity. Training of AdderNets is challenging, however, and the loss curves during training tend to fluctuate significantly. In this paper we propose the Conjugate Adder Network, or CAddNet, which uses the difference between the absolute values of conjugate pairs of inputs and the weights. We show that this can be implemented simply via a single minimum operation, resulting in a roughly 50% reduction in logic gate complexity as compared with AdderNets. The CAddNet method also stabilizes training as compared with AdderNets, yielding training curves similar to standard CNNs.
2022-06-01
2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) (published)
doi.org
High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND
Syed Mohsin Abbas
Thibaud Tonnellier
Furkan Ercan
Marwan Jalaleddine
Warren Gross
Ultrareliable low-latency communication (URLLC), a major 5G new-radio (NR) use case, is the key enabler for applications with strict reliabi… (see more)lity and latency requirements. These applications necessitate the use of short-length and high-rate channel codes. Guessing random additive noise decoding (GRAND) is a recently proposed maximum likelihood (ML) decoding technique for these short-length and high-rate codes. Rather than decoding the received vector, GRAND tries to infer the noise that corrupted the transmitted codeword during transmission through the communication channel. As a result, GRAND can decode any code, structured or unstructured. GRAND has hard-input as well as soft-input variants. Among these variants, ordered reliability bits GRAND (ORBGRAND) is a soft-input variant that outperforms hard-input GRAND and is suitable for parallel hardware implementation. This work reports the first hardware architecture for ORBGRAND, which achieves an average throughput of up to 42.5 Gb/s for a code length of 128 at a target frame error rate (FER) of 10−7. Furthermore, the proposed hardware can be used to decode any code as long as the length and rate constraints are met. In comparison to the GRAND with ABandonment (GRANDAB), a hard-input variant of GRAND, the proposed architecture enhances decoding performance by at least 2 dB. When compared to the state-of-the-art fast dynamic successive cancellation flip decoder (Fast-DSCF) using a 5G polar code (PC) (128, 105), the proposed ORBGRAND VLSI implementation has
2022-06-01
IEEE Transactions on Very Large Scale Integration (VLSI) Systems (published)
doi.org
arxiv.org
Optimal Control of Network-Coupled Subsystems: Spectral Decomposition and Low-Dimensional Solutions
Shuang Gao
Aditya Mahajan
In this article, we investigate the optimal control of network-coupled subsystems with coupled dynamics and costs. The dynamics coupling may… (see more) be represented by the adjacency matrix, the Laplacian matrix, or any other symmetric matrix corresponding to an underlying weighted undirected graph. Cost couplings are represented by two coupling matrices which have the same eigenvectors as the coupling matrix in the dynamics. We use the spectral decomposition of these three coupling matrices to decompose the overall system into
2022-06-01
IEEE Transactions on Control of Network Systems (published)
doi.org
arxiv.org
OptiMaP: swarm-powered Optimized 3D Mapping Pipeline for emergency response operations
Leandro R. Costa
Daniel Aloise
Luca G. Gianoli
Andrea Lodi
A smart application in sensing is mainly powered by a two-stage process comprising sensing (collect data) and computing (process data). Whil… (see more)e the sensing stage is typically performed locally through a dedicated Internet of Things infrastructure, the computing stage may require a powerful infrastructure in the cloud. However, when connectivity is poor and low latency becomes a requirement — as in emergency response and disaster relief operations — edge computing and ad hoc cloud paradigms come in support to keep the computing stage locally. Being local network connectivity and data processing limited, it is vital to properly optimize how the computing workload will be consumed by the local ad hoc cloud. For this purpose, we present and evaluate the swarm-powered Optimized 3D Mapping Pipeline (OptiMaP) for emergency response 3D mapping missions, which is implemented as a collaborative embedded Robot Operating System (ROS) application integrating an ad hoc telecommunication middleware.We simulate — with Software-In-The-Loop — realistic 3D mapping missions comprising up to 5 drones and 363 images covering 0.293km2. We show how the completion times of mapping missions carried out in a typical centralized manner can be dramatically reduced by two versions of the OptiMaP framework powered, respectively, by a variable neighborhood search heuristic and a greedy method.
2022-06-01
2022 18th International Conference on Distributed Computing in Sensor Systems (DCOSS) (published)
doi.org
Optimization and Simplification of PCPA Decoder for Reed-Muller Codes
Jiajie Li
Warren Gross
The collapsed projection-aggregation (CPA) decoder reduces the computational complexity of the recursive projection-aggregation (RPA) decode… (see more)r by removing the recursive structure. From simulations, the CPA decoder has similar error-correction performance as the RPA decoder, when decoding Reed-Muller (RM) (7, 3) and (8, 2) codes. The computational complexity can be further reduced by only selecting a subset of sub-spaces, which is achieved by pruning CPA decoders. In this work, optimization methods are proposed to find the pruned CPA (PCPA) decoder with small performance loss. Furthermore, the min-sum approximation is used to replace non-linear projection and aggregation functions, and a simplified list decoder based on the syndrome check is proposed. Under the same complexity, the optimized PCPA decoder has less performance loss than randomly constructed PCPA decoders in most case. The min-sum approximation incurs less than 0.15 dB performance loss at a target frame error rate of 10−4, and the simplified list decoder does not have noticeable performance loss.
2022-06-01
IEEE Communications Letters (published)
doi.org