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.

Author

Enoch H. Kang

Category

Technology

Podcast website

podcasters.spotify.com

Latest episode

Jul 10, 2026

Where to listen?

Podcasts in the app Replaio Radio Coming soon

Podcasts are coming to the app soon. Install now and be the first to see a whole new take on podcasts

Get it on Google Play Install for free Android 5M+ downloads · 4.8 rating iOS soon

Episodes

Prompt Curriculum Learning for Efficient LLM Post-Training 05.10.2025

This paper Prompt Curriculum Learning (PCL) , a novel and efficient reinforcement learning (RL) algorithm for post-training large language models (LLMs), particularly for reasoning tasks. The research first conducts a systematic investigation, finding that the optimal training batch size occurs at the transition point between sublinear and linear generation-time scaling and that prompts of interme...

Personalizing Reinforcement Learning from Human Feedback with Variational Preference Learning 04.10.2025

This research paper introduces Variational Preference Learning (VPL) , a novel method designed to improve Reinforcement Learning from Human Feedback (RLHF) by accounting for the diversity and plurality of individual human preferences . Current RLHF methods, which typically assume a single, monolithic set of preferences, often fail or result in inaccurate reward models when faced with a diverse pop...

Enhancing Personalized Multi-Turn Dialogue with Curiosity Reward 04.10.2025

This paper introduces CURIO (Curiosity-driven User-modeling Reward as an Intrinsic Objective) , a novel framework for enhancing personalized multi-turn dialogue in large language models (LLMs). This research addresses the limitations of conventional methods like Reinforcement Learning from Human Feedback ( RLHF ), which often fail to personalize interactions dynamically for individual users. CURIO...

Learning to summarize user information for personalized reinforcement learning from human feedback 04.10.2025

The academic paper proposes a novel framework called Preference Learning Using Summarization (PLUS) to address the limitations of standard Reinforcement Learning from Human Feedback (RLHF), which fails to account for diverse user preferences by modeling the entire population with a single reward model. PLUS utilizes reinforcement learning (RL) to generate text-based summaries of individual user pr...

Distributional Preference Learning: Understanding and Accounting for Hidden Context in RLHF 03.10.2025

The paper "Distributional Preference Learning: Understanding and Accounting for Hidden Context in RLHF,"** was submitted to **arXiv.org** and presented at ICLR 2024. The paper, authored by Siththaranjan, Laidlaw, and Hadfield-Menell, addresses the challenge of **"hidden context"** in preference learning, particularly in **Reinforcement Learning from Human Feedback (RLHF)**, where unrepresented dat...

LIMI: Less is More for Agency 01.10.2025

This research paper introduces the Agency Efficiency Principle and a methodology called LIMI (Less Is More for Intelligent Agency) , arguing that developing autonomous AI systems requires strategically curating small datasets of high-quality agentic demonstrations rather than scaling data volume. The authors define Agency as the capacity for autonomous reasoning, acting, and tool use in complex wo...

LoRA Without Regret 01.10.2025

This research provides a detailed analysis of  Low-Rank Adaptation (LoRA) , a parameter-efficient fine-tuning (PEFT) method for large language models, comparing its performance against full fine-tuning ( FullFT ). The authors establish a "low-regret regime" where LoRA matches the performance and sample efficiency of FullFT, particularly for small-to-medium-sized datasets, provided key im...

Actor-Critic without Actor: Critic-Guided Denoising for RL 29.09.2025

This paper introduces a novel reinforcement learning framework called Actor-Critic without Actor (ACA) , which is designed to be a lightweight and efficient alternative to traditional actor-critic methods. ACA eliminates the explicit actor network, generating actions instead from the gradient field of a noise-level critic via a diffusion-based denoising process. This method significantly reduces a...

DELTA-Code: How Does RL Unlock and Transfer New Programming Algorithms in LLMs? 29.09.2025

This research introduces DELTA-Code , a benchmark designed to investigate whether Large Language Models ( LLMs ) can genuinely acquire and generalize novel reasoning strategies beyond their pre-trained or post-trained capabilities using Reinforcement Learning (RL) . The paper focuses on two main aspects: learnability , determining if RL can help LLMs solve coding problems that were previously unso...

Linear Transformers Implicitly Discover Unified Numerical Algorithms 29.09.2025

The academic paper introduces a study on training a linear transformer to perform masked-block completion tasks on low-rank matrices, which simulates complex numerical problems like Nyström extrapolation. Surprisingly, the transformer implicitly discovers a single, unified, iterative numerical solver, termed EAGLE (Emergent Algorithm for Global Low-rank Estimation), despite being trained only on i...

Regularizing Extrapolation in Causal Inference 27.09.2025

The academic paper proposes a new method for **regularizing extrapolation in causal inference** by replacing the common hard non-negativity constraints on estimation weights with a **soft penalty on negative weights**. This framework introduces a **"bias-bias-variance" tradeoff**, which explicitly accounts for biases arising from feature imbalance, model misspecification due to reliance on paramet...

DoubleGen - Debiased Generative Modeling of Counterfactuals 27.09.2025

The academic paper introduces **DoubleGen**, a novel, doubly robust framework designed to adapt standard generative models—such as diffusion models, flow matching, and autoregressive language models—to generate **counterfactual data**. Unlike existing methods that are only singly robust and susceptible to bias if auxiliary models are misspecified, DoubleGen remains valid if either the propensity s...

