HeyJaredBest AI papers explained
Cut through the noise. We curate and break down the most important AI papers so you don’t have to.
- Indexed episodes, last 90 days
- 49
- Latest publication
- Sep 17, 2026
- Audience
- Checking…
- Earliest in this view
- Jul 4, 2026
Latest episodes
Thinking with Looped Flows (opens the original)
Read excerpt
This paper introduces looped flows, a novel framework designed to enhance the reasoning capabilities of neural networks by merging recurrent hidden states with probability flow models. Traditional looped models often struggle with training instability because they cannot effectively backpropagate through many iterations, but this approach sidesteps that issue by using local denoising objectives across various noise levels. By gradually reducing noise and sharing information across steps, the mod
Multi-Turn LLM Conversations under the Least-Recently-Used Policy: Mean-Field Asymptotics (opens the original)
Read excerpt
This paper introduces a Mean-Field Asymptotic framework designed to estimate the hit ratio in multi-turn large language model (LLM) serving systems. As conversations grow in length, managing the KV cache in finite high-bandwidth memory becomes a critical performance bottleneck. The authors model these dynamics using the least-recently-used (LRU) eviction policy to determine which conversation histories are retained or discarded. By analyzing the system as memory capacity and arrival rates scale
Breaking the Token Ceiling: Distilling Smaller, Stronger Byte Models (opens the original)
Read excerpt
This research introduces Marginalize-It and End-Of-Token, two novel methods for efficiently distilling large token-based language models into smaller, more capable byte-level models. By evaluating dense transformers across various compute budgets, the study reveals that while token models perform better with limited resources, byte models achieve a significantly higher performance ceiling as training data increases. The End-Of-Token approach proves particularly effective, as it preserves the tea
Thinking to Recall: How Reasoning Unlocks Parametric Knowledge in LLMs (opens the original)
Read excerpt
This research explores how reasoning helps Large Language Models (LLMs) answer simple, single-hop factual questions that do not logically require step-by-step thinking. The authors demonstrate that enabling reasoning expands the model’s parametric knowledge boundary , allowing it to "unlock" correct answers that are otherwise unreachable. This improvement is driven by two primary mechanisms: a computational buffer effect where extra tokens allow for more latent processing, and factual priming wh
Tail-Likelihood Reinforcement Learning (opens the original)
Read excerpt
This paper introduces Tail-Likelihood Reinforcement Learning (TailRL) , a novel optimization framework designed to improve how generative policies handle continuous rewards. Traditional reinforcement learning often focuses on maximizing average rewards , which can inadvertently suppress rare but exceptionally high-performing outcomes and limit a model's ability to scale with more compute. TailRL addresses this by maximizing the log-probability of exceeding diverse reward thresholds, effectively
Publishing over time
Last 90 days. Choose a month to open its work.
Recurring subjects
Named in the text we hold. One piece can cover several.
Audience
No verified audience measurement yet.
About this data
Counts cover the work we have indexed. Tone needs enough text and a confident classification. Excerpts and episode notes are not full articles or transcripts.
Identity or attribution wrong? Suggest a correction.