Join us for our next BioML Seminar with Chang Yun (@chang_m_yun) from Stanford, next Monday 10/19! He will discuss ENCODE GRAMMAR, a deep learning model resource for decoding the DNA sequence logic of regulatory elements in the human genome! RSVP: luma.com/bioml-r5if

We're excited to announce the first Berkeley BioML seminar of the semester happening next Monday 10/5! Join us for a talk by Danny Reidenbach from NVIDIA on codesigning protein sequence and structure with test-time search!! luma.com/bioml-u9eh

There’s lots of buzz around agentic harnesses for robots, particularly for long horizon tasks that require complex reasoning and memory. But what will it really take to turn a reasoning agent into a reactive, reliable and low-latency robot policy? In our new paper, workspace models, we design a new memory architecture that acts as a latent harness for stronger reasoning models. Here’s why we think this might be the way forward: (1/9)

Couple weeks ago, @mtvnastya and I gave a talk at UC Berkeley's ML Club @BerkeleyML about decentralized AI. We discussed access to AI compute, verification of work, how Gonka approaches these problems, and open research questions students can contribute to. youtu.be/GFxDLDQxIs8

Excited to share our work on a model for mapping molecules to olfactory receptors to perception, out today! Check out the link in thread ⬇️

Hardware yearns for block sparse attention, yet it seems largely absent from open weight LLMs. DeepSeek developed NSA, and people speculated DeepSeek v4 would integrate it, yet it was never utilized. We have a hypothesis as to why. We found that replacing dense attention with NSA significantly degraded its ability on synthetic retrieval tasks, even when finetuned on them. On our 32k context benchmark, it scored 0.300 compared to dense attention’s 0.904. We found the reason, and how to fix most of it. Introducing COBS🌽(Cumulant Order Block Sparse Attention), with @AdiGhai18 @sanjitneelam @ZVasania @tensorpro: • Raises NSA’s 0.300 → 0.820, closing ~86% of the gap to dense • 15.15x less KV-cache read traffic than dense (just 1.21x the NSA baseline) • Lower position-wise NLL than dense in our comparison The key insight: block selection is the keystone to block sparse attention, and existing methods are mathematically stuck in storing a first-order approximation of a cumulant generating function. COBS caches a compressed second cumulant and escapes this ceiling. Details in the paper.

Deciding when to jump in and help someone—and when to hold back and let them work through it—is something humans navigate constantly. How do AI assistants handle this tradeoff? We introduce Int-Bench, a framework for evaluating interventions during problem-solving tasks.

This is Google’s new diffusion LLM, DiffusionGemma’s denoising canvas over time. Diffusion LLMs can generate tokens in flexible order. But in practice, do they just become autoregressive anyway? 1/ 🧵

We'll be closing out this semester's Berkeley BioML Seminar on 4/28 with a talk from @antoinekoehl on PEINT, a powerful deep learning framework for both phylogenetic inference and protein engineering. Sign up below! luma.com/3fbbftwy

Wrote a deep dive on implementing a language model from scratch in JAX and scaling it with distributed training! If you’re coming from PyTorch and want to see how the same ideas look in JAX, or just want a hands-on intro to distributed training, check out this blog post: chuyishang.com/blog/2026/jax… Comes with code + an assignment and test cases so you can follow along!