What Characterizes Effective Reasoning? Revisiting Length, Review, and Structure of CoT 27.09.2025

This academic paper investigates what makes a Chain-of-Thought (CoT) trace effective for Large Reasoning Models (LRMs), challenging the prevailing idea that **longer reasoning traces and increased review behaviors automatically lead to better performance**. Through a systematic evaluation across ten LRMs on math and scientific reasoning, the authors demonstrate that **shorter CoTs and lower Review...

Compute as Teacher: Turning Inference Compute Into Reference-Free Supervision 27.09.2025

This paper introduces **Compute as Teacher (CaT)**, a novel method that converts a large language model's (LLM) inference-time exploration into **reference-free supervision** by synthesizing a single, improved reference answer from multiple parallel rollouts generated by the model. This synthesized reference is then used as a teacher signal for training (CaT-RL) or immediate inference-time gain (C...

Learning without training: The implicit dynamics of in-context learning 24.09.2025

This research paper explores In-Context Learning (ICL) in Large Language Models (LLMs), which is the striking ability of these models to learn new patterns from examples given in a prompt without explicit weight updates during inference. The authors hypothesize and demonstrate through theory and experimentation that the combination of a self-attention layer and a Multi-Layer Perceptron (MLP) withi...

Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model 24.09.2025

The academic paper critically examines whether Reinforcement Learning with Verifiable Rewards (RLVR) genuinely enhances the reasoning capabilities of large language models (LLMs) beyond their base models, particularly for tasks like mathematics and coding. Surprisingly, the authors find that while RLVR improves sampling efficiency for correct responses—leading to better performance at low sampling...

Open Problems in Mechanistic Interpretability 21.09.2025

This paper gives a comprehensive review of the **open problems** and future directions within the field of **mechanistic interpretability** (MI), which seeks to understand the computational mechanisms of neural networks. The authors organize these challenges into three main categories: **methodological and foundational problems**, such as improving decomposition techniques like Sparse Dictionary L...

Maestro: Joint Graph & Config Optimization for Reliable AI Agents 21.09.2025

This paper introruces **Maestro**, a novel, holistic optimization framework for Large Language Model (LLM) agents. Maestro is designed to improve agent reliability and performance by **jointly optimizing two dimensions**: the agent's structural **graph** (module flow and architecture) and its operational **configurations** (prompts, models, and tools). Unlike prior optimizers that fix the graph, M...

Thought Anchors: Which LLM Reasoning Steps Matter? 21.09.2025

This research paper titled "**Thought Anchors: Which LLM Reasoning Steps Matter?**," addresses the challenge of interpreting long-form chain-of-thought (CoT) reasoning in large language models (LLMs). The authors introduce the concept of **thought anchors**, defined as critical reasoning steps—often planning or uncertainty management sentences—that disproportionately influence the subsequent reaso...

RL's Razor: Why Online RL Forgets Less 07.09.2025

This paper explores why **Reinforcement Learning (RL) fine-tuning leads to less catastrophic forgetting** in models compared to **Supervised Fine-Tuning (SFT)**, even when both achieve similar performance on new tasks. The authors introduce **"RL's Razor,"** a principle stating that **RL is implicitly biased towards solutions that cause minimal change (KL divergence) from the original model's poli...

Why Language Models Hallucinate 06.09.2025

This new OpenAI paper explores the phenomenon of "hallucinations" in large language models (LLMs), where they generate plausible but incorrect information. The authors attribute these errors to the training and evaluation processes, arguing that these systems are rewarded for guessing rather than admitting uncertainty. They propose a statistical framework that connects these generative e...

ALFA: Aligning LLMs to Ask Good Questions A Case Study in Clinical Reasoning 06.09.2025

This academic paper introduces ALFA (ALignment via Fine-grained Attributes), a new framework designed to enhance how large language models (LLMs) ask questions, particularly in complex fields like clinical reasoning. The authors highlight the current limitations of LLMs in proactive information-gathering, which is crucial for decision-making in high-stakes environments. ALFA addresses this by deco...

Sample Efficient Preference Alignment in LLMs via Active Exploration 06.09.2025

This research introduces an active exploration algorithm to enhance the efficiency of preference alignment in large language models (LLMs) by strategically selecting human feedback. The authors frame this as an active contextual dueling bandit problem, where the system actively chooses which "contexts" (prompts) and "actions" (LLM responses) to present to human evaluators. Thei...

Adventures in Demand Analysis Using AI 04.09.2025

This research explores how artificial intelligence (AI) can improve demand analysis by creating rich multimodal representations of products. Using a dataset of toy cars from Amazon, the study combines text descriptions, images, and tabular data to generate transformer-based embeddings. These embeddings capture subtle product attributes, such as quality and branding, which significantly enhance the...

Memento: Fine-tuning LLM Agents without Fine-tuning LLMs 01.09.2025

The research introduces Memento, a novel approach for adaptive Large Language Model (LLM) agents that enables continuous learning without requiring fine-tuning of the base LLM parameters. This method leverages a memory-based online reinforcement learning framework, formally defined as a Memory-augmented Markov Decision Process (M-MDP), which stores past experiences in an episodic memory and contin...

Listen to the Best AI papers explained podcast in Replaio

Radio and podcasts in one app - free, with no sign-up. Install today and do not miss the launch

Get it on Google Play

Replaio is not a podcast publisher; show names, artwork and audio belong to their authors and are distributed through public RSS feeds.