
Scientist. ML and (computational) graphs at @Qualcomm AI Research. Previously @EPFL_en (PhD with @trekkinglemon), @BerkeleyLab.
🇨🇭 Switzerland
Joined May 2015
- Tweets1.5K
- Following926
- Followers1.5K
- Likes14.9K
Michaël Defferrard retweeted
Transformers are data‑hungry in sequential tasks because they lack the right inductive bias.
It’s well known that for many sequential problems (from adding numbers to step‑by‑step agentic execution and multi‑hop reasoning), transformers fail to generalize to longer sequences than they were trained on. “Train short, test long” often fails.
The usual workaround is to "just train on whatever length you’ll need at test time".
---------
📉 But we show the consequence of this is data inefficiency:
• Transformers can learn tasks for a single fixed sequence length fairly efficiently, but learning across multiple lengths requires much more data.
• More importantly, transformers tend not to share mechanisms across tasks of different lengths; instead, they often learn isolated, length‑specific solutions.
---------
🧪 A simple way to test this:
Consider modular addition (with and without CoT). Train a model to add 2, 3, …, L numbers at once and measure the data needed. Then train separate models for each length (2, 3, …, L) and sum their data requirements.
💡The intuition:
If a model truly shares mechanisms across lengths, learning a distribution of lengths should require far fewer samples than learning each length separately.
This comes from amortizing the learning cost: data for length n also helps the model learn length n+k.
---------
📊 Results:
Sharing Factor κ = (sum of samples to learn each length separately) ÷ (samples to learn all lengths jointly)
- κ > 1: mechanism sharing and amortized learning.
- κ ≈ 1: learning length-specific solutions in isolation.
- κ < 1: destructive interference; length-specific solutions compete for model capacity.
Transformers showed low sharing factors, and even destructive interference with CoT.
---------
✨ Implications:
This suggests that end-to-end learning in applied agentic settings, like robotics or GUI control, could be even more challenging.
If data requirements grow unfavorably with sequence length, that might also help explain the persistent issues we see at large context lengths (e.g., context rot).
Standard attention mechanism appears inefficient for step-by-step tasks, and we may ultimately be better off with recurrent agents.
Michaël Defferrard retweeted
1/
We know Transformers fail at length extrapolation. But new research shows a deeper flaw: they fail at IN-DISTRIBUTION state tracking. They don't learn algorithmic rules, they just memorize isolated circuits per length. 🧵
Michaël Defferrard retweeted
Looking at the thread. The common frame to look at the more general phenomenon involves an eigenproblem of the form Oƒ = λƒ, where the operator O encodes either: a symmetry (translations, rotations, general group transformations), or a
a statistic (e.g. covariance, correlation),
Caring for your home is a lesson in the 2nd law: Cease working against entropy and nature decays it into a forest.
Michaël Defferrard retweeted
I'll make the talk fun, and insightful.
IMHO, we had a breakthrough moment with the CARTE paper
openreview.net/forum?id=9kAr…
Michaël Defferrard retweeted
Exploring “dark-matter” protein folds using deep learning @CellSystemsCP
• Introducing Genesis VAE, a convolutional variational autoencoder that transforms low-resolution protein fold sketches into designable, stable 3D models.
• Genesis VAE enables rapid exploration of “dark-matter” protein folds, creating novel protein architectures that have never been observed in nature.
• Coupled with trRosetta, Genesis can design protein sequences for both known and novel folds, validated through experimental protease resistance assays.
• One major innovation is Genesis’ ability to learn structural patterns from low-resolution sketches, refining them into native-like protein backbones.
• The framework successfully designed five native folds and three novel “dark-matter” folds, demonstrating its capacity to generalize beyond natural protein spaces.
• High-throughput experimental validation showed several of the designed proteins were stable, with folding behavior on par with natural proteins.
• Genesis opens the door for the de novo design of proteins with entirely new functions, breaking through current limitations in protein design.
@zanderharteveld @mmbronstein @befcorreia @JoshSouthern13 @CasperGoverde @m_deff @loukasa_tweet @trekkinglemon
💻Code: github.com/zanderharteveld/g…
📜Paper: cell.com/cell-systems/fullte…
Michaël Defferrard retweeted
Switzerland now requires all government software to be open source zdnet.com/article/switzerlan…
Michaël Defferrard retweeted
Best part of ICML so far! Fun dinner with lots of nice people working on graph machine learning and beyond.
Michaël Defferrard retweeted
Come see our poster #715 on CodeIt today at #ICML2024 13.30-15.00 Halle C. We approach ARC by self-improving LLMs with prioritized hindsight replay. @blazejmanczak @aukejw Corrado Rainone @davwzha @m_deff @TacoCohen
Excited to share that our paper “CodeIt: Self-Improving Language Models with Prioritized Hindsight Replay” was accepted into ICML!
@blazejmanczak @aukejw Corrado Rainone @davwzha @m_deff @TacoCohen 1/5
Michaël Defferrard retweeted
…and the ChebNet guy @m_deff
Michaël Defferrard retweeted
1/n AI's Next Leap: Mastering Abstraction and Reasoning
Imagine a world where machines can not only understand our language but also grasp the underlying logic of our thoughts, effortlessly solving problems that demand reasoning and adaptability. This is the ambitious goal of Artificial General Intelligence (AGI), and the Abstraction and Reasoning Corpus (ARC) stands as a formidable challenge on this path. ARC tasks, with their focus on core knowledge systems and few-shot learning, have proven difficult even for the most advanced AI models. Yet, a new contender has emerged, wielding the power of language and learning in a way never seen before. Enter CodeIt, a self-improving language model that cracks the code of ARC, achieving state-of-the-art performance and offering a glimpse into the future of intelligent machines.
One of the key difficulties with ARC lies in its demand for reasoning and generalization beyond simply memorizing patterns. Existing neural network approaches, such as those using GPT-4, often fall short in this regard. CodeIt addresses this by adopting a neuro-symbolic approach. Instead of directly predicting outputs, it learns to generate programs within a domain-specific language (DSL) designed for ARC tasks. This allows the model to represent and manipulate knowledge in a structured and symbolic way, enabling more effective reasoning and generalization.
Furthermore, the sparse reward problem poses a significant hurdle for program synthesis methods like Expert Iteration (ExIt). Finding correct programs is challenging due to the lack of positive feedback, hindering learning progress. CodeIt ingeniously tackles this issue through hindsight relabeling. By learning from all generated programs, not just the successful ones, the model gains valuable information about the task structure and program behavior, significantly improving sample efficiency.
However, hindsight relabeling introduces a new challenge: catastrophic forgetting. As the data distribution changes with each iteration, the model risks losing previously acquired knowledge. To mitigate this, CodeIt employs prioritized experience replay. By prioritizing learning from experiences that solve actual ARC tasks, the model retains and builds upon its successful strategies, ensuring continuous improvement.
The experimental results demonstrate the effectiveness of CodeIt. It outperforms all existing baselines, including both neural and symbolic approaches, achieving state-of-the-art performance on the ARC evaluation set. The analysis of generated programs reveals that CodeIt learns efficient and effective solutions, often finding shorter programs and employing different primitives compared to baselines. Moreover, the model exhibits program refinement capabilities, continuously improving solutions over time.
Ablation studies further confirm the importance of each component within CodeIt. Removing ExIt, hindsight relabeling, or prioritized experience replay all lead to significant performance drops, highlighting their crucial roles in addressing the challenges of ARC. Additionally, the results emphasize the value of pre-trained language models and data augmentation for effective program generation and learning.
In conclusion, CodeIt represents a significant step forward in tackling complex reasoning and abstraction tasks like ARC. Its innovative combination of program synthesis, hindsight relabeling, and prioritized experience replay offers a powerful framework for developing more intelligent and adaptable AI systems.
Michaël Defferrard retweeted
ARC is a tough reasoning benchmark where modern LLMs far underperform humans still. Great to see that there's serious additional backing!
Coincidentally, we just open-sourced CodeIt, our LLM-improvement approach for ARC: github.com/Qualcomm-AI-resea…
I'm partnering with @mikeknoop to launch ARC Prize: a $1,000,000 competition to create an AI that can adapt to novelty and solve simple reasoning problems.
Let's get back on track towards AGI.
Website: arcprize.org
ARC Prize on @kaggle: kaggle.com/competitions/arc-…
Michaël Defferrard retweeted
Check👇out! New paper by @NatashaEve4 from AMLAB with Qualcomm collaborators on models that learn to discover programs to solve complex tasks. Congrats Natasha & Co!
Excited to share that our paper “CodeIt: Self-Improving Language Models with Prioritized Hindsight Replay” was accepted into ICML!
@blazejmanczak @aukejw Corrado Rainone @davwzha @m_deff @TacoCohen 1/5
Michaël Defferrard retweeted
Excited to share that our paper “CodeIt: Self-Improving Language Models with Prioritized Hindsight Replay” was accepted into ICML!
@blazejmanczak @aukejw Corrado Rainone @davwzha @m_deff @TacoCohen 1/5
Michaël Defferrard retweeted
CodeIt: Self-Improving Language Models with Prioritized Hindsight Replay
@NatashaEve4, @blazejmanczak, @aukejw, Corrado Rainone, David Zhang, @m_deff, @TacoCohen
tl;dr: sample a program, try it, add to the replay pool.
New sota on ARC
arxiv.org/abs/2402.04858.pdf
Michaël Defferrard retweeted
For the free online @LogConference we have a bunch of free local meetups!
Find out if there is one close to you.
Links to some of them are in the reply 👇
1/3
Michaël Defferrard retweeted
A lesser-known fact about ML open source contributors: About 50% of code contributors to ML paper implementations are practitioners collaborating with researchers. Here are the topk researchers & practitioners contributing to open source and open to sponsorship.
authorswithcode.org/topk/?ch…
Tagging a few of topk.
@EmilStenstrom @josephpaulcohen @martinmonperrus @r9y9 @manodeepsinha @m_deff @DrChenWang @mnlpariente @PatrickKidger @fcakyon @kadirnar_ai @rishit_dagli @JirkaBorovec @__z__9
Michaël Defferrard retweeted
We are happy to announce the first @LogConference Meetup in Lausanne, supported by @vant_ai! 🤗
Join us on Nov 22nd at @EPFL_en to hear @_bunnech, @ClementVignac, @DorinaThanou and @m_deff. Bring your posters!
Registration: forms.gle/c4HjeuDoBTpXN95F9 Webpage: sites.google.com/view/log-me…
Michaël Defferrard retweeted
Layer-wise equivariance symmetries (e.g. conv layers) allow neural nets to generalise effectively. But can we learn them automatically using gradients? We show we can! Excited to share that our method ELLA has been accepted as a spotlight paper at #neurips2023. A thread.👇1/11🧵
Michaël Defferrard retweeted
Had an incredible time hosting the inaugural Paris Learning-on-Graphs Meetup! 🎉 Thank you to everyone who attended and made it such a fantastic hybrid event! Special thanks to our inspiring speakers for their outstanding talks and to the poster presenters for sharing their work.










































