Publications

Motor Recovery After a Hemispherectomy: Review of Mechanisms and the Potential of Neuromodulation to Enhance Motor Outcomes
David Bergeron
Dorothy Barthélemy
Aristides Hadjinicolaou
Marco Bonizzato
Marina Martinez
Numa Dancause
Alexander G. Weil
In children with severe, refractory hemispheric epilepsy syndromes, the removal or disconnection of the diseased cortex on one hemisphere fr… (see more)om the rest of the brain (hemispherectomy) is a last-resort treatment to cure epilepsy. The removal or disconnection of the motor cortex expectedly leads to contralateral hemiparesis. Partial recovery of the leg or proximal arm may occur over time from the plasticity of alternate motor pathways, but finer hand movements generally do not recover. The advent of neuroprostheses delivering invasive or non-invasive stimulation at different levels of the motor pathways holds promise to enhance motor recovery after a neurologic injury. In this manuscript, we review the mechanisms of motor recovery after a hemispherectomy and discuss how emerging neuromodulation options could be used to improve function. We conclude that the most suitable neuromodulation options for short-term clinical trials are vagal nerve stimulation paired with rehabilitation, and tonic spinal cord stimulation (transcutaneous or with implanted electrodes). We also identify promising neuromodulation options that would require further preclinical investigation in animal models: subcortical deep brain stimulation (motor thalamus, contralateral dentate nucleus), brain-spine interfacing, and motor cortex stimulation. Altogether, this manuscript lays the theoretical foundations for the investigation of neuromodulation therapies to improve the motor outcomes of patients who underwent a hemispherectomy for refractory epilepsy.
2026-02-12
Journal of Child Neurology (published)
doi.org
Multi-Agent Model-Based Reinforcement Learning with Joint State-Action Learned Embeddings
Zhizun Wang
David Meger
Learning to coordinate many agents in partially observable and highly dynamic environments requires both informative representations and dat… (see more)a-efficient training. To address this challenge, we present a novel model-based multi-agent reinforcement learning framework that unifies joint state-action representation learning with imaginative roll-outs. We design a world model trained with variational auto-encoders and augment the model using the state-action learned embedding (SALE). SALE is injected into both the imagination module that forecasts plausible future roll-outs and the joint agent network whose individual action values are combined through a mixing network to estimate the joint action-value function. By coupling imagined trajectories with SALE-based action values, the agents acquire a richer understanding of how their choices influence collective outcomes, leading to improved long-term planning and optimization under limited real-environment interactions. Empirical studies on well-established multi-agent benchmarks, including StarCraft II Micro-Management, Multi-Agent MuJoCo, and Level-Based Foraging challenges, demonstrate consistent gains of our method over baseline algorithms and highlight the effectiveness of joint state-action learned embeddings within a multi-agent model-based paradigm.
2026-02-12
arXiv (preprint)
doi.org
arxiv.org
AI Researchers' Views on Automating AI R&D and Intelligence Explosions
Severin Field
Raymond Douglas
David Krueger
Many leading AI researchers expect AI development to exceed the transformative impact of all previous technological revolutions. This belief… (see more) is based on the idea that AI will be able to automate the process of AI research itself, leading to a positive feedback loop. In August and September of 2025, we interviewed 25 leading researchers from frontier AI labs and academia, including participants from Google DeepMind, OpenAI, Anthropic, Meta, UC Berkeley, Princeton, and Stanford to understand researcher perspectives on these scenarios. Though AI systems have not yet been able to recursively improve, 20 of the 25 researchers interviewed identified automating AI research as one of the most severe and urgent AI risks. Participants converged on predictions that AI agents will become more capable at coding, math and eventually AI development, gradually transitioning from `assistants'or `tools'to `autonomous AI developers,'after which point, predictions diverge. While researchers agreed upon the possibility of recursive improvement, they disagreed on basic questions of timelines or appropriate governance mechanisms. For example, an epistemic divide emerged between frontier lab researchers and academic researchers, the latter of which expressed more skepticism about explosive growth scenarios. Additionally, 17/25 participants expected AI systems with advanced coding or R&D capabilities to be increasingly reserved for internal use at AI companies or governments, unseen by the public. Participants were split as to whether setting regulatory ``red lines"was a good idea, though almost all favored transparency-based mitigations.
2026-02-12
arXiv (preprint)
doi.org
arxiv.org
Navigating ternary doping in Li-ion cathodes with closed-loop multi-objective Bayesian optimization
Nooshin Zeinali Galabi
Cheng-Hao Liu
Moksh Jain
Marc Kamel
Shipeng Jia
Yoshua Bengio
Eric McCalla
To further improve secondary battery materials, we are increasingly exploring highly complex composition spaces in attempts to optimize mult… (see more)iple properties simultaneously. While our past work has done this in systematic manners using high-throughput experimentation, the exponential increase in the search space with triple doping makes grid search prohibitively expensive. Here, we demonstrate a closed-loop, multi-objective machine learning approach to guide the high-throughput workflow to efficiently navigate a space with approximately 14 million unique combinations. The test system is LiCoPO4 which we have previously explored using systematic codoping that was effective in optimizing one property only: energy density. To learn multiple electrochemical metrics, we first pretrain a set transformer on the public Materials Project database as a feature extractor, then attach a multi-task Gaussian process head and finetune the entire model on our high-throughput data. Through 3 rounds of active learning, we demonstrate that with a very small number of samples (as few as 125 random compositions and 63 predicted) we are able to simultaneously optimize four key electrochemical properties. Relative to the undoped system, the best composition raises our composite figure of merit by up to five times. This establishes an end-to-end workflow for accelerated battery materials design to be used in the rapidly growing field of autonomous materials discovery.
2026-02-11
Advances in Materials (published)
doi.org
Pregnancy AI: Development and Internal Validation of an Artificial Intelligence Tool to Predict Live Births in ICSI and IVF Cycles Using Clinical Features and Embryo Images
Jaume Minano Masip
Penelope Borduas
Isaac-Jacques Kadoch
Simon Phillips
Doina Precup
Daniel Dufort
2026-02-11
Medicina (published)
doi.org
Stabilizing Native Low-Rank LLM Pretraining
Paul Janson
Edouard Oyallon
Eugene Belilovsky
Foundation models have achieved remarkable success, yet their growing parameter counts pose significant computational and memory challenges.… (see more) Low-rank factorization offers a promising route to reduce training and inference costs, but the community lacks a stable recipe for training models from scratch using exclusively low-rank weights while matching the performance of the dense model. We demonstrate that Large Language Models (LLMs) can be trained from scratch using exclusively low-rank factorized weights for all non-embedding matrices without auxiliary"full-rank"guidance required by prior methods. While native low-rank training often suffers from instability and loss spikes, we identify uncontrolled growth in the spectral norm (largest singular value) of the weight matrix update as the dominant factor. To address this, we introduce Spectron: Spectral renormalization with orthogonalization, which dynamically bounds the resultant weight updates based on the current spectral norms of the factors. Our method enables stable, end-to-end factorized training with negligible overhead. Finally, we establish compute-optimal scaling laws for natively low-rank transformers, demonstrating predictable power-law behavior and improved inference efficiency relative to dense models.
2026-02-11
ArXiv (preprint)
arxiv.org
arxiv.org
Affordances Enable Partial World Modeling with LLMs
Khimya Khetarpal
Gheorghe Comanici
Jonathan Richens
Jeremy Shar
Fei Xia
Laurent Orseau
Aleksandra Faust
Doina Precup
2026-02-10
ArXiv (preprint)
arxiv.org
arxiv.org
Improving the Robustness of Large Language Models for Code Tasks via Fine-tuning with Perturbed Data
Yang Liu
Armstrong Foundjem
Xingfang Wu
Heng Li
Foutse Khomh
Context: In the fast-paced evolution of software development, Large Language Models (LLMs) have become indispensable tools for tasks such as… (see more) code generation, completion, analysis, and bug fixing. Ensuring the robustness of these models against potential vulnerabilities from handling diverse inputs is critical, as variations in input can lead to incorrect or insecure code outputs. Objective: This work aims to improve the robustness of LLMs for coding-related tasks against potential adversarial inputs. Specifically, we investigate how fine-tuning LLMs with perturbed datasets impacts their robustness against input perturbations. Method: We systematically evaluated LLM robustness by fine-tuning models using datasets perturbed at character-level, word-level, and sentence-level, comparing results against base models and models fine-tuned on unperturbed datasets. Results: Fine-tuning LLMs with perturbed datasets significantly improves model robustness (RD usually drops around 4\% - 6\%), especially for models with relatively weak robustness. However, this fine-tuning process typically results in a slight performance decrease (pass@1 usually drops around 1\% - 3\%) compared to fine-tuning with unperturbed datasets, although occasional performance improvements are observed. Conclusion \&Implications: Fine-tuning LLMs for coding tasks with perturbed data effectively enhances their robustness at the cost of a minor performance reduction, emphasizing the importance of balancing the robustness and performance of LLMs for coding applications.
2026-02-10
ArXiv (preprint)
arxiv.org
arxiv.org
What Makes Value Learning Efficient in Residual Reinforcement Learning?
Guozheng Ma
Li Li
Haoyu Wang
Zixuan Liu
Pierre-Luc Bacon
Dacheng Tao
Residual reinforcement learning (RL) enables stable online refinement of expressive pretrained policies by freezing the base and learning on… (see more)ly bounded corrections. However, value learning in residual RL poses unique challenges that remain poorly understood. In this work, we identify two key bottlenecks: cold start pathology, where the critic lacks knowledge of the value landscape around the base policy, and structural scale mismatch, where the residual contribution is dwarfed by the base action. Through systematic investigation, we uncover the mechanisms underlying these bottlenecks, revealing that simple yet principled solutions suffice: base-policy transitions serve as an essential value anchor for implicit warmup, and critic normalization effectively restores representation sensitivity for discerning value differences. Based on these insights, we propose DAWN (Data-Anchored Warmup and Normalization), a minimal approach targeting efficient value learning in residual RL. By addressing these bottlenecks, DAWN demonstrates substantial efficiency gains across diverse benchmarks, policy architectures, and observation modalities.
2026-02-10
ArXiv (preprint)
arxiv.org
arxiv.org
What do people want to fact-check?
Bijean Ghafouri
Dorsaf Sallami
Luca Luceri
Taylor Lynn Curtis
Jean-François Godbout
Emilio Ferrara
Reihaneh Rabbany
2026-02-10
arXiv (preprint)
doi.org
arxiv.org
Position: Message-passing and spectral GNNs are two sides of the same coin
Antonis Vasileiou
Juan Cervino
Pascal Frossard
Charilaos I. Kanatsoulis
Christopher Morris
Michael T. Schaub
Pierre Vandergheynst
Zhiyang Wang
Guy Wolf
Ron Levie
Graph neural networks (GNNs) are commonly divided into message-passing neural networks (MPNNs) and spectral graph neural networks, reflectin… (see more)g two largely separate research traditions in machine learning and signal processing. This paper argues that this divide is mostly artificial, hindering progress in the field. We propose a viewpoint in which both MPNNs and spectral GNNs are understood as different parametrizations of permutation-equivariant operators acting on graph signals. From this perspective, many popular architectures are equivalent in expressive power, while genuine gaps arise only in specific regimes. We further argue that MPNNs and spectral GNNs offer complementary strengths. That is, MPNNs provide a natural language for discrete structure and expressivity analysis using tools from logic and graph isomorphism research, while the spectral perspective provides principled tools for understanding smoothing, bottlenecks, stability, and community structure. Overall, we posit that progress in graph learning will be accelerated by clearly understanding the key similarities and differences between these two types of GNNs, and by working towards unifying these perspectives within a common theoretical and conceptual framework rather than treating them as competing paradigms.
2026-02-09
arXiv (preprint)
doi.org
arxiv.org
Squeezing More from the Stream : Learning Representation Online for Streaming Reinforcement Learning
Nilaksh
Antoine Clavaud
Mathieu Reymond
Franccois Rivest
A. Chandar
AI Institute
Polytechnique Montr ´ eal
2026-02-09
arXiv (preprint)
doi.org
arxiv.org