
Assistant Professor in machine learning @VUAmsterdam. Abstract representations+Learning+Reasoning.
Amsterdam, The Netherlands
Joined September 2010
- Tweets1.2K
- Following867
- Followers1.6K
- Likes2.3K
Vincent François-Lavet retweeted
A generalist model, not a dedicated robot policy, pulled off physical control by reasoning and using tools.
Here's the four-step approach Gemini 4 figured out, given high-level instructions and the overall task:
1. Watched a human throw, and mapped the motion to its own joints.
2. Used its cameras to locate the board in 3D, and built a physics sim.
3. Practiced in simulation, tuning its stance and swing for a smooth arc.
4. On the real robot, watched each landing and adjusted by centimeters until 7 shots went in.
Vincent François-Lavet retweeted
How does a model understand and explore a world it has never seen?
We introduce 🔭VISTA🔭, a visual harness that gives a VLM long-horizon vision for reasoning in an interactive world. With Claude Opus 5.0, it reaches 100% RHAE on @arcprize's ARC-AGI-3, perfectly solving all 25 public games.
Blog post: vista-research.github.io/ 🧵
Vincent François-Lavet retweeted
This is the result of great collaboration across NVIDIA.
Very interesting new paper from NVIDIA.
(bookmark it)
It takes a closer look at evaluating agent skills.
Enterprise teams are starting to leverage shared skill libraries, and the review gate is typically a scanner that checks structure, style, and security.
NVIDIA measured whether that gate predicts anything.
Across 145 real skills from internal and public catalogs, structural scan scores correlate with LLM-judge quality at a Spearman rho of 0.14.
ACES proposes Skill Lift instead.
In other words, run the same task twice under the same model, sandbox, workspace, and scorer, once with the skill loaded and once without. Then you measure the difference in what the agent completed.
They scored 947 paired cases from 58 production skills across four harnesses, normalizing trajectories into a shared Agent Trajectory Interchange Format, so results compare across harnesses.
They fins that the largest process-metric gains appear in skill execution, behavior check, and skill efficiency.
Paper: arxiv.org/abs/2608.20614
Track more trending AI papers in our academy: academy.dair.ai/
Reasoning models based on Large Language Models tend to spend the same amount of effort whether the question is easy or hard. That's wasteful on simple problems, and not enough on the difficult ones.
In our paper, we ask a simple question: can a model learn when to think?
Fixed reasoning strategies trace a Pareto frontier of accuracy versus thinking budget. Our adaptive router (the star) lands above that curve: you don't just trade tokens for accuracy: you get more accuracy per token than any fixed budget offers.
Adaptive reasoning, learned rather than hand-tuned or prompted.
📄 arxiv.org/pdf/2608.20256
💻 github.com/GijsKassenaar/thr…
Work with Gijs Kassenaar and @zhaoyang3x6 .
Our general-purpose coding agent just scored 100% on the ARC-AGI-3 interactive reasoning benchmark.
NVIDIA AVO completed all 183 levels across all 25 public environments, figuring out what to do with no instructions, explicit rules, or stated goals.
Vincent François-Lavet retweeted
Today we release my favorite episode of Training Data yet: the great Rich Sutton.
@RichardSSutton wrote the textbook, wrote The Bitter Lesson (and many other on-point essays like "Self-Verification, The Key to AI"), and trained a mafia of talented students who went on to change the AI landscape forever including David Silver, inventor of built AlphaGo.
@kjaved_ was Rich's PhD student at Alberta and wrote The Big World Hypothesis. They just left academia to start @oaklab
Their core argument:
(1) The Bitter Lesson: the world is massively more complex than any model of it, so anything trained on human-curated data has a ceiling
(2) Continual Learning: intelligence is continual by definition, and today's models stop learning the moment they ship.
The conversation covers:
— what The Bitter Lesson actually says, and what people get wrong
— why synthetic data is "just a big mistake," and the Big World Hypothesis behind it
— how LLMs are both a positive and a negative example of his own essay
— why no animal learns by supervised learning, and what squirrels can do that we can't
— the cure for catastrophic forgetting: per-weight step sizes and continual backprop
— why the biggest labs can't take a path where performance gets worse before it gets better
— a trillion parameters on 20 watts, and the Moore's Law math that makes it plausible
— why the endpoint isn't one mind but one design, running as many minds
It was both a fun generative idea- and debate-filled conversation, and a surprisingly human one too. Rich, thank you for beating cancer and changing the trajectory of AI. 💙
00:00 Introduction
02:10 An AI winter, a cancer diagnosis, and the move to Alberta
07:07 Writing "The Bitter Lesson," and what people get wrong
09:53 Are LLMs a positive or a negative example of it?
11:03 Synthetic data is "just a big mistake," and the Big World Hypothesis
18:01 AlphaGo, human priors, and why prior knowledge and learning should be friends
22:37 "Their weights never change": do LLM assistants actually learn?
26:09 Babies, squirrels, and why no animal learns by supervised learning
32:02 Rockets, imagination, and where paradigm shifts come from
36:42 The Alberta Plan and its 12 steps
38:53 Catastrophic forgetting and the cure
43:43 Oak's biggest ambition: a self-maintaining mind
47:56 Why the big labs are stuck in a local minimum
49:13 If everything goes right: LLMs, many minds, and hiring
The man who pioneered reinforcement learning thinks the rest of the field is weird, and lays it all out in today's episode. Together w/ @Alfred_Lin @sequoia
Claude's watermark probably doesn't work how you think. As the CTO of GPTZero, I'll explain how Anthropic, Google and OpenAI are building text watermarking in this brief explainer and whether it can be defeated.
Almost all forms of watermarking that are fast and cheap enough for a frontier lab have the same formula, following the KGW method:
In generation:
1. Let's say you've generated n tokens so far. Take those n tokens + a secret key to generate a random hash
2. Use that hash to randomly reweight the probabilities for the n+1 token, and then sample from that new distribution. In the simple case, you could split 50% of all English words into a green or red set based on your hash, and boost the probability of words in the green set.
For watermark detection:
1. For each token, see if it was in the green or red set.
2. To do this, recreate the hash based on the secret key and the text preceding the current token. Then, recreate the green and red set of words.
3. Once you've checked all the words in the text, if the next token is selected disproportionally from the green set more than 50% of the time, you claim the text has the watermark.
I can tell you want to ask the following:
1) Isn't it easy to mess up the hash if you paraphrase the text? The answer is mostly yes, however, you can use a statistical model to get your hash instead of a deterministic function (SIR, Adaptive Watermark). Since the entire watermark is probabilistic, this is fine.
2) Doesn't this make the text much worse? The answer is yes, it does - Yes, it does – but for most people, it's imperceptible (Google claims in human feedback study with 20,000 texts), since there are exponentially many ways to write the same paragraph. DiPmark does something more sophisticated to avoid shifting the text distribution on average. Of course, watermarks fail on short text or highly predictable texts like "2+2=4".
3) Shouldn't it be easy to figure out the green and red sets? The answer is no. You would need an exponentially large number of samples from the watermarker to reconstruct those sets exactly, but it's a risk if the detector is open to the wild (Watermark Stealing)
Still, there are couple challenges that a frontier lab needs to overcome:
1. Their watermark needs to work token-by-token because they are streaming their text to users. Many watermark methods plan sentences or paragraphs at a time, or change the text after its entirely written, in order to make their watermark robust to paraphrasers, and a frontier lab cannot afford to do this yet (SemStamp, PostMark)
2. If the secret key leaks, the watermark is busted. To avoid a large blast damage from this, you need to have a couple secret keys in rotation.
3. There are some texts, like code, that cannot be arbitrarily changed, otherwise the code will break. In those cases, the watermark needs to selectively change words in parts of the text that can tolerate synonyms (i.e. like variable naming) - see SWEET, EWD, Invisible Entropy.
4. They will need to educate their users on how to deal with false positives and false negatives of a detector, which is a big challenge (one we put a lot of effort into)
So, how do I see this playing out in the next 6 months?
1. If Anthropic releases the watermark detector publically, I think they defeat their own watermark. People find reliable watermark removal strategies by testing against Anthropic (AI detectors like GPTZero have an advantage here because they can train against these adversaries once they become popular).
2. If they keep the detector private to the government, like Google has done, it's "safer". However, there are some papers showing trained approaches that work robustly to zero-shot break watermarks without any data, simply because they try to write the text just like a human (Zhang et al. 2024, Watermarks in the Sand). Also, making your detector makes it battle-tested and stronger long-term (my experience).
3. In my testing, the watermarks don't survive intense paraphrasing (especially if you combine word choice and syntax attacks), or human text substitution (rewrite your AI text by plagiarizing human authors). The free paraphrasers I've tried have quickly bypassed Google Deepmind's SynthId for what it's worth.
4. All-in-all, frontier labs are likely okay with this because they expect most users to not attack the watermark, and also because they + European regulators likely don't care past a certain point - its good enough.
5. Overall, I think users of frontier LLMs will not really care about this, because 1) they don't realize watermarks are there, 2) EU will force everyone to conform, 3) this seems more like regulatory hoop-jumping than an earnest effort from frontier labs to expose LLM use
Lastly, people's first concern shouldn't be watermarking, it should be AI detectors!
If you're posting, "its not X, its Y!!", I don't think the watermark is going to make a difference :)
Vincent François-Lavet retweeted
One brain. For any robot. 🤖
We’re launching Gemini Robotics 2: our next-generation physical AI bringing full body intelligence to humanoids, advanced dexterity, multi-robot teamwork and more.
Vincent François-Lavet retweeted
Our paper on neuro-symbolic meta-policies for knowledge-graph memory was accepted at ISWC 2026, with @VinFL and @michaelcochez
Don't hardcode how an agent answers, explores, and forgets. Let it learn which symbolic rule to apply, while execution stays symbolic and inspectable.
Vincent François-Lavet retweeted
hello there the jacobian conjecture is false thanx to my close friend akhil for asking about it and my other close friend fable for working during the world cup final
((1+xy)^3 z + y^2 (1+xy) (4+3xy), y + 3 x (1+xy)^2 z + 3 x y^2 (4+3xy), 2 x - 3 x^2 y - x^3 z): \C^3\to \C^3, has jacobian determinant -2, and sends (0, 0, -1/4), (1, -3/2, 13/2), and (-1, 3/2, 13/2) to (-1/4, 0, 0)
Vincent François-Lavet retweeted
2023: LLMs struggle with 4th grade word problems
2024: LLMs can do high school math
2025: LLMs get a gold medal at the IMO
Now, GPT-5.6 solves famous frontier math/stat questions. The IMO is today and 5.6 one-shotting a perfect score isn't even news.
Where will we be next year?
AI has helped resolve an important question in statistics. In the area of multiple hypothesis testing, the goal of controlling the false discovery rate (FDR) has been introduced in a seminal paper by Benjamini and Hochberg (1995). They also introduced a method (the Benjamini-Hochberg or BH method) and proved it controls the FDR. This method has been widely adopted in modern high-throughput science, including in genomics, astronomy, economics, etc. The paper has has garnered more than 130,000 citations to date.
However Benjamini and Hochberg showed FDR control only when the data for the individual tests are *independent*. In practice, these data are often dependent; a good example is data on genetic variants due to linkage disequilibrium. Later work has focused on extending the validity of the BH procedure, e.g., to a form of positive dependence by Benjamini and Yekutieli (2001).
The question of when the BH procedure controls the FDR has remained open. Over the last twenty years, many authors, including Reiner-Benaim (2007), Kim and van de Wiel (2008), Benjamini (2010), Sarkar (2023), Sarkar and Zhang (2025), have conjectured that the BH procedure controls the FDR for two-sided tests using any correlated Gaussian data. These authors have presented both theoretical and empirical evidence supporting, but not directly showing, the conjecture.
With the help of AI (specifically GPT-5.6 Sol Pro), I have settled the question in the negative: The Benjamini-Hochberg procedure does *not* generally control the false discovery rate at the desired level for correlated two-sided Gaussian tests. This was done by exhibiting a Gaussian factor model for which, at a nominal level alpha=0.01, the false discovery rate is proved to be FDR>0.0104.
There is a lot of interesting commentary to be made:
1. This result should be of interest to everybody in the field of statistics. Emmanuel Candes of Stanford University once called the false discovery rate and the Benjamini-Hochberg procedure "one of the two most important developments in statistics after 1950" (the other being James-Stein shrinkage). The present conjecture is probably the most central question about FDR/BH that was unresolved to date.
2. GPT-5.6 one-shot the problem after 90 minutes of reasoning, whereas with 5.5 I was not able to solve it even after iterating with multiple parallel agents for perhaps 20 hours. So the capability improvement is quite real. Exciting times to live in!
3. The argument is not especially surprising, but it does combine an asymptotic approach (standard for FDR analysis, see e.g., Genovese and Wasserman, Efron, etc) with a numerical certificate in a way that would be pretty non-standard in the field. Once we have the specific example, then straightforward simulations also support that the false discovery rate is indeed higher than the nominal value (see attached fig).
4. The current degree of violation over the nominal level is relatively small (0.104 vs 0.1). So the importance of this result is mainly conceptual. The practical implications remain to be determined.
Overall, an exciting development! Preprint is available here (faculty.wharton.upenn.edu/wp…) and will be on arxiv tonight; supporting code is here (github.com/dobriban/BH).
Vincent François-Lavet retweeted
Instead of watching an hour of Netflix, watch this 30-minute speech by the Head of Anthropic’s Coding Agents research team. It will teach you more about vibe coding than 100 paid courses.
Vincent François-Lavet retweeted
You can read a detailed technical report on the software vulnerabilities and exploits discovered by Claude Mythos Preview here: red.anthropic.com/2026/mytho…
Vincent François-Lavet retweeted
Gemma 4 outperforms models over 10x their size! (note the x-axis is log scale!)
Today we're releasing Gemma 4, our new family of open foundation models, built on the same research and technology as our Gemini 3 series. These models set a new standard for open intelligence, offering SOTA reasoning capabilities from edge-scale (2B and 4B w/ vision/audio) up to a 26B parameter MoE model and a 31B dense model. By releasing Gemma 4 under the Apache 2.0 license, we hope to enable more innovation across the research and developer communities. Our earlier Gemma 3 models were downloaded 400M times and over 100,000 variants of those models have been published, so we're excited to see what the community will do with the even better Gemma 4 models!
Learn more at blog.google/innovation-and-a… and goo.gle/gemma-4-apache-2
Great work by everyone involved!
#Gemma4 #AI #OpenSource #ML
Vincent François-Lavet retweeted
DLSS 5 is completely mind blowing. The neural rendering model with photoreal lighting and materials is a generation step up in visual fidelity. Gaming with DLSS 5 feels like future tech, but its possible now. It is truly incredible. 🤯
Vincent François-Lavet retweeted
Announcing NVIDIA Nemotron 3 Super!
💚120B-12A Hybrid SSM Latent MoE, designed for Blackwell
💚36 on AAIndex v4
💚up to 2.2X faster than GPT-OSS-120B in FP4
💚Open data, open recipe, open weights
Models, Tech report, etc. here:
research.nvidia.com/labs/nem…
And yes, Ultra is coming!





























