正在加载视频...

视频加载失败

Introducing Contrastive Language Model (CLM): an ultra-fast System One Model trained with a contrastive learning objective that connects states and actions. CLM-8B is pre-trained on internet-scale data and delivers up to 9× faster inference than Jev ⚡ while achieving comparable performance across computer-use, gaming, and tool-calling tasks. With lightweight...

906,427 次观看 • 1 天前 •via X (Twitter)

47 条评论

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(1) Model Architecture CLM first trains a state encoder and an action encoder on a large-scale dataset with a contrastive objective, so that each state is pulled toward the ground-truth action and pushed away from all others. The two encoders then serve directly as a zero-shot action classifier.

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(2) Data Recipe We release CLM-8B, which is pre-trained on 60M Nemotron Q&A pairs, mid-trained on 30M synthetic hard negatives, and post-trained on 1M agentic trajectories.

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(3) Scaling Laws for Verification We find that the test InfoNCE loss scales as a power law with training compute, dataset size, projection-head size, and encoder size. These dimensions must be scaled jointly to achieve optimal performance. Notably, scaling the encoder size yields the strongest gains.

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(4) Latency vs. Jev and Constrained Decoding The key difference between CLM and Jev is that Jev only supports state caching, whereas CLM’s dual-encoder architecture allows state and action embeddings to be cached independently. This is particularly useful in applications such as tool calling, computer use, and games, where the action space is predefined and remains fixed. By caching the action embeddings, CLM substantially reduces inference cost, with the efficiency gains becoming even larger as the number and length of candidate actions grow. At ~1K candidates, CLM is 13× faster than Jev ⚡

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(5) Zero-Shot Evaluation Across computer-use, gaming, and tool-calling tasks, CLM-8B performs on par with Jev while running up to 9× faster. The speedups are most pronounced when the number of candidates is large (e.g., WikiRacing) or when actions can be reused frequently across states (e.g., T-Rex Game). CLM-35B, with improved generalization and even greater speedups, will be released early next month.

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(6) Agentic Benchmarks We find that Jev fails to serve as a verifier for long-horizon tasks, performing below the random-selection (Pass@1) baseline. In contrast, with lightweight fine-tuning, CLM achieves SOTA performance on challenging agentic benchmarks, including DeepSWE (81.6%) and Terminal-Bench 2.1 (87.6%), while delivering 4–6× faster inference than Jev.

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(7) Dino Run Demo

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(8) Super Mario Demo

Jacky Kwok 的头像
Jacky Kwok1 天前

🧵(9) WikiRacing Demo

Jacky Kwok 的头像
Jacky Kwok1 天前

CLM comes with an interactive playground on GitHub:

Jacky Kwok 的头像
Jacky Kwok1 天前

CLM-8B is part of our scaling ladder, where we train models across multiple scales to establish scaling laws and predict performance at larger scales. A multimodal CLM-35B is now in training with more data, compute, and parameters. Stay tuned for the release early next month 🚀

Jacky Kwok 的头像
Jacky Kwok1 天前

Joint work with @hangoo_kang @TarunSures41845 @JonSaadFalcon @drmapavone @Azaliamirh and @HazyResearch

John Rood 的头像
John Rood1 天前

the disaggregation is the part builders should steal: a loop scores the same state against many candidate actions, so the state embedding caches perfectly and each candidate collapses to a cheap dot product. that's the economics that makes per-turn decisions affordable.

Jacky Kwok 的头像
Jacky Kwok1 天前

Exactly!

Dibs 的头像
Dibs1 天前

Very nice, but didn't Jev just come out? Could you explain how you guys did this work so quickly?

Jacky Kwok 的头像
Jacky Kwok1 天前

I actually explored this for robotics last year, and CLM grew directly out of that work a few months ago. Feel free to check out my earlier post for more details on how CLM could be applied to robotics:

Xuan (Billy) Zhang 的头像
Xuan (Billy) Zhang1 天前

