← Search

Christian Schroeder de Witt

22 accepted papers

2026

LongCoT: Benchmarking Long-Horizon Chain-of-Thought Reasoning

ICML 2026poster

As language models are increasingly deployed for complex autonomous tasks, their ability to reason accurately over longer horizons becomes critical. An essential component of this ability is planning and managing a long, complex chain-of-thought (CoT). We introduce LongCoT, a scalable benchmark of 2…

Cited by 0SourceScholar
2026

Rubric Curriculum RL: Exploiting the Generation-Verification Gap in Creative Writing

ICML 2026poster

Reinforcement learning with verifiable rewards (RLVR) on foundation models has led to significant improvements in math and code generation. Extending these gains to open-ended domains remains challenging: ground-truth verification is unavailable, human annotation is expensive, and learnt reward mode…

Cited by 0SourceScholar
2026

h1: Bootstrapping LLMs to Reason over Longer Horizons via Reinforcement Learning

ICML 2026spotlight

Large language models excel at short-horizon reasoning tasks, but performance drops as reasoning horizon lengths increase. Existing approaches to combat this rely on inference-time scaffolding or step-level supervision, neither of which scales easily. In this work, we introduce a scalable method to …

Cited by 0SourceScholar
2025

Efficient Dictionary Learning with Switch Sparse Autoencoders

ICLR 2025poster

Sparse autoencoders (SAEs) are a recent technique for decomposing neural network activations into human-interpretable features. However, in order for SAEs to identify all features represented in frontier models, it will be necessary to scale them up to very high width, posing a computational challen…

2025

Fundamental Limitations in Pointwise Defences of LLM Finetuning APIs

NeurIPS 2025poster

LLM developers deploy technical mitigations to prevent _fine-tuning misuse attacks_, attacks in which adversaries evade safeguards by fine-tuning the model using a public API. Previous work has established several successful attacks against specific fine-tuning API defences; however, prior attacks t…

Cited by 0SourceScholar
2025

Mixture of Experts Made Intrinsically Interpretable

ICML 2025poster

Neurons in large language models often exhibit \emph{polysemanticity}, simultaneously encoding multiple unrelated concepts and obscuring interpretability. Instead of relying on post-hoc methods, we present \textbf{MoE-X}, a mixture-of-experts (MoE) language model designed to be \emph{intrinsically}…

Cited by 0SourcePDFScholar
2025

Multi-Agent Security Tax: Trading Off Security and Collaboration Capabilities in Multi-Agent Systems

AAAI 2025technical

As AI agents are increasingly adopted to collaborate on complex objectives, ensuring the security of autonomous multi-agent systems becomes crucial. We develop simulations of agents collaborating on shared objectives to study these security risks and security trade-offs. We focus on scenarios where…

Cited by 1SourcePDFScholar
2025

REAL: Benchmarking Autonomous Agents on Deterministic Simulations of Real Websites

NeurIPS 2025poster

We introduce REAL, a benchmark and framework for multi-turn agent evaluations on deterministic simulations of real-world websites. REAL comprises high-fidelity, deterministic replicas of 11 widely-used websites across domains such as e-commerce, travel, communication, and professional networking. We…

Cited by 0SourceScholar
2024

Bayesian Exploration Networks

ICML 2024poster

Bayesian reinforcement learning (RL) offers a principled and elegant approach for sequential decision making under uncertainty. Most notably, Bayesian agents do not face an exploration/exploitation dilemma, a major pathology of frequentist methods. However theoretical understanding of model-free app…

Cited by 3SourcePDFScholar
2024

Computing Low-Entropy Couplings for Large-Support Distributions

UAI 2024poster

Minimum-entropy coupling (MEC)—the process of finding a joint distribution with minimum entropy for given marginals—has applications in areas such as causality and steganography. However, existing algorithms are either computationally intractable for large-support distributions or limited to specifi…

2024

Illusory Attacks: Information-theoretic detectability matters in adversarial attacks

ICLR 2024spotlight

Autonomous agents deployed in the real world need to be robust against adversarial attacks on sensory inputs. Robustifying agent policies requires anticipating the strongest attacks possible. We demonstrate that existing observation-space attacks on reinforcement learning agents have a common weakn…

Cited by 5SourcePDFScholar
2024

JaxMARL: Multi-Agent RL Environments and Algorithms in JAX

NeurIPS 2024poster

Benchmarks are crucial in the development of machine learning algorithms, significantly influencing reinforcement learning (RL) research through the available environments. Traditionally, RL environments run on the CPU, which limits their scalability with the computational resources typically availa…

2024

Position: Near to Mid-term Risks and Opportunities of Open-Source Generative AI

ICML 2024oral

In the next few years, applications of Generative AI are expected to revolutionize a number of different areas, ranging from science & medicine to education. The potential for these seismic changes has triggered a lively debate about potential risks and resulted in calls for tighter regulation, in p…

Cited by 9SourcePDFScholar
2024

Secret Collusion among AI Agents: Multi-Agent Deception via Steganography

NeurIPS 2024poster

Recent advancements in generative AI suggest the potential for large-scale interaction between autonomous agents and humans across platforms such as the internet. While such interactions could foster productive cooperation, the ability of AI agents to circumvent security oversight raises critical mu…

Cited by 6SourcePDFScholar
2024

Unelicitable Backdoors via Cryptographic Transformer Circuits

NeurIPS 2024poster

The rapid proliferation of open-source language models significantly increases the risks of downstream backdoor attacks. These backdoors can introduce dangerous behaviours during model deployment and can evade detection by conventional cybersecurity monitoring systems. In this paper, we introduce a…

Cited by 5SourcePDFScholar
2023

Cheap Talk Discovery and Utilization in Multi-Agent Reinforcement Learning

ICLR 2023poster

By enabling agents to communicate, recent cooperative multi-agent reinforcement learning (MARL) methods have demonstrated better task performance and more coordinated behavior. Most existing approaches facilitate inter-agent communication by allowing agents to send messages to each other through fre…

Cited by 7SourcePDFScholar
2023

Perfectly Secure Steganography Using Minimum Entropy Coupling

ICLR 2023poster

Steganography is the practice of encoding secret information into innocuous content in such a manner that an adversarial third party would not realize that there is hidden meaning. While this problem has classically been studied in security literature, recent advances in generative models have led t…

2022

Discovered Policy Optimisation

NeurIPS 2022accept

Tremendous progress has been made in reinforcement learning (RL) over the past decade. Most of these advancements came through the continual development of new algorithms, which were designed using a combination of mathematical derivations, intuitions, and experimentation. Such an approach of creati…

Cited by 93SourcePDFScholar
2022

Equivariant Networks for Zero-Shot Coordination

NeurIPS 2022accept

Successful coordination in Dec-POMDPs requires agents to adopt robust strategies and interpretable styles of play for their partner. A common failure mode is symmetry breaking, when agents arbitrarily converge on one out of many equivalent but mutually incompatible policies. Commonly these examples…

2021

FACMAC: Factored Multi-Agent Centralised Policy Gradients

NeurIPS 2021poster

We propose FACtored Multi-Agent Centralised policy gradients (FACMAC), a new method for cooperative multi-agent reinforcement learning in both discrete and continuous action spaces. Like MADDPG, a popular multi-agent actor-critic method, our approach uses deep deterministic policy gradients to learn…

2019

Multi-Agent Common Knowledge Reinforcement Learning

NeurIPS 2019poster

Cooperative multi-agent reinforcement learning often requires decentralised policies, which severely limit the agents' ability to coordinate their behaviour. In this paper, we show that common knowledge between agents allows for complex decentralised coordination. Common knowledge arises naturally i…