Matthew(マシュー)🥭Hendricks (@tinycrops) header
Matthew(マシュー)🥭Hendricks (@tinycrops) profile picture

hypermedia production and generative ASCII art

Rochester, NY
Joined May 2015
Photo by Matthew(マシュー)🥭Hendricks (@tinycrops)Photo by Matthew(マシュー)🥭Hendricks (@tinycrops)Photo by Matthew(マシュー)🥭Hendricks (@tinycrops)Photo by Matthew(マシュー)🥭Hendricks (@tinycrops)Photo by Matthew(マシュー)🥭Hendricks (@tinycrops)Photo by Matthew(マシュー)🥭Hendricks (@tinycrops)Photo by Matthew(マシュー)🥭Hendricks (@tinycrops)
Matthew(マシュー)🥭Hendricks retweeted
as promised... vst3 + reaper extension im in shock rn at how fun this is
i made automation lanes for stable audio 3 loras still learning how to play them coming to every DAW shortly
1
3
1
49
2,342
Matthew(マシュー)🥭Hendricks retweeted
this guy figured out how to leak your exact location from any video with sound using the Doppler curves of nearby airplanes
593
1,891
637
34,925
3,652,377
Matthew(マシュー)🥭Hendricks retweeted
Making the ASCII MMORPG of my dreams! It's amazing how changing the grid and choosing the right symbols can make an enemy look terrifyingly realistic. Ansenjeo. #mmorpg #indiegames #ascii #pcgaming
17
13
1
291
4,674
Matthew(マシュー)🥭Hendricks retweeted
go read findings dot md paragraph 9 immediately wtf this is amazing
Replying to @treetowntree
@treetowntree and i created neuron lens: a database of every single neuron and attention head in qwen 3 8b and gemma 4 12b read using the R-lens (a J-lens variant) and what we call the "S-lens". you can find it at neuron-lens.com/, along with the tools we used to make it. using the R-lens to read neurons' input and output projections turns out to be very effective at determining what a neuron does. we're able to legibly read what a majority of neurons do when fired: the lens qualitatively predicts the result of steering over 90% of the time! the same trick lets us read attention heads' QK circuits and OV circuits, showing us both what they attend to and what they do with it. however, the R-lens has two important flaws: its accuracy degrades in early layers, and it can't separate the MLP block and the attention block. we found ways around both these issues. we first modified the r-lens by fitting it on input tokens rather than output tokens to get the s-lens, which is accurate in early layers but inaccurate in late layers. we then fitted R- and S-lenses to the activations after attention but before the MLP to get "mid-lenses", which are much better at deciphering MLP inputs and attention outputs. using both of these techniques, we were able to interpret most of the models' layers.
5
14
1
248
14,016
Matthew(マシュー)🥭Hendricks retweeted
agent thinking, visualized tinyurl.com/yfrcj33u
why isn't agent thinking visual?
20
18
3
715
33,908
Matthew(マシュー)🥭Hendricks retweeted
Your unified models are actually not so unified in the embedding space. Why? The structural unification (i.e., shared embedding) can only force the model to learn in the unified manner, but the embedding itself indeed has preferences for different tasks: some parts favor understanding, some favor generation. There should be a way to unify this insight into unified model training. Introducing FlexUMM, a flexible representation learning paradigm for training your UMMs that reduces computation cost while achieving better performance. 🤿Paper and code: arxiv.org/abs/2610.22682
7
1
60
3,516
Matthew(マシュー)🥭Hendricks retweeted
i made automation lanes for stable audio 3 loras still learning how to play them coming to every DAW shortly
3
4
4
104
9,196
Matthew(マシュー)🥭Hendricks retweeted
Computing with synchronizing oscillators, a thread
1
38
2
301
15,532
Matthew(マシュー)🥭Hendricks retweeted
Our opening animation and blog didn't fully show the interesting dynamics for languages like CJK that have multi-byte characters. In Chinese most characters take up 3 bytes, and when learning end-to-end from bytes it's not even trivial to get the model to chunk these into characters. Early in training this H-Net incorrectly sub-divides characters, but it eventually figures it out. Actually this was a prominent issue in the original H-Net - and even BPE doesn't get it right on rare characters. The blog has some examples!
I've always believed that intelligence should come from simple, general building blocks that learn their own abstractions directly from raw data; in other words, the bitter lesson. I think we're finally seeing a real step towards AI that can learn from all data. Language modeling on raw bytes is a microcosm of this ideal, and to me it's a central problem in AI: if we can't build LLMs that learn end-to-end from bytes, how will we handle the rest of the world's data that we understand even less? Last year we introduced hierarchical networks (H-Nets) as a first step. Our new version finds up to 3-5x efficiency gains in controlled scaling law experiments, and at larger scale matches an open-source model trained on 11T tokens with ~10x less data and compute. The posts below walk through what we found and why we think it works.
14
39
3
389
42,990
Matthew(マシュー)🥭Hendricks retweeted
2
2
60
2,949
Matthew(マシュー)🥭Hendricks retweeted
One of the subagents just made a figure so bad that the lead Claude immediately killed them and replaced them with a new agent.
78
133
20
8,593
174,432
Matthew(マシュー)🥭Hendricks retweeted
1/10 🔮 Can a world model learn to make its own future more predictable?* In Latent-Foresight, we jointly learn a compact latent representation of visual foundation model (VFM) features and a generative dynamics model that predicts their future. Here's how 👇
5
28
2
186
12,054
Matthew(マシュー)🥭Hendricks retweeted
are we for fucking real right now 😭
26
46
9
963
101,624
Matthew(マシュー)🥭Hendricks retweeted
"did you read the new @ThinkWiselyMatt post?" "no, did you?" "no"
You’re unable to view this Post because this account owner limits who can view their Posts. Learn more
1
3
1
3
192
Matthew(マシュー)🥭Hendricks retweeted
Uploaded the camera-ready version of our #NeurIPS2026 paper: "Generalized Wasserstein Flow Matching: Nested Couplings for Point Cloud Generation" → Multisample Flow Matching in Wasserstein space 📄 arxiv.org/abs/2605.08424 with R. Duong & G.Steidl :)
1
10
1
79
4,938
Matthew(マシュー)🥭Hendricks retweeted
Five hundred birds fly at one constant speed. At each step every bird turns a tenth of the way toward the mean heading of the birds within radius R, plus a random wobble of width η. No bird sees the whole flock. For small η the local rule still settles on one shared heading, and the order φ = |(1/N) ∑ e^(iθₖ)| climbs from 0.02 to 0.99. Past a critical η the order is lost. Vicsek and coauthors described this phase transition in 1995 naming it Vicsek Model.
3
18
3
173
7,530
Matthew(マシュー)🥭Hendricks retweeted
I have a mild obsession with symmetry and took some time to write-up a blog post about my work on creating an atlas of dynamic simulations of all 2D wallpaper groups. So visually cool and maybe you'll learn something new about symmetry. diffuse.one/p/b1-001
4
5
53
2,984
Matthew(マシュー)🥭Hendricks retweeted
World models that see only through the players' eyes forget what happens out of view. OverSeer adds a few fixed cameras and generates every view together, so the world stays consistent over time and across players. 📄 arxiv.org/abs/2610.28554 🌐 runjiali-rl.github.io/OverSe… 🧵👇
11
24
2
139
8,549
Matthew(マシュー)🥭Hendricks retweeted
Can a neural network learn ~2^100 LDPC (Low-Density Parity-Check) codewords from just 10-20 examples? 👉 Grokking in LLMs and memorization-to-generalization transition in diffusion models are related phenomena — the model learns true process of data generation from a small number of training samples. 👉 It is hard to study this phenomenon analytically on natural datasets. 👉 LDPC codeword generation is a precise mathematical process in which the codewords are constructed as solutions to parity check equations. 👉 We train a Dense Associative Memory with a tiny fraction of codewords from the full vocabulary, without giving the network the generation algorithm itself. The model manages to learn the entire vocabulary on its own. It turns out, you only need log(n) samples to learn the entire space of 2^n codewords. 👉 The network only needs approximately P=10-20 training examples to correctly learn the full vocabulary containing ~2^100 codewords. Our new paper with Andy Lucas: arxiv.org/abs/2610.27384. Let us know what you think!
6
16
1
118
5,174