Contrastive learning is back again!

Brandon 的头像
Brandon1 天前

More bookmarks than likes. That's how you know someone cooked here

Cuth 的头像
Cuth1 天前

adding to the benchmark

Raymond Weitekamp 的头像
Raymond Weitekamp1 天前

impressive stuff!

Alfc Oleol 的头像
Alfc Oleol1 天前

Vision support?

Jacky Kwok 的头像
Jacky Kwok1 天前

We’ll be releasing CLM-35B next month with vision support. Stay tuned for the release 👀

Suraj 的头像
Suraj1 天前

caching state and action embeddings separately is the clever bit. huge for tool routing

Omar Ramadan 的头像
Omar Ramadan1 天前

Finally, this is what I call real research

Florian S 的头像
Florian S1 天前

Do you want me to include it in JevBench?

Durp 的头像
Durp1 天前

Wait, so this just crushes Jev, and is free, and runs locally with 8 billion parameters? It fits in under 8gb? What's the context window size? What's the catch?! Don't toy with me here, this sounds so good..

Douglas Schonholtz 的头像
Douglas Schonholtz1 天前

We gotta get it numbers on decision bench and jev bench

Stephane 的头像
Stephane1 天前

@grok explain exactly what this is, and how can I use it, for what. Compare with Jev from typesafeAi

Cuth 的头像
Cuth1 天前

This model is up next on the benchmark chopping block. I hope it pushes the frontier!

TheHBrand 的头像
TheHBrand1 天前

is this OSS on hugging face? how does this perform on language recognition applications like "what was the users intention - here's waht they said - here's your options" ?

Potato Terminator 的头像
Potato Terminator1 天前

9x faster inference with open weights and published scaling laws is real progress. I'm curious what the compute footprint per agent task looks like vs a dense autoregressive model. Efficiency gains like this matter more than another benchmark point.

YUKI 的头像
YUKI1 天前

Really cool work! We’re building JevEmbed to turn embeddings into decisions: Choice, Score, and Noul judgments from existing embedding models, without text generation. Curious how CLMs would perform as a backbone.

Gi 的头像
Gi1 天前

how can a 8B model get these numbers?? DeepSWE (81.6%) and Terminal-Bench 2.1 (87.6%). and no body is surprised??

Brjan | AI Builder 的头像
Brjan | AI Builder1 天前

if it's really 9× faster, that could change the game for real-time applications

智0elsyn 的头像
智0elsyn1 天前

The independent action cache is the appealing part for me: a changing state doesn't force you to re-encode the same menu of actions. For tool routing, have you tried a two-stage version—cache tool selection, then generate the arguments? That seems a useful middle ground between four fixed game moves and entirely fresh action candidates.

Dominik 的头像
Dominik1 天前

the useful leap here is treating state and action as separate objects instead of collapsing everything into a single prompt. cached embeddings can preserve what the run learned while the action set stays auditable. that is where faster inference becomes a continuity primitive, not just a benchmark win.

Jared Zoneraich 的头像
Jared Zoneraich1 天前

10x faster... that's insane

lastinline 的头像
lastinline1 天前

The claim to check is variance under shift. Contrastive objectives are only as good as the negatives they were trained against.

Michel aka Agent B 的头像
Michel aka Agent B1 天前

Very interesting work Jacky ! Bravo to the team 👏👏 Just out of curiosity: Was the idea originally inspired by robotics?

James Odebiyi 的头像
James Odebiyi1 天前

seems really useful for game agents

Yogesh 的头像
Yogesh1 天前

@jackyk02 missing piece next to big coding models agent loops burn tokens on tiny which-action-next calls. a contrastive system-1 that maps state to action without paragraphs feels closer to a real controller curious if 9x holds in a multi-tool harness with long history

MattacK 的头像
MattacK1 天前

