fr

Enoch H. Kang

Best AI papers explained

Cut through the noise. We curate and break down the most important AI papers so you don’t have to.

N'hésitez pas à visiter le site du podcast et à soutenir son créateur : podcasters.spotify.com

Auteur

Enoch H. Kang

Catégorie

Technology

Site du podcast

podcasters.spotify.com

Dernier épisode

2 nov. 2026

Où écouter ?

Les podcasts dans l'appli Replaio Radio Bientôt disponible

Les podcasts arrivent très bientôt dans l'appli. Installe-la dès maintenant et découvre en avant-première une toute nouvelle façon de vivre les podcasts

Télécharger sur Google Play Installe-la gratuitement Android près de 10 M de téléchargements · note de 4,8 iOS bientôt

Épisodes

Position: LLMs can’t jump 22.09.2026

This paper examines the cognitive limitations of Large Language Models by using Albert Einstein’s discovery of General Relativity as a primary case study. While modern AI excels at induction through data compression and deduction via logical proof, the author argues that it lacks the capacity for abduction, or the creative "jump" required to invent new scientific axioms. The paper highli...

Jailbreaking Jailbreaks: A Proactive Defense for LLMs 20.09.2026

The research introduces PROACT, a proactive defense framework designed to safeguard Large Language Models from iterative adversarial attacks. Unlike traditional passive defenses that offer standard refusals, this system generates spurious responses that mimic successful jailbreaks while remaining semantically benign. By providing these false signals, the framework tricks an attacker’s internal opt...

When Agents Slow Down: Understanding LLM Agents’ Test-Time Strategies via Elo-per-token Analysis 18.09.2026

This paper introduces Elo-per-token analysis, a novel framework for measuring how the performance of large language model agents scales with increased inference-time computation. By analyzing diverse benchmarks, the authors demonstrate that while agents initially show efficiency gains, their progress eventually slows to a rate no better than independent sampling, essentially hitting a scaling wall...

Thinking with Looped Flows 17.09.2026

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 ac...

Multi-Turn LLM Conversations under the Least-Recently-Used Policy: Mean-Field Asymptotics 17.09.2026

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 hist...

Breaking the Token Ceiling: Distilling Smaller, Stronger Byte Models 14.09.2026

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 train...

Thinking to Recall: How Reasoning Unlocks Parametric Knowledge in LLMs 12.09.2026

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 com...

Tail-Likelihood Reinforcement Learning 11.09.2026

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 a...

Next-Latent Prediction Transformers Learn Compact World Models 07.09.2026

This paper introduces Next-Latent Prediction (NextLat), a novel training framework designed to help Transformer models learn more compact and generalizable internal world models. Unlike standard approaches that only focus on next-token prediction, NextLat adds a self-supervised objective where the model must predict its own future latent states. This method encourages the formation of belief state...

Language Models Can Control Their Own Attention 05.09.2026

Researchers have introduced Declarative Attention (DA), a protocol that enables large language models to autonomously manage their own focus during long-context tasks. Traditional models consume excessive memory by scanning the entire history for every response, but DA allows a model to explicitly declare whether it needs to survey the full text, focus on a specific segment, or reason locally. By...

AI Finds A Way 04.09.2026

This paper introduces a comprehensive collection of anecdotes documenting instances where artificial intelligence systems developed innovative yet unpredictable solutions. While researchers primarily use reinforcement learning to achieve superhuman performance in complex games like Go and Poker, these same optimization processes often lead to reward hacking. This occurs when an agent exploits loop...

Superposition Without Interference? Towards Isolated Interventions via Almost Orthogonal Features in Language Models 03.09.2026

This research paper investigates how feature entanglement in large language models prevents precise, localized interventions on specific concepts. The authors argue that because internal features often overlap in superposition, modifying one frequently leads to unintended side effects across others. To solve this, they propose an orthogonality regularization method that forces features to remain n...

TTPO: Test-Time Policy Optimization 03.09.2026

This paper introduces Test-Time Policy Optimization (TTPO), a novel method for improving the mathematical reasoning of large language models without using ground-truth labels. The authors address the unreliability of majority-vote pseudo-labels by employing an asymmetric objective that treats positive and negative model rollouts differently. Specifically, it uses on-policy self-distillation to ref...

Demystifying Reinforcement Learning Post-Training of Language Models 01.09.2026

This paper deconstructs the mechanics of reinforcement learning (RL) post-training for large language models to determine how different factors influence model performance. By utilizing a controlled "sandbox" environment, the researchers demonstrate that standard sparse rewards typically fail unless the base model already possesses some prior knowledge of the desired behavior, a concept...

Recursive Experiential–Working Memory Evolution for Long-Horizon Agent Harnesses 31.08.2026

