← Search

Cameron Allen

7 accepted papers

2026

Truthfulness Despite Weak Supervision: Evaluating and Training LLMs Using Peer Prediction

ICLR 2026poster

The evaluation and post-training of large language models (LLMs) rely on supervision, but strong supervision for difficult tasks is often unavailable, especially when evaluating strong models. In such cases, models have been demonstrated to exploit evaluation schemes built on such imperfect supervis…

Cited by 0SourceScholar
2025

Skill-Driven Neurosymbolic State Abstractions

NeurIPS 2025poster

We consider how to construct state abstractions compatible with a given set of abstract actions, to obtain a well-formed abstract Markov decision process (MDP). We show that the Bellman equation suggests that abstract states should represent distributions over states in the ground MDP; we characteri…

Cited by 0SourceScholar
2024

Evidence of Learned Look-Ahead in a Chess-Playing Neural Network

NeurIPS 2024poster

Do neural networks learn to implement algorithms such as look-ahead or search "in the wild"? Or do they rely purely on collections of simple heuristics? We present evidence of *learned look-ahead* in the policy and value network of Leela Chess Zero, the currently strongest deep neural chess engine.…

Cited by 9SourcePDFScholar
2024

Mitigating Partial Observability in Sequential Decision Processes via the Lambda Discrepancy

NeurIPS 2024poster

Reinforcement learning algorithms typically rely on the assumption that the environment dynamics and value function can be expressed in terms of a Markovian state representation. However, when state information is only partially observable, how can an agent learn such a state representation, and how…

2022

Optimistic Initialization for Exploration in Continuous Control

AAAI 2022technical

Optimistic initialization underpins many theoretically sound exploration schemes in tabular domains; however, in the deep function approximation setting, optimism can quickly disappear if initialized naively. We propose a framework for more effectively incorporating optimistic initialization into re…

Cited by 14SourcePDFScholar
2021

Efficient Black-Box Planning Using Macro-Actions with Focused Effects

IJCAI 2021poster

The difficulty of deterministic planning increases exponentially with search-tree depth. Black-box planning presents an even greater challenge, since planners must operate without an explicit model of the domain. Heuristics can make search more efficient, but goal-aware heuristics for black-box plan…

2021

Learning Markov State Abstractions for Deep Reinforcement Learning

NeurIPS 2021poster

A fundamental assumption of reinforcement learning in Markov decision processes (MDPs) is that the relevant decision process is, in fact, Markov. However, when MDPs have rich observations, agents typically learn by way of an abstract state representation, and such representations are not guaranteed…