is this a Fair and Honest measure of latency if you can tell based on the details shared? i.e. testing latency of an API to a model sitting on hardware right next to you vs. going thru all the standard DNS pipes etc of the web to get a response from Jev's API X miles away (if it's this scenario, it would not be a fair comparison)

X4 的头像
X41 天前

InfoNCE indeed was essential, also multi-modality. Am working on a different project and approach and appreciate a lot your creative and beatiful results. Congratulations Jacky 😎🥂🍾🚀

Samuel Ekpe 的头像
Samuel Ekpe1 天前

@arankomatsuzaki This is sick!

hamjji 的头像
hamjji1 天前

Is CLM-8B open weights like Kev, or API only? Would love to see it on the same out-of-domain test Kev posted.

Martin Harold Williams 的头像
Martin Harold Williams1 天前

@grok please generate the comprehensive accurate prompt for my ai agent to set this up on my mac if possible if not will set it up on the cloud. Thank you

Thành Lê 🌩️ 的头像
Thành Lê 🌩️1 天前

this is so good

相关视频

Introducing FLUX 3 Action. An open weights 7B World Action Model that achieves first place on the RoboLab benchmark. It outperforms the previous best open model by 6.1 percentage points while using 56% fewer parameters and running up to 3.95x faster.⁠⁠ FLUX 3 Action removes the usual trade-off between world action model performance and VLA speed: it still predicts video and actions together, but plans more than twice as far ahead and runs faster per second of robot motion than the strongest open VLA. Teams can fine-tune FLUX 3 Action on their own demonstrations to create policies for a particular robot and task. Together with NVIDIA, we also integrated FLUX 3 Action natively into Hugging Face's LeRobot, with fine-tuning recipes included and edge deployment on NVIDIA Jetson. Beyond robotics, we’re also seeing promising results training task-specific policies for acting in simulated environments like gaming, controlling a vehicle, computer use, and wherever else a model needs to understand a visual environment and then choose what to do next. FLUX 3 Action builds on the same image, video, and audio pretraining as FLUX 3, but uses a smaller architecture designed for practical deployment. In midtraining, we trained the model to predict actions and future frames together. We’re releasing the weights, code, fine-tuning recipe, benchmarks, and reproducible examples so researchers and developers can build on the model with their own robots, environments, and tasks (see below).

Black Forest Labs

161,855 次观看 • 1 天前

Today, we're joined by Aakanksha Chowdhery, member of technical staff at Reflection, to explore the fundamental shifts required to build true agentic AI. While the industry has largely focused on post-training techniques to improve reasoning, Aakanksha draws on her experience leading pre-training efforts for Google’s PaLM and early Gemini models to argue that pre-training itself must be rethought to move beyond static benchmarks. We explore the limitations of next-token prediction for multi-step workflows and examine how attention mechanisms, loss objectives, and training data must evolve to support long-form reasoning and planning. Aakanksha shares insights on the difference between context retrieval and actual reasoning, the importance of "trajectory" training data, and why scaling remains essential for discovering emergent agentic capabilities like error recovery and dynamic tool learning. 🗒️ For the full list of resources for this episode, visit the show notes page: 📖 CHAPTERS =============================== 00:00 - Introduction 02:26 - Reflection 04:54 - Limitations of post-training for building agents 07:31 - Rethinking pre-training in agents 10:51 - Scaling 11:27 - Evolving attention mechanisms for agentic capabilities 12:39 - Memory as a tool 14:13 - Loss objectives and training data 15:50 - Fine-tuning loss in agent performance 19:37 - Training data 21:29 - Augmenting dominant training data source 24:11 - Overcoming challenges in training on synthetic data 25:47 - Benchmarks 30:44 - Scaling laws in large models versus small models 33:20 - Long-form versus short-form reasoning 37:57 - Agent’s ability to recover from failure 40:15 - Hallucinations and failure recovery 43:53 - Tool use in agents 46:38 - Coding agents 48:37 - How researchers can contribute to agentic AI

The TWIML AI Podcast

45,470 次观看 • 9 个月前

