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 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 Jose Hannah Daisy Jessica Jessica Claire Betha Caceres Hayward Crawley Faulkner Sabet Ellis Oakle
Antonia San José Cáceres
Hannah Hayward
Daisy Crawley
Jessica Faulkner
Jessica Sabet
Claire Ellis
Beth Oakley
Eva Loth
Tony Charman … (voir 67 de plus)
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
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
Monocular Robot Navigation with Self-Supervised Pretrained Vision Transformers
Miguel Saavedra-Ruiz
Sacha Morin
In this work, we consider the problem of learning a perception model for monocular robot navigation using few annotated images. Using a Visi… (voir plus)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
Using Representation Expressiveness and Learnability to Evaluate Self-Supervised Learning Methods
Yuchen Lu
Zhen Liu
Aristide Baratin
Romain Laroche
Using Representation Expressiveness and Learnability to Evaluate Self-Supervised Learning Methods
Yuchen Lu
Zhen Liu
Aristide Baratin
Romain Laroche
Ageism and Artificial Intelligence: Protocol for a Scoping Review
Charlene H Chu
Kathleen Leslie
Jiamin Shi
Rune Nyrup
Andria Bianchi
Shehroz S Khan
Alexandra Lyn
Amanda Grenier
Background Artificial intelligence (AI) has emerged as a major driver of technological development in the 21st century, yet little attention… (voir plus) 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
Aligning artificial intelligence with climate change mitigation
Lynn H. Kaack
Priya L. Donti
Emma Strubell
George Yoshito Kamiya
Felix Creutzig
Brain-spinal cord interaction in long-term motor sequence learning in human: An fMRI study
Ali Khatibi
Shahabeddin Vahdat
Ovidiu Lungu
Jürgen Finsterbusch
Christian Büchel
V. Marchand-Pauvert
Julien Doyon
Conjugate Adder Net (CAddNet) - a Space-Efficient Approximate CNN
Lulan Shen
Maryam Ziaeefard
Brett Meyer
James J. Clark
The AdderNet was recently developed as a way to implement deep neural networks without needing multiplication operations to combine weights … (voir plus)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.
Efficient Fine-Tuning of BERT Models on the Edge
Danilo Vucetic
Mohammadreza Tayaranian
Maryam Ziaeefard
James J. Clark
Brett Meyer
Resource-constrained devices are increasingly the deployment targets of machine learning applications. Static models, however, do not always… (voir plus) suffice for dynamic environments. On-device training of models allows for quick adaptability to new scenarios. With the increasing size of deep neural networks, as noted with the likes of BERT and other natural language processing models, comes increased resource requirements, namely memory, computation, energy, and time. Furthermore, training is far more resource intensive than inference. Resource-constrained on-device learning is thus doubly difficult, especially with large BERT-like models. By reducing the memory usage of fine-tuning, pre-trained BERT models can become efficient enough to fine-tune on resource-constrained devices. We propose Freeze And ReconFigure (FAR), a memory-efficient training regime for BERT-like models that reduces the memory usage of activation maps during fine-tuning by avoiding unnecessary parameter updates. FAR reduces fine-tuning time on the DistilBERT model and CoLA dataset by 30 %, and time spent on memory operations by 47%. More broadly, reductions in metric performance on the GLUE and SQuAD datasets are around 1% on average.
High-Throughput and Energy-Efficient VLSI Architecture for Ordered Reliability Bits GRAND
Syed Mohsin Abbas
Thibaud Tonnellier
Furkan Ercan
Marwan Jalaleddine
Ultrareliable low-latency communication (URLLC), a major 5G new-radio (NR) use case, is the key enabler for applications with strict reliabi… (voir plus)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
Optimal Control of Network-Coupled Subsystems: Spectral Decomposition and Low-Dimensional Solutions
Shuang Gao
In this article, we investigate the optimal control of network-coupled subsystems with coupled dynamics and costs. The dynamics coupling may… (voir plus) 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
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… (voir plus)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.