Pinned Tweet
activation functions drama
from: arxiv.org/pdf/1606.08415
logprob retweeted
new paper (and last one from my postdoc):
arxiv.org/abs/2610.16518
we analyze WSD schedules for least-squares problems.
this is excellent work from Noé, who lead this paper during his internship at Inria, together with @BachFrancis .
logprob retweeted
DeltaNet-PC is out! It turns out that predictive coding offered a native mechanism for test-time memorization of sequential data all along. The crucial insight was to treat updates to the fast associative memory as an inferred latent variable, not a long term learned weight.
logprob retweeted
New research shows transformers do build internal world models, but localization failures stem from feature superposition. Mechanistic analysis reveals how representation and routing inte…
arxiv.org/abs/2609.21748
#MachineLearning #AI #LLM #DeepLearning #AgenticAI
logprob retweeted
My @PolymathicAI internship project is out! 🎉 We ask, can a foundation model trained on simulated physical systems predict how living embryo tissue flows? We finetuned Walrus on 12 wild-type 🪰Drosophila blastoderm videos and tested it on unseen conditions (vid from @embl )
logprob retweeted
More on this here: gklambauer.github.io/recurre…
Looped Transformers are a hot topic these days
And these 10 new papers are really worth your attention.
▪️ Recurrent Looped Transformer
▪️ Looped Prediction Transformer (LPT)
▪️ Recursive Multi-Agent Systems (based on looped transformer)
▪️ Loop Flow Transformers (LiFT)
▪️ Looped Diffusion Transformer
▪️ LAST: Looped Audio Spectrogram Transformer
▪️ LoopCD
▪️ Hyperloop Transformer
▪️ OperLoop
▪️ LoopQuant
Here is our quick guide to what they are, how they work and when to use each.: turingpost.com/p/10-looped-t…
logprob retweeted
A looped transformer has to know when to stop, and its state has to stay bounded while it loops.
We introduce Spherical Fixed-Point Reasoners (SFPRM) 🌐: loop on the unit sphere, where each step is an angle, and stop once the angle is small enough.
🧵 (1/9)
logprob retweeted
Want to understand LLMs? Start with how neural networks store memories.
This idea deeply shapes how I think about them, so I'm glad to see @heyyalexwang explaining it this clearly, and to see it getting the attention it deserves.
Using this occasion to share some of the recent research I’ve been part of on using this perspective to better understand LLMs:
1. LLMs are extremely good at storing knowledge, but how do they learn to do so? We study this question in arxiv.org/abs/2503.21676, showing that attention circuits need to be created before models can store memories. These attention circuits emerge during training; we study how this depends on data in arxiv.org/abs/2505.17863.
2. The memory setup in the blog, and the standard one more generally, is to have only one possible value, e.g. a next token. In practice, LLMs have to model different possible future tokens; we show in arxiv.org/abs/2608.15448 that such “ambiguity” requires larger networks to store!
3. What happens when a network with a lot of knowledge learns new memories: it catastrophically forgets. This is a nice toy setup to systematically study it and there are some surprising other phenomena that one can study. In arxiv.org/abs/2610.08718 we study spurious forgetting: in some cases there is forgetting in the sense that memories cannot be recalled, but there are still present if probing the network in the right way.
4. One can see post-training as a slight modifications of the memory of the network. We use this perspective in arxiv.org/abs/2610.03529 to give some intuition about how different distillation strategies affect model behavior; this is imo a cool setup to understand some distillation behaviors.
Bonus. From the arguments in the quoted blog, one can heuristically derive scaling laws. I gave a tutorial on that (which reviews some of the work linked in the blog) nicolaszucchet.github.io/Tut…; there is even a colab where you can train your own memories and derive their scaling laws!
There are still many open questions related to memories, knowledge and LLMs, and I hope to see a lot more of cool research to do in this direction!
logprob retweeted
Looped Transformers are a hot topic these days
And these 10 new papers are really worth your attention.
▪️ Recurrent Looped Transformer
▪️ Looped Prediction Transformer (LPT)
▪️ Recursive Multi-Agent Systems (based on looped transformer)
▪️ Loop Flow Transformers (LiFT)
▪️ Looped Diffusion Transformer
▪️ LAST: Looped Audio Spectrogram Transformer
▪️ LoopCD
▪️ Hyperloop Transformer
▪️ OperLoop
▪️ LoopQuant
Here is our quick guide to what they are, how they work and when to use each.: turingpost.com/p/10-looped-t…
logprob retweeted
1/
On Priority Sort, a 486K-parameter recurrent network beats a full-context causal Transformer: 4.1e-3 test BCE vs 2.7e-2 (and 1.4e-2 for DNC).
The trade-off? Running attention every step pushes Copy-100 peak VRAM to 22.3 GiB vs 634.5 MiB for CTM. 🧵
logprob retweeted
📚 Open Access (free)
Kockelman, P. (2025). Mathematical Models of Meaning: A Dynamical Systems Approach to Possible World Semiotics. MIT Press. doi.org/10.7551/mitpress/156…
logprob retweeted
In reading group reviewing flow models, I realized I didn't understand the change-of-variables rule as fully as I probably should. So I put together this blog post and collection of visuals to help me more fully understand the Jacobian-inverse term. 💪
michaeljohncooper.com/writin…
logprob retweeted
Everyone wants to have solved a hard problem, but almost nobody wants to live inside the grind of actually solving it. The breakthroughs belong to the few who are obsessed with the process, not just the idea of the outcome
logprob retweeted
Fields Medalist Cédric Villani has raised a disturbing question about the future of mathematics.
In a new interview, he reveals that some mathematicians are already questioning whether they should accept new PhD students as AI advances.
Just one year ago, he considered mathematics among the sciences least affected by AI. Now, he thinks it may be among the most affected.
Could universities eventually become places where people study human mathematical reasoning as an ancient art?
Full interview👇
The Dust paper is really big. A breakthrough.
After spending a few days to really digest it though, I'm somewhat disheartened that so much of it is implementation details which are not explained. I'm working on a blog post to reverse engineer the math, methods, and choices.
Backprop has been the only credit assignment algorithm capable of training large neural nets.
Introducing Dust, the first zeroth-order method to pretrain transformers to approach and sometimes even *exceed* backprop with large amounts of computation (bitter lesson!)
- Dust is on the order of 1,000 to 10,000x more compute efficient than EGGROLL, the state-of-the-art ES method, for training transformers.
- We chose pretraining transformers because it's arguably the hardest task possible for zeroth-order optimization.
- Search in high dimensions is really misunderstood: zeroth-order usually gets better with overparameterization, not worse, i.e. at a fixed population size, larger models (up to 120x) reach a lower loss than smaller ones.
- Backprop-like gradients emerge from a large population of activation perturbations, and the alignment holds up at every scale we tested, up to 1B tokens, which is critical for scaling.
The core idea is a *virtual population*, which helps scale to large populations in transformers by perturbing activations in parallel.
w/ @bishmdl76, @cs_serdar, @akshayvegesna
logprob retweeted
how much can models remember?
there’s a neat perspective on neural networks that deserves to be more widely known
here’s how you could have invented every layer of the transformer from memory
(1/n) from my new blog post!
logprob retweeted
Hey all, we have a new paper: Dino Forcing Flow Models: Do not denoise what you can predict.
Tldr; Denoising image and predicting (not denoising) related deterministic information (like dino) provides a model with faster convergence!
Read the paper here: arxiv.org/abs/2610.11751v1
logprob retweeted
Introducing Langevin Flow Maps
TLDR: Neural Network Potentials that learn their own stochastic pathwise solution for faster simulation.
- Transferable across molecular systems.
- Transition dynamics are preserved.
- No trajectory data are required.
Work together with @sgmccallum, supervised by @AlexanderTong7, and @JamesFosterBath.
Arxiv: arxiv.org/abs/2610.05998
Data: huggingface.co/datasets/nikl…
Code: github.com/sammccallum/lfm
logprob retweeted
Replying to @nickcammarata
this is cool work, but i think people are overupdating on how optimistic to be about interp.
in particular, we need to more rigorously evaluate explanations, rather than just going off vibes. imo if you can't simulate a neuron you haven't really explained it. my guess is simulating the neurons is way harder than finding plausible explanations. I have a post on this in the works.
(i know the blog talks argues simulations are bad, but i think all of the downsides described are avoided by looking at KL instead of neuron correlation.)
logprob retweeted
interpretability might be the most important scientific problem in the world right now, as I don't think we can solve alignment if we don't know what we're building. I think I have good news about it. I co-authored early work in mechanistic interpretability at OpenAI and came away pessimistic, because neural networks appeared to fold into arbitrary tangled knots. years later, I started openai's first large-scale automated interpretability project, finding about 2% of neurons legible with the primitive tools we had
with modern agentic tools and a much closer look, the picture looks totally different. the vast majority in models up to trillions of parameters are legible, and their circuits beautiful. many famous examples of tangled neurons turned out to be misunderstood. The roadblocks I expected mostly aren't there. I now think ambitious interpretability will be solved by the time we need it most, and possibly quite soon, as automated scientists keep improving. it may be a bitter lesson for interpretability: the simple thing, at absurd scale, works
already-clean.goodfire.com/