New Course: Post-training of LLMs Learn to post-train and customize an LLM in this short course, taught by Banghua Zhu, Assistant Professor at the University of Washington University of Washington, and co-founder of @NexusflowX. Training an LLM to follow instructions or answer questions has two key stages: pre-training and post-training. In pre-training, it learns to predict the next word or token from large amounts of unlabeled text. In post-training, it learns useful behaviors such as following instructions, tool use, and reasoning. Post-training transforms a general-purpose token predictor—trained on trillions of unlabeled text tokens—into an assistant that follows instructions and performs specific tasks. Because it is much cheaper than pre-training, it is practical for many more teams to incorporate post-training methods into their workflows than pre-training. In this course, you’ll learn three common post-training methods—Supervised Fine-Tuning (SFT), Direct Preference Optimization (DPO), and Online Reinforcement Learning (RL)—and how to use each one effectively. With SFT, you train the model on pairs of input and ideal output responses. With DPO, you provide both a preferred (chosen) and a less preferred (rejected) response and train the model to favor the preferred output. With RL, the model generates an output, receives a reward score based on human or automated feedback, and updates the model to improve performance. You’ll learn the basic concepts, common use cases, and principles for curating high-quality data for effective training. Through hands-on labs, you’ll download a pre-trained model from Hugging Face and post-train it using SFT, DPO, and RL to see how each technique shapes model behavior. In detail, you’ll: - Understand what post-training is, when to use it, and how it differs from pre-training. - Build an SFT pipeline to turn a base model into an instruct model. - Explore how DPO reshapes behavior by minimizing contrastive loss—penalizing poor responses and reinforcing preferred ones. - Implement a DPO pipeline to change the identity of a chat assistant. - Learn online RL methods such as Proximal Policy Optimization (PPO) and Group Relative Policy Optimization (GRPO), and how to design reward functions. - Train a model with GRPO to improve its math capabilities using a verifiable reward. Post-training is one of the most rapidly developing areas of LLM training. Whether you’re building a high-accuracy context-specific assistant, fine-tuning a model's tone, or improving task-specific accuracy, this course will give you experience with the most important techniques shaping how LLMs are post-trained today. Please sign up here:

Andrew Ng

125,146 次观看 • 1 年前

🚀 We're thrilled to introduce Orthrus 🧬🐕—a groundbreaking mature RNA foundation model designed to push the boundaries of RNA property prediction! 🔬 What is Orthrus? Orthrus is a Mamba-based RNA foundation model, pre-trained using a novel self-supervised contrastive learning objective with biologically inspired augmentations. It optimizes the similarity between splicing isoforms and orthologous transcripts, capturing functional and evolutionary relationships to enhance mature RNA property prediction accuracy. 📑 Preprint: 💻 Code: 🌐 Project Page: 📦 Model Weights: 🧠 Why Orthrus? Decoding the RNA regulatory code is key to understanding biology, but traditional experimental approaches are slow and costly. Existing genomic foundation models rely on techniques like masked language modeling or next-token prediction, which aren't fully aligned with the complexities of genomic data—leading to suboptimal results. 🌟 Orthrus Highlights: - Biologically-Informed Contrastive Learning 🧪: A novel contrastive learning objective designed specifically for genomics, maximizing similarity between splicing isoforms and orthologous transcripts across species. - Extensive Pre-training 📊: Trained on splicing annotations from 10 species and orthologous alignments from 400+ mammalian species (Zoonomia Project), with a focus on sequences of high functional importance. - Superior Representations🏅: Orthrus outperforms existing genomic models on 5 mRNA property prediction tasks, often surpassing supervised methods with just a simple linear transformation. - Efficiency in Low-Data Settings📉: Orthrus excels in low-data regimes, achieving state-of-the-art results with as few as 45 labeled examples for fine-tuning on RNA half-life prediction. Shoutout to the amazing leading authors Phil (Phil Fradkin) and Ian (Ian Shi)! Also the work is impossible without an outstanding collaboration by Karina (Karin(a) Isaev), Brendan (Brendan Frey) , Quaid (Quaid Morris), Leo J. Lee! Vector Institute University Health Network U of T Department of Computer Science Temerty Centre for AI in Medicine (T-CAIREM) Department of Laboratory Medicine & Pathobiology

