← Search

Julia Kempe

23 accepted papers

2026

Efficient RL Training for LLMs with Experience Replay

ICML 2026poster

While Experience Replay—the practice of storing rollouts and reusing them multiple times during training—is a foundational technique in general RL, it remains largely unexplored in LLM post-training due to the prevailing belief that fresh, on-policy data is essential for high performance. In this wo…

Cited by 0SourceScholar
2026

Embedding Trust: Semantic Isotropy Predicts Nonfactuality in Long-Form Text Generation

ICML 2026poster

To deploy large language models (LLMs) in high-stakes application domains that require substantively accurate responses to open-ended prompts, we need reliable, computationally inexpensive methods that assess the trustworthiness of long-form responses generated by LLMs. However, existing approaches …

Cited by 0SourceScholar
2026

From Concepts to Components: Concept-Agnostic Attention Module Discovery in Transformers

ICLR 2026poster

Transformers have achieved state-of-the-art performance across diverse language and vision tasks. This success drives the imperative to interpret their internal mechanisms with the dual goals of enhancing performance and improving behavioral control. Attribution methods help advance interpretability…

Cited by 0SourceScholar
2026

How reinforcement learning after next-token prediction facilitates learning

ICLR 2026poster

Recent advances in reasoning domains with neural networks have primarily been enabled by a training recipe that optimizes Large Language Models, previously trained to predict the next-token in a sequence, with reinforcement learning algorithms. We introduce a framework to study the success of this p…

Cited by 0SourceScholar
2026

OpenApps: Simulating Environment Variations to Measure UI Agent Reliability

ICLR 2026oral

Reliability is key to realizing the promise of autonomous UI-agents, multimodal agents that directly interact with the apps humans use, as users must be able to trust an agent to complete a given task. Current evaluations rely on fixed environments---often clones of existing apps--- which are limite…

Cited by 0SourcecodeScholar
2026

Teaching Models to Teach Themselves: Reasoning at the Edge of Learnability

ICML 2026spotlight

RL methods for finetuning large reasoning models stall on datasets with low initial success rates, and thus little training signal. We investigate a fundamental question: Can a pretrained LLM leverage latent knowledge to generate an automated curriculum for problems it cannot solve? We explore this …

Cited by 0SourceScholar
2026

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

ICML 2026poster

Large reasoning models (LRMs) spend substantial test-time compute on long chain-of-thought (CoT) traces, but what *characterizes* an effective CoT remains unclear. While prior work reports gains from lengthening CoTs and increasing review via appended *wait* tokens, recent studies suggest that short…

Cited by 0SourceScholar
2025

Asymmetric REINFORCE for off-Policy Reinforcement Learning: Balancing positive and negative rewards

NeurIPS 2025poster

Reinforcement learning (RL) is increasingly used to align large language models (LLMs). Off-policy methods offer greater implementation simplicity and data efficiency than on-policy techniques, but often result in suboptimal performance. In this work, we study the intermediate range of algorithms be…

Cited by 0SourceScholar
2025

Beyond Model Collapse: Scaling Up with Synthesized Data Requires Verification

ICLR 2025poster

Large Language Models (LLM) are increasingly trained on data generated by other LLMs, either because generated text and images become part of the pre-training corpus, or because synthetized data is used as a replacement for expensive human-annotation. This raises concerns about *model collapse*, a d…

Cited by 3SourcePDFScholar
2025

Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks

ICLR 2025poster

We study the implicit bias of the family of steepest descent algorithms with infinitesimal learning rate, including gradient descent, sign gradient descent and coordinate descent, in deep homogeneous neural networks. We prove that an algorithm-dependent geometric margin increases during training and…

Cited by 2SourcePDFScholar
2025

PILAF: Optimal Human Preference Sampling for Reward Modeling

ICML 2025poster

As large language models increasingly drive real-world applications, aligning them with human values becomes paramount. Reinforcement Learning from Human Feedback (RLHF) has emerged as a key technique, translating preference data into reward models when oracle human values remain inaccessible. In pr…

Cited by 1SourcePDFScholar
2024

A Tale of Tails: Model Collapse as a Change of Scaling Laws

ICML 2024poster

As AI model size grows, neural *scaling laws* have become a crucial tool to predict the improvements of large models when increasing capacity and the size of original (human or natural) training data. Yet, the widespread use of popular models means that the ecosystem of online data and text will co-…

Cited by 58SourcePDFScholar
2024

Deconstructing the Goldilocks Zone of Neural Network Initialization

ICML 2024poster

The second-order properties of the training loss have a massive impact on the optimization dynamics of deep learning models. Fort & Scherlis (2019) discovered that a large excess of positive curvature and local convexity of the loss Hessian is associated with highly trainable initial points located…

2024

Iteration Head: A Mechanistic Study of Chain-of-Thought

NeurIPS 2024poster

Chain-of-Thought (CoT) reasoning is known to improve Large Language Models both empirically and in terms of theoretical approximation power. However, our understanding of the inner workings and conditions of apparition of CoT capabilities remains limited. This paper helps fill this gap by demonstrat…

2024

Mind the GAP: Improving Robustness to Subpopulation Shifts with Group-Aware Priors

AISTATS 2024poster

Machine learning models often perform poorly under subpopulation shifts in the data distribution. Developing methods that allow machine learning models to better generalize to such shifts is crucial for safe deployment in real-world settings. In this paper, we develop a family of group-aware prior (…

2024

The Price of Implicit Bias in Adversarially Robust Generalization

NeurIPS 2024poster

We study the implicit bias of optimization in robust empirical risk minimization (robust ERM) and its connection with robust generalization. In classification settings under adversarial perturbations with linear models, we study what type of regularization should ideally be applied for a given pert…

Cited by 3SourcePDFScholar
2022

What Can the Neural Tangent Kernel Tell Us About Adversarial Robustness?

NeurIPS 2022accept

The adversarial vulnerability of neural nets, and subsequent techniques to create robust models have attracted significant attention; yet we still lack a full understanding of this phenomenon. Here, we study adversarial examples of trained neural networks through analytical tools afforded by recent…