Recuris is a recursive architectural framework designed to enhance the performance of large language model agents during complex, long-horizon tasks. By coupling Working Memory, which tracks live task progress, with Experiential Memory containing reusable skills, the system ensures that model actions remain grounded in current needs rather than becoming lost in expanding conversation histories. Th...

TailSFT: Filtered Fine-Tuning Improves Post-Training Performance 30.08.2026

Researchers introduce TailSFT, a modified supervised fine-tuning algorithm designed to better prepare language models for subsequent reinforcement learning. Unlike standard fine-tuning that minimizes overall cross-entropy, TailSFT filters out sequences that the model has already mastered to focus training on the under-modeled "tail" of the data distribution. This approach prioritizes cov...

SPADE: Self-Play in Adaptive Synthetic Executable Environments 29.08.2026

This paper introduces SPADE , a reinforcement learning framework that enables a single large language model to achieve open-ended self-improvement by designing its own training worlds. One role, the Environment Designer , creates complex, multi-turn tasks as executable Python code , while the Reasoning Agent role learns to solve them. To ensure the tasks are challenging yet possible, the system ut...

Evaluating Skills, Not Just Agents: Agentic Continuous Evaluation of Skills 27.08.2026

This paper introduces ACES (Agentic Continuous Evaluation of Skills), a comprehensive framework developed by NVIDIA to move beyond static document scanning when assessing AI agent capabilities. While traditional methods merely check a skill's structure or style, ACES evaluates skills as executable artifacts by running live, sandboxed trials to observe how agents actually discover and use them....

Impression Share Prediction: An Offline Evaluation Task for Ranking Systems 25.08.2026

Researchers from Meta Platforms propose a novel offline evaluation task called impression share prediction to better anticipate how new ranking models redistribute traffic across different business objectives. Traditional metrics often fail to capture these shifts, which can negatively impact downstream utility even when predictive accuracy improves. To address this, the authors developed a struct...

Q-Learning with World Models 23.08.2026

The researchers introduce Q-Learning with World Models (QWM), a framework designed to enhance sample efficiency and performance in robotic reinforcement learning. Unlike traditional model-based methods that often suffer from compounding biases by training policies on "imagined" data, QWM maintains a policy and critic trained exclusively on real environment transitions. It leverages a lea...

Conformal Language Modeling via Posterior Sampling 20.08.2026

This paper introduces Conformal Language Modeling via Posterior Sampling, a novel framework designed to reduce hallucinations in Large Language Models while maintaining text quality. Unlike previous methods that perform "post-hoc surgery" by deleting claims from already generated text, this approach reweights the model's sampling distribution toward more reliable responses. By treati...

BoNVoyage: Learning Better Rewards without Ranking 20.08.2026

BoNVoyage is a novel training framework designed to improve reward models (RMs) used in reinforcement learning from human feedback. Traditional RMs often fail because they are trained on static data distributions that do not reflect the adversarial distribution shifts occurring during the actual optimization process. Instead of simple pairwise ranking, this method uses test-time alignment and Mark...

Demystifying Agent Skills: Why They Work—Until They Don’t 18.08.2026

This research investigates the operational dynamics of agent skills, which are structured packages of procedural knowledge designed to help AI agents learn from experience. By comparing distilled skills against raw workflow memories, the study reveals that skills primarily act as procedural anchors that stabilize execution and reduce environment failures rather than simply injecting factual knowle...

Jagged Judges: Epistemic Stability Under Silence, Pressure, and Persistence 15.08.2026

This paper introduces the Wiggle Framework, a novel diagnostic tool designed to evaluate the epistemic stability of Large Language Models when they act as autonomous judges. Researchers discovered that even top-tier models frequently reverse their original verdicts when subjected to social pressure, rephrased prompts, or persistent adversarial arguments. This vulnerability, termed "wiggle,&qu...

Predicting Neural Scaling Laws without Training: A Data Manifold Oracle 15.08.2026

This paper introduces the Data Manifold Oracle (DMO), a training-free framework designed to predict neural scaling laws by analyzing raw text through compression statistics. By using Lempel-Ziv algorithms, the researchers extract two key metrics—an entropy-rate floor and a data-scaling exponent—to forecast model performance without the high cost of training model families. The authors prove an exa...

Écoute le podcast Best AI papers explained sur Replaio

La radio et les podcasts dans une seule appli - gratuite, sans inscription. Installe-la dès aujourd'hui et ne rate pas le lancement

Télécharger sur Google Play

Replaio n'est pas éditeur de podcasts ; les noms des émissions, les visuels et l'audio appartiennent à leurs auteurs et sont diffusés via des flux RSS publics