Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Leon Lang

dblp:255/5021 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0002-1950-2831ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 2 first-author · 4 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Reinforcement learning · 39% Deep learning architectures and training · 27% Language models and text generation · 18%

Topics — the 11 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
equivariant neural network
1.122022
A Program to Build E(N)-Equivariant Steerable CNNs · ICLR 2022
A Wigner-Eckart Theorem for Group Equivariant Convolution Kernels · ICLR 2021
Machine learning › Reinforcement learning
reward learning
0.912025
The Perils of Optimizing Learned Reward Functions: Low Training Error Does Not Guarantee Low Regret · ICML 2025
Machine learning › Reinforcement learning › reward learning › reward modeling
reward model evaluation
0.912025
The Perils of Optimizing Learned Reward Functions: Low Training Error Does Not Guarantee Low Regret · ICML 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
The Perils of Optimizing Learned Reward Functions: Low Training Error Does Not Guarantee Low Regret · ICML 2025
Natural language and speech › Language models and text generation › alignment
deceptive alignment
0.812024
When Your AIs Deceive You: Challenges of Partial Observability in Reinforcement Learning from Human Feedback · NeurIPS 2024
Machine learning › Reinforcement learning
partial observability
0.812024
When Your AIs Deceive You: Challenges of Partial Observability in Reinforcement Learning from Human Feedback · NeurIPS 2024
Machine learning › Reinforcement learning
reinforcement learning from human feedback
0.812024
When Your AIs Deceive You: Challenges of Partial Observability in Reinforcement Learning from Human Feedback · NeurIPS 2024
Natural language and speech › Language models and text generation › alignment
reward hacking
0.812024
When Your AIs Deceive You: Challenges of Partial Observability in Reinforcement Learning from Human Feedback · NeurIPS 2024
Machine learning › Deep learning architectures and training › equivariant neural network
group equivariant neural network
0.612022
A Program to Build E(N)-Equivariant Steerable CNNs · ICLR 2022
Machine learning › Deep learning architectures and training › equivariant neural network
steerable CNN
0.612022
A Program to Build E(N)-Equivariant Steerable CNNs · ICLR 2022
Machine learning › Representation and self-supervised learning › equivariance
equivariant representation learning
0.512021
A Wigner-Eckart Theorem for Group Equivariant Convolution Kernels · ICLR 2021

Methods — techniques the papers use, named apart from their topics

regret analysis · 0.9policy regularization · 0.9boltzmann rationality · 0.8RLHF · 0.8e(n)-equivariant convolution · 0.6wigner-eckart theorem · 0.5group representation theory · 0.5
YearPublicationVenuePosition
2025 The Perils of Optimizing Learned Reward Functions: Low Training Error Does Not Guarantee Low Regret
abstract
In reinforcement learning, specifying reward functions that capture the intended task can be very challenging. Reward learning aims to address this issue by *learning* the reward function. However, a learned reward model may have a low error on the data distribution, and yet subsequently produce a policy with large regret. We say that such a reward model has an *error-regret mismatch*. The main source of an error-regret mismatch is the distributional shift that commonly occurs during policy optimization. In this paper, we mathematically show that a sufficiently low expected test error of the reward model guarantees low worst-case regret, but that for any *fixed* expected test error, there exist realistic data distributions that allow for error-regret mismatch to occur. We then show that similar problems persist even when using policy regularization techniques, commonly employed in methods such as RLHF. We hope our results stimulate the theoretical and empirical study of improved methods to learn reward models, and better ways to measure their quality reliably.
Lukas Fluri, Leon Lang, Alessandro Abate, Patrick Forré, David Krueger 0001, Joar Skalse
ICML2
2024 When Your AIs Deceive You: Challenges of Partial Observability in Reinforcement Learning from Human Feedback
abstract
Past analyses of reinforcement learning from human feedback (RLHF) assume that the human evaluators fully observe the environment. What happens when human feedback is based only on partial observations? We formally define two failure cases: deceptive inflation and overjustification. Modeling the human as Boltzmann-rational w.r.t. a belief over trajectories, we prove conditions under which RLHF is guaranteed to result in policies that deceptively inflate their performance, overjustify their behavior to make an impression, or both. Under the new assumption that the human's partial observability is known and accounted for, we then analyze how much information the feedback process provides about the return function. We show that sometimes, the human's feedback determines the return function uniquely up to an additive constant, but in other realistic cases, there is irreducible ambiguity. We propose exploratory research directions to help tackle these challenges and experimentally validate both the theoretical concerns and potential mitigations, and caution against blindly applying RLHF in partially observable settings.
Leon Lang, Davis Foote, Stuart Russell 0001, Anca D. Dragan, Erik Jenner, Scott Emmons
NeurIPS1
2022 A Program to Build E(N)-Equivariant Steerable CNNs
Gabriele Cesa, Leon Lang, Maurice Weiler
ICLR2
2021 A Wigner-Eckart Theorem for Group Equivariant Convolution Kernels
Leon Lang, Maurice Weiler
ICLR1