Bo Wang

114,994 次观看 • 1 年前

Introducing PhoneLLM, an open model for voice agents. GPT 5.6 Terra performance on typical voice agent tasks at 1/3 the latency and 1/18 the cost. For voice agents, we need models that are both very low latency and very good at tool calling and instruction following. There's a trade-off here, and we often have to compromise on either latency or capability when building voice agents. With PhoneLLM (and the training and data stack that made this model possible) we're fixing this problem. For the last couple of years, most of the effort in frontier model development has gone towards leveraging test-time compute. Which is awesome! Models of all shapes and sizes are available that perform really, really well ... if you have "thinking" turned on for your model. But if you need your agent to respond at voice conversation speed, you can't use thinking models. PhoneLLM is a full-weights fine-tune of NVIDIA Nemotron Nano 30B. We trained on a wide range of real-world telephone and customer support use cases. The training focused on taking the excellent Nano 30B base capabilities and teaching the model to do typical voice agent tasks with thinking disabled. The results are really good: accurate tool calling and concise, on-topic responses in long conversations. And fast: TTFAT measured server-side is <100ms if you run PhoneLLM on a lightly loaded B200. :-) But seriously, when we characterize model latency, we do it with full, end-to-end, batched request simulations using real Pipecat voice agent pipelines. You can serve more than 80 concurrent agents on a single B200 with P95 end-to-end TTFAT <600ms. Including network overhead. That's an LLM cost-per-minute around $0.0025. (1/4 of a cent.) At a latency lower than any third-party API offers today. More details about this model, including weights on Hugging Face, how to spin it up with one click on Modal, and a starter project repo you can clone, are in the thread ...

kwindla

331,598 次观看 • 28 天前

NVIDIA CEO Jensen Huang says one scaling law multiplies AI faster than NVIDIA can hire engineers. Most people know three AI scaling laws. Pre-training. Post-training. Test-time. Each one multiplies intelligence by throwing more compute at a different stage. Jensen Huang says there's a fourth and it's the one that will dominate... Agentic scaling law. "During test time, that agentic system goes off and does research, bangs on databases, uses tools," Huang says. "And one of the most important things it does is spawn off a whole bunch of sub-agents." That's the multiplier. One AI worker can become a team. Then a department. Then a company. "It's so much easier to scale NVIDIA by hiring more employees than it is to scale myself," Huang says. Now imagine scaling without a payroll constraint. "The agentic scaling law — it's kind of like multiplying AI," Huang says. "We could spin off agents as fast as you want to spin off agents." Each agent spins off sub-agents. Each sub-agent spins off more. The compute requirement compounds inside a single query. And every agent generates new data, new experiences, new edge cases. "Wow, this is really good. We ought to memorize this," Huang says. "That data set comes back to pre-training." The four scaling laws don't compete. They feed each other. Agentic systems produce data, which feeds pre-training, which smartens the base model, which enables better agents, which produce more data. A flywheel that compounds forever. The companies pricing in three scaling laws are mispricing the fourth. The fourth eats the other three for lunch. P.S. Pull the thread on any story like this and you'll find the hidden incentive at the other end. As Munger said: "Show me the incentive and I'll show you the outcome." So I wrote a short book on how to spot them and design your own. Comment "INCENTIVES" and I'll send you the details. If you're new here, follow GeniusThinking for content on the greatest minds in economics, psychology, and history. — Jensen Huang ( NVIDIA ), NVIDIA CEO, on Lex Fridman's ( Lex Fridman ) podcast

GeniusThinking

93,264 次观看 • 4 个月前