summaries: This paper targets the very important problem of reward-hacking that occurs when the objectives optimized by intelligent agents are misaligned with respect to the tru objectives of the algorithm designer. The paper presents an empirical study across a range of different settings including a simple driving simulator, covid modeling, and a single atari game. The experiments show evidence of reward hacking as a function of modeling power of the agent and the size of the state-space. The paper concludes with some ideas and initial directions on how to potentially mitigate reward hacking.  This paper studies reward hacking, a common but understudied phenomenon, across a set of environments. Reward hacking emerges in several tasks, meaning that the resulting policy has a high proxy reward but a low true reward. A key finding is that reward hacking increases with agent capabilities so that increasing capability lowers the true reward. This holds across several ways of increasing capabilities (model size, training steps, action space, etc). The authors also find ‘phase transitions’ where a small increase in capability results in qualitatively new reward hacking behavior, a phenomenon that may require novel monitoring strategies. One such strategy is anomaly detection, for which the authors introduce a benchmark and baselines.  This paper provides a systematic study of “reward hacking” in the environments with the misspecified rewards. The authors conduct a set of experiments with 4 environments, several types of reward misspecification in each of them and several agents of different expressivity (model capacity). They notice that often the agents that are more capable end up obtaining high proxy reward, but low real reward. Besides, often the transition to the low real reward happens very quickly and authors call this phenomenon “phase transition”. Finally, they propose a baseline for anomaly detection to identify this phase transition. This paper investigates the phenomenon of reward hacking as a function of agent capabilities. They introduce four diverse RL environments with nine misspecified rewards and demonstrate that more capable agents are better at exploiting the misspecification. They find instances of phase transitions where a small increase in agent capability produces a large change in behavior that sharply decreases the true reward.  To mitigate the reward hacking problem, they propose to set up an anomaly detection task, given a trusted model with moderate performance on the true reward, where the anomaly detector's task is to identify whether policies from a different model are satisfactory for the true reward. They provide several baseline anomaly detectors and show how they perform on different tasks. 
abstractText: Reward hacking—where RL agents exploit gaps in misspecified reward functions—has been widely observed, but not yet systematically studied. To understand how reward hacking arises, we construct four RL environments with misspecified rewards. We investigate reward hacking as a function of agent capabilities: model capacity, action space resolution, observation space noise, and training time. More capable agents often exploit reward misspecifications, achieving higher proxy reward and lower true reward than less capable agents. Moreover, we find instances of phase transitions: capability thresholds at which the agent’s behavior qualitatively shifts, leading to a sharp decrease in the true reward. Such phase transitions pose challenges to monitoring the safety of ML systems. To address this, we propose an anomaly detection task for aberrant policies and offer several baseline detectors.
authors.name: Alexander Pan
authors.name: Kush Bhatia
authors.name: Jacob Steinhardt
references.authors: Marcin Andrychowicz Anton Raichuk Piotr Stańczyk Manu Orsini Sertan Girgin Raphael Marinier Léonard Hussenot Matthieu Geist Olivier Pietquin Marcin Michalski
references.title: What matters in on-policy reinforcement learning? A large-scale empirical study
references.venue: arXiv preprint arXiv:2006.05990,
references.authors: Bowen Baker Ingmar Kanitscheider Todor Markov Yi Wu Glenn Powell Bob McGrew Igor Mordatch
references.title: Emergent tool use from multi-agent autocurricula
references.venue: In International Conference on Learning Representations,
references.authors: Peter Boettke Benjamin Powell
references.title: The political economy of the covid-19 pandemic
references.venue: Southern Economic Journal,
references.authors: Rishi Bommasani
references.title: On the opportunities and risks of foundation models
references.venue: arXiv preprint arXiv:2108.07258,
references.authors: Amy Bronstone Claudia Graham
references.title: The potential cost implications of averting severe hypoglycemic events requiring hospitalization in high-risk adults with type 1 diabetes using real-time continuous glucose monitoring
references.venue: Journal of Diabetes Science and Technology,
references.authors: Daniel Brown Russell Coleman Ravi Srinivasan Scott Niekum
references.title: Safe imitation learning via fast Bayesian reward inference from preferences
references.venue: In Proceedings of the 37th International Conference on Machine Learning,
references.authors: Paul F Christiano Jan Leike Tom Brown Miljan Martic Shane Legg Dario Amodei
references.title: Deep reinforcement learning from human preferences
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Jesse Davis Mark Goadrich
references.title: The relationship between precision-recall and roc curves
references.venue: In International Conference on Machine Learning,
references.authors: Jasha Droppo Oguz Elibol
references.title: Scaling laws for acoustic models
references.venue: arXiv preprint arXiv:2106.09488,
references.authors: Lasse Espeholt Hubert Soyer Remi Munos Karen Simonyan Volodymyr Mnih Tom Ward Yotam Doron Vlad Firoiu Tim Harley Iain Robert Dunning Shane Legg Koray Kavukcuoglu
references.title: Impala: Scalable distributed deep-rl with importance weighted actor-learner architectures. 2018
references.authors: Tom Everitt Victoria Krakovna Laurent Orseau Shane Legg
references.title: Reinforcement learning with a corrupted reward channel
references.venue: In International Joint Conference on Artificial Intelligence,
references.authors: Ian Fox Joyce Lee Rodica Pop-Busui Jenna Wiens
references.title: Deep reinforcement learning for closedloop blood glucose control
references.venue: In Machine Learning for Healthcare Conference,
references.authors: M. Fralick A.S. Kesselheim
references.title: The U.S. Insulin Crisis - Rationing a Lifesaving Medication Discovered in the 1920s
references.venue: New England Journal of Medicine,
references.authors: Ian J Goodfellow Jonathon Shlens Christian Szegedy
references.title: Explaining and harnessing adversarial examples
references.venue: arXiv preprint arXiv:1412.6572,
references.authors: Tuomas Haarnoja Aurick Zhou Pieter Abbeel Sergey Levine
references.title: Soft actor-critic: Off-policy maximum entropy deep reinforcement learning with a stochastic actor
references.venue: In International conference on machine learning,
references.authors: Dylan Hadfield-Menell Smitha Milli Pieter Abbeel Stuart J Russell Anca Dragan
references.title: Inverse reward design
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Dan Hendrycks Kevin Gimpel
references.title: A baseline for detecting misclassified and out-of-distribution examples in neural networks
references.venue: International Conference on Learning Representations,
references.authors: Dan Hendrycks Nicholas Carlini John Schulman Jacob Steinhardt
references.title: Unsolved problems in ml safety
references.venue: arXiv preprint arXiv:2109.13916,
references.authors: Dan Hendrycks Mantas Mazeika Andy Zou Sahil Patel Christine Zhu Jesus Navarro Dawn Song Bo Li Jacob Steinhardt
references.title: What would Jiminy Cricket do? Towards agents that behave morally
references.authors: Darby Herkert Pavithra Vijayakumar Jing Luo Jeremy I. Schwartz Tracy L. Rabin Eunice DeFilippo Kasia J. Lipska
references.title: Cost-related insulin underuse among patients with diabetes
references.venue: JAMA Internal Medicine,
references.authors: Danny Hernandez Jared Kaplan Tom Henighan Sam McCandlish
references.title: Scaling laws for transfer
references.venue: arXiv preprint arXiv:2102.01293,
references.authors: Evan Hubinger Chris van Merwijk Vladimir Mikulik Joar Skalse Scott Garrabrant
references.title: Risks from learned optimization in advanced machine learning systems
references.authors: Borja Ibarz J. Leike Tobias Pohlen Geoffrey Irving S. Legg Dario Amodei
references.title: Reward learning from human preferences and demonstrations in Atari
references.venue: In Advances in Neural Information Processing Systems,
references.authors: Zaynah Javed Daniel S Brown Satvik Sharma Jerry Zhu Ashwin Balakrishna Marek Petrik Anca Dragan Ken Goldberg
references.title: Policy gradient bayesian robust optimization for imitation learning
references.venue: In Proceedings of the 38th International Conference on Machine Learning,
references.authors: Jared Kaplan Sam McCandlish Tom Henighan Tom B Brown Benjamin Chess Rewon Child Scott Gray Alec Radford Jeffrey Wu Dario Amodei
references.title: Scaling laws for neural language models
references.authors: W. Bradley Knox Alessandro Allievi Holger Banzhaf Felix Schmitt Peter Stone
references.title: Reward (Mis)design for Autonomous Driving
references.venue: arXiv e-prints
references.authors: Jens Kober J Andrew Bagnell Jan Peters
references.title: Reinforcement learning in robotics: A survey
references.venue: The International Journal of Robotics Research,
references.authors: Varun Kompella Roberto Capobianco Stacy Jong Jonathan Browne Spencer Fox Lauren Meyers Peter Wurman Peter Stone
references.title: Reinforcement learning for optimization of covid-19 mitigation
references.authors: BorIs. P. Kovatchev Martin Straume Daniel J. Cox Leon.S Farhy
references.title: Risk analysis of blood glucose data:a quantitative approach to optimizing the control of insulin dependent diabetes
references.venue: Journal of Theoretical Medicine,
references.authors: Heinrich Küttler Nantas Nardelli Thibaut Lavril Marco Selvatici Viswanath Sivakumar Tim Rocktäschel Edward Grefenstette
references.title: TorchBeast: A PyTorch Platform for Distributed RL
references.authors: Benita Lee
references.title: How much does insulin cost? Here’s how 23 brands compare
references.authors: Jan Leike Miljan Martic Victoria Krakovna Pedro A. Ortega Tom Everitt Andrew Lefrancq Laurent Orseau Shane Legg
references.title: AI safety gridworlds, 2017
references.authors: Michael L. Littman Ifeoma Ajunwa Guy Berger Craig Boutilier Morgan Currie Finale DoshiVelez Gillian Hadfield Michael C. Horowitz Charles Isbell Hiroaki Kitano Karen Levy Terah Lyons Melanie Mitchell Julie Shah Steven Sloman Shannon Vallor Toby Walsh
references.title: Gathering strength, gathering storms: The one hundred year study on artificial intelligence (AI100) 2021 study panel report
references.authors: Pablo Alvarez Lopez Michael Behrisch Laura Bieker-Walz Jakob Erdmann Yun-Pang Flötteröd Robert Hilbrich Leonhard Lücken Johannes Rummel Peter Wagner Evamarie Wießner
references.title: Microscopic traffic simulation using SUMO
references.venue: In International Conference on Intelligent Transportation Systems,
references.authors: Chiara Dalla Man Francesco Micheletto Dayu Lv Marc Breton Boris Kovatchev Claudio Cobelli
references.title: The UVA/PADOVA type 1 diabetes simulator: New features
references.venue: Journal of Diabetes Science and Technology,
references.authors: Romain Paulus Caiming Xiong Richard Socher
references.title: A deep reinforced model for abstractive summarization
references.venue: In International Conference on Learning Representations,
references.authors: Manoel Horta Ribeiro Raphael Ottoni Robert West Virgı́lio A.F. Almeida Wagner Meira
references.title: Auditing radicalization pathways on youtube
references.venue: In Conference on Fairness, Accountability, and Transparency,
references.authors: Stuart Russell
references.title: Human Compatible: Artificial Intelligence and the Problem of Control
references.authors: John Schulman Filip Wolski Prafulla Dhariwal Alec Radford Oleg Klimov
references.title: Proximal policy optimization algorithms
references.venue: arXiv preprint arXiv:1707.06347,
references.authors: Nisan Stiennon Long Ouyang Jeff Wu Daniel M Ziegler Ryan Lowe Chelsea Voss Alec Radford Dario Amodei Paul Christiano
references.title: Learning to summarize from human feedback
references.authors: Jonathan Stray
references.title: Aligning ai optimization to community well-being
references.venue: International Journal of Community Well-Being,
references.authors: Jihoon Tack Sangwoo Mo Jongheon Jeong Jinwoo Shin
references.title: Csi: Novelty detection via contrastive learning on distributionally shifted instances
references.venue: Advances in Neural Information Processing Systems,
references.authors: Jessica Taylor
references.title: Quantilizers: A safer alternative to maximizers for limited optimization
references.venue: In AAAI Workshop: AI, Ethics, and Society,
references.authors: Marin Toromanoff Emilie Wirbel Fabien Moutarde
references.title: Is deep reinforcement learning really superhuman on Atari? Leveling the playing field, 2019
references.authors: Martin Treiber Ansgar Hennecke Dirk Helbing
references.title: Congested traffic states in empirical observations and microscopic simulations
references.venue: Physical review E,
references.authors: Alexander Trott Sunil Srinivasa Douwe van der Wal Sebastien Haneuse Stephan Zheng
references.title: Building a Foundation for Data-Driven, Interpretable, and Robust Policy Design using the AI Economist
references.venue: arXiv preprint arXiv:2108.02904,
references.authors: Eugene Vinitsky Aboudy Kreidieh Luc Le Flem Nishant Kheterpal Kathy Jang Cathy Wu Fangyu Wu Richard Liaw Eric Liang Alexandre M. Bayen
references.title: Benchmarks for reinforcement learning in mixed-autonomy traffic
references.venue: In Conference on Robot Learning,
references.authors: Cathy Wu Abdul Rahman Kreidieh Kanaad Parvate Eugene Vinitsky Alexandre M. Bayen
references.title: Flow: A modular learning framework for mixed autonomy traffic
references.venue: IEEE Transactions on Robotics,
references.authors: F Eugene Yates
references.title: Self-organizing systems: The emergence of order
references.venue: Springer Science & Business Media,
references.authors: Chao Yu Jiming Liu Shamim Nemati
references.title: Reinforcement learning in healthcare: A survey
references.venue: arXiv preprint arXiv:1908.08796,
references.authors: Simon Zhuang Dylan Hadfield-Menell
references.title: Consequences of misaligned AI
references.venue: In Advances in Neural Information Processing Systems,
sections.text: Reward hacking—where RL agents exploit gaps in misspecified reward functions—has been widely observed, but not yet systematically studied. To understand how reward hacking arises, we construct four RL environments with misspecified rewards. We investigate reward hacking as a function of agent capabilities: model capacity, action space resolution, observation space noise, and training time. More capable agents often exploit reward misspecifications, achieving higher proxy reward and lower true reward than less capable agents. Moreover, we find instances of phase transitions: capability thresholds at which the agent’s behavior qualitatively shifts, leading to a sharp decrease in the true reward. Such phase transitions pose challenges to monitoring the safety of ML systems. To address this, we propose an anomaly detection task for aberrant policies and offer several baseline detectors.
sections.heading: 1 INTRODUCTION
sections.text: As reinforcement learning agents are trained with better algorithms, more data, and larger policy models, they are at increased risk of overfitting their objectives (Russell, 2019). Reward hacking, or the gaming of misspecified reward functions by RL agents, has appeared in a variety of contexts, such as game playing (Ibarz et al., 2018), text summarization (Paulus et al., 2018), and autonomous driving (Knox et al., 2021). These examples show that better algorithms and models are not enough; for human-centered applications such as healthcare (Yu et al., 2019), economics (Trott et al., 2021) and robotics (Kober et al., 2013), RL algorithms must be safe and aligned with human objectives (Bommasani et al., 2021; Hubinger et al., 2019).
  Reward misspecifications occur because real-world tasks have numerous, often conflicting desiderata. In practice, reward designers resort to optimizing a proxy reward that is either more readily measured or more easily optimized than the true reward. For example, consider a recommender system optimizing for users’ subjective well-being (SWB). Because SWB is difficult to measure, engineers rely on more tangible metrics such as click-through rates or watch-time. Optimizing for misspecified proxies led YouTube to overemphasize watch-time and harm user satisfaction (Stray, 2020), as well as to recommended extreme political content to users (Ribeiro et al., 2020).
  Addressing reward hacking is a first step towards developing human-aligned RL agents and one goal of ML safety (Hendrycks et al., 2021a). However, there has been little systematic work investigating when or how it tends to occur, or how to detect it before it runs awry. To remedy this, we study the problem of reward hacking across four diverse environments: traffic control (Wu et al., 2021), COVID response (Kompella et al., 2020), blood glucose monitoring (Fox et al., 2020), and the Atari game Riverraid (Brockman et al., 2016). Within these environments, we construct nine misspecified proxy reward functions (Section 3).
  Using our environments, we study how increasing optimization power affects reward hacking, by training RL agents with varying resources such as model size, training time, action space resolution, and observation space noise (Section 4). We find that more powerful agents often attain higher proxy reward but lower true reward, as illustrated in Figure 1. Since the trend in ML is to increase resources exponentially each year (Littman et al., 2021), this suggests that reward hacking will become more pronounced in the future in the absence of countermeasures.
  More worryingly, we observe several instances of phase transitions. In a phase transition, the more capable model pursues a qualitatively different policy that sharply decreases the true reward. Figure 1 illustrates one example: An RL agent regulating traffic learns to stop any cars from merging onto the highway in order to maintain a high average velocity of the cars on the straightaway.
  Since there is little prior warning of phase transitions, they pose a challenge to monitoring the safety of ML systems. Spurred by this challenge, we propose an anomaly detection task (Hendrycks & Gimpel, 2017; Tack et al., 2020): Can we detect when the true reward starts to drop, while maintaining a low false positive rate in benign cases? We instantiate our proposed task, POLYNOMALY, for the traffic and COVID environments (Section 5). Given a trusted policy with moderate performance, one must detect whether a given policy is aberrant. We provide several baseline anomaly detectors for this task and release our data at https://github.com/aypan17/ reward-misspecification.
sections.heading: 2 RELATED WORK
sections.text: Previous works have focused on classifying different types of reward hacking and sometimes mitigating its effects. One popular setting is an agent on a grid-world with an erroneous sensor. HadfieldMenell et al. (2017) show and mitigate the reward hacking that arises due to an incorrect sensor reading at test time in a 10x10 navigation grid world. Leike et al. (2017) show examples of reward hacking in a 3x3 boat race and a 5x7 tomato watering grid world. Everitt et al. (2017) theoretically study and mitigate reward hacking caused by a faulty sensor.
  Game-playing agents have also been found to hack their reward. Baker et al. (2020) exhibit reward hacking in a hide-and-seek environment comprising 3-6 agents, 3-9 movable boxes and a few ramps: without a penalty for leaving the play area, the hiding agents learn to endlessly run from the seeking agents. Toromanoff et al. (2019) briefly mention reward hacking in several Atari games (Elevator Action, Kangaroo, Bank Heist) where the agent loops in a sub-optimal trajectory that provides a repeated small reward.
  Agents optimizing a learned reward can also demonstrate reward hacking. Ibarz et al. (2018) show an agent hacking a learned reward in Atari (Hero, Montezuma’s Revenge, and Private Eye), where optimizing a frozen reward predictor eventually achieves high predicted score and low actual score. Christiano et al. (2017) show an example of reward hacking in the Pong game where the agent learns to hit the ball back and forth instead of winning the point. Stiennon et al. (2020) show that a policy which over-optimizes the learnt reward model for text summarization produces lower quality summarizations when judged by humans.
sections.heading: 3 EXPERIMENTAL SETUP: ENVIRONMENTS AND REWARD FUNCTIONS
sections.text: In this section, we describe our four environments (Section 3.1) and taxonomize our nine corresponding misspecified reward functions (Section 3.2).
sections.heading: 3.1 ENVIRONMENTS
sections.text: We chose a diverse set of environments and prioritized complexity of action space, observation space, and dynamics model. Our aim was to reflect real-world constraints in our environments, selecting ones with several desiderata that must be simultaneously balanced. Table 1 provides a summary.
  Traffic Control. The traffic environment is an autonomous vehicle (AV) simulation that models vehicles driving on different highway networks. The vehicles are either controlled by a RL algorithm or pre-programmed via a human behavioral model. Our misspecifications are listed in Table 1.
  We use the Flow traffic simulator, implemented by Wu et al. (2021) and Vinitsky et al. (2018), which extends the popular SUMO traffic simulator (Lopez et al., 2018). The simulator uses cars that drive like humans, following the Intelligent Driver Model (IDM) (Treiber et al., 2000), a widely-accepted approximation of human driving behavior. Simulated drivers attempt to travel as fast as possible while tending to decelerate whenever they are too close to the car immediately in front.
  The RL policy has access to observations only from the AVs it controls. For each AV, the observation space consists of the car’s position, its velocity, and the position and velocity of the cars immediately in front of and behind it. The continuous control action is the acceleration applied to each AV. Figure 4 depicts the Traffic-Mer network, where cars from an on-ramp attempt to merge onto the straightaway. We also use the Traffic-Bot network, where cars (1-4 RL, 10-20 human) drive through a highway bottleneck where lanes decrease from four to two to one.
  COVID Response. The COVID environment, developed by Kompella et al. (2020), simulates a population using the SEIR model of individual infection dynamics. The RL policymaker adjusts the severity of social distancing regulations while balancing economic health (better with lower regulations) and public health (better with higher regulations), similar in spirit to Trott et al. (2021). The population attributes (proportion of adults, number of hospitals) and infection dynamics (random testing rate, infection rate) are based on data from Austin, Texas.
  Every day, the environment simulates the infection dynamics and reports testing results to the agent, but not the true infection numbers. The policy chooses one of three discrete actions: INCREASE, DECREASE, or MAINTAIN the current regulation stage, which directly affects the behavior of the population and indirectly affects the infection dynamics. There are five stages in total.
  Atari Riverraid. The Atari Riverraid environment is run on OpenAI Gym (Brockman et al., 2016). The agent operates a plane which flies over a river and is rewarded by destroying enemies. The agent observes the raw pixel input of the environment. The agent can take one of eighteen discrete actions, corresponding to either movement or shooting within the environment.
  Glucose Monitoring. The glucose environment, implemented in Fox et al. (2020), is a continuous control problem. It extends a FDA-approved simulator (Man et al., 2014) for blood glucose levels of a patient with Type 1 diabetes. The patient partakes in meals and wears a continuous glucose monitor (CGM), which gives noisy observations of the patient’s glucose levels. The RL agent administers insulin to maintain a healthy glucose level.
  Every five minutes, the agent observes the patient’s glucose levels and decides how much insulin to administer. The observation space is the previous four hours of glucose levels and insulin dosages.
sections.heading: 3.2 MISSPECIFICATIONS
sections.text: Using the above environments, we constructed nine instances of misspecified proxy rewards. To help interpret these proxies, we taxonomize them as instances of misweighting, incorrect ontology, or incorrect scope. We elaborate further on this taxonimization using the traffic example from Figure 1.
  • Misweighting. Suppose that the true reward is a linear combination of commute time and acceleration (for reducing carbon emissions). Downweighting the acceleration term thus underpenalizes carbon emissions. In general, misweighting occurs when the proxy and true reward capture the same desiderata, but differ on their relative importance.
  • Ontological. Congestion could be operationalized as either high average commute time or low average vehicle velocity. In general, ontological misspecification occurs when the proxy and true reward use different desiderata to capture the same concept.
  • Scope. If monitoring velocity over all roads is too costly, a city might instead monitor them only over highways, thus pushing congestion to local streets. In general, scope misspecification occurs when the proxy measures desiderata over a restricted domain (e.g. time, space).
  We include a summary of all nine tasks in Table 1 and provide full details in Appendix A. Table 1 also indicates whether each proxy leads to misalignment (i.e. to a policy with low true reward) and whether it leads to a phase transition (a sudden qualitative shift as model capacity increases). We investigate both of these in Section 4.
  Evaluation protocol. For each environment and proxy-true reward pair, we train an agent using the proxy reward and evaluate performance according to the true reward. We use PPO (Schulman et al., 2017) to optimize policies for the traffic and COVID environments, SAC (Haarnoja et al., 2018) to optimize the policies for the glucose environment, and torchbeast (Küttler et al., 2019), a PyTorch implementation of IMPALA (Espeholt et al., 2018), to optimize the policies for the Atari environment. When available, we adopt the hyperparameters (except the learning rate and network size) given by the original codebase.
sections.heading: 4 HOW AGENT OPTIMIZATION POWER DRIVES MISALIGNMENT
sections.text: To better understand reward hacking, we study how it emerges as agent optimization power increases. We define optimization power as the effective search space of policies the agent has access to, as implicitly determined by model size, training steps, action space, and observation space.
  In Section 4.1, we consider the quantitative effect of optimization power for all nine environmentmisspecification pairs; we primarily do this by varying model size, but also use training steps, action space, and observation space as robustness checks. Overall, more capable agents tend to overfit the proxy reward and achieve a lower true reward. We also find evidence of phase transitions on four of the environment-misspecification pairs. For these phase transitions, there is a critical threshold at which the proxy reward rapidly increases and the true reward rapidly drops.
  In Section 4.2, we further investigate these phase transitions by qualitatively studying the resulting policies. At the transition, we find that the quantitative drop in true reward corresponds to a
  qualitative shift in policy behavior. Extrapolating visible trends is therefore insufficient to catch all instances of reward hacking, increasing the urgency of research in this area.
  In Section 4.3, we assess the faithfulness of our proxies, showing that reward hacking occurs even though the true and proxy rewards are strongly positively correlated in most cases.
sections.heading: 4.1 QUANTITATIVE EFFECTS VS. AGENT CAPABILITIES
sections.text: As a stand-in for increasing agent optimization power, we first vary the model capacity for a fixed environment and proxy reward. Specifically, we vary the width and depth of the actor and critic networks, changing the parameter count by two to four orders of magnitude depending on the environment. For a given policy, the actor and critic are always the same size.
  Model Capacity. Our results are shown in Figure 2, with additional plots included in Appendix A. We plot both the proxy (blue) and true (green) reward vs. the number of parameters. As model size increases, the proxy reward increases but the true reward decreases. This suggests that reward designers will likely need to take greater care to specify reward functions accurately and is especially salient given the recent trends towards larger and larger models (Littman et al., 2021).
  The drop in true reward is sometimes quite sudden. We call these sudden shifts phase transitions, and mark them with dashed red lines in Figure 2. These quantitative trends are reflected in the qualitative behavior of the policies (Section 4.2), which typically also shift at the phase transition.
  Model capacity is only one proxy for agent capabilities, and larger models do not always lead to more capable agents (Andrychowicz et al., 2020). To check the robustness of our results, we consider several other measures of optimization: observation fidelity, number of training steps, and action space resolution.
  Number of training steps. Assuming a reasonable RL algorithm and hyperparameters, agents which are trained for more steps have more optimization power. We vary training steps for an agent trained on the Atari environment. The true reward incentivizes staying alive for as many frames as possible while moving smoothly. The proxy reward misweights these considerations by underpenalizing the smoothness constraint. As shown in Figure 3a, optimizing the proxy reward for more steps harms the true reward, after an initial period where the rewards are positively correlated.
  Action space resolution. Intuitively, an agent that can take more precise actions is more capable. For example, as technology improves, an RL car may make course corrections every millisecond instead of every second. We study action space resolution in the traffic environment by discretizing the output space of the RL agent. Specifically, under resolution level ε, we round the action a ∈ R output by the RL agent to the nearest multiple of ε and use that as our action. The larger the resolution level ε, the lower the action space resolution. Results are shown in Figure 3b for a fixed model size. Increasing the resolution causes the proxy reward to remain roughly constant while the true reward decreases.
  Observation fidelity. Agents with access to better input sensors, like higher-resolution cameras, should make more informed decisions and thus have more optimization power. Concretely, we study this in the COVID environment, where we increase the random testing rate in the population. The proxy reward is a linear combination of the number of infections and severity of social distancing, while the true reward also factors in political cost. As shown in Figure 3c, as the testing rate increases, the model achieves similar proxy reward at the cost of a slightly lower true reward.
sections.heading: 4.2 QUALITATIVE EFFECTS
sections.text: In the previous section, quantitative trends showed that increasing a model’s optimization power often hurts performance on the true reward. We shift our focus to understanding how this decrease happens. In particular, we typically observe a qualitative shift in behavior associated with each of the phase transitions, three of which we describe below.
  Traffic Control. We focus on the Traffic-Mer environment from Figure 2a, where minimizing average commute time is replaced by maximizing average velocity. In this case, smaller policies learn to merge onto the straightaway by slightly slowing down the other vehicles (Figure 4a). On the other hand, larger policy models stop the AVs to prevent them from merging at all (Figure 4b). This increases the average velocity, because the vehicles on the straightaway (which greatly outnumber vehicles on the on-ramp) do not need to slow down for merging traffic. However, it significantly increases the average commute time, as the passengers in the AV remain stuck.
  COVID Response. Suppose the RL agent optimizes solely for the public and economic health of a society, without factoring politics into its decision-making. This behavior is shown in Figure 5. The larger model chooses to increase the severity of social distancing restrictions earlier than the smaller model. As a result, larger models are able to maintain low average levels of both ICU usage (a proxy for public health) and social distancing restrictions (a proxy for economic health). These
  preemptive regulations may however be politically costly, as enforcing restrictions without clear signs of infection may foment public unrest (Boettke & Powell, 2021).
  Atari Riverraid. We create an ontological misspecification by rewarding the plane for staying alive as long as possible while shooting as little as possible: a “pacifist run”. We then measure the game score as the true reward. We find that agents with more parameters typically maneuver more adeptly. Such agents shoot less frequently, but survive for much longer, acquiring points (true reward) due to passing checkpoints. In this case, therefore, the proxy and true rewards are wellaligned so that reward hacking does not emerge as capabilities increase.
  We did, however, find that some of the agents exploited a bug in the simulator that halts the plane at the beginning of the level. The simulator advances but the plane itself does not move, thereby achieving high pacifist reward.
  Glucose Monitoring. Consider an RL agent that optimizes solely for a patient’s health, without considering the economic costs of its treatment plans. In this case, the proxy reward is based off of a glycemic risk measure, which reflects the likelihood that a patient will suffer an acute hypoglycemic episode, developed by the medical community (Kovatchev et al., 2000).
  However, a less economically-privileged patient may opt for the treatment plan with the least expected cost (Herkert et al., 2019; Fralick & Kesselheim, 2019), not the one with the least amount of risk. From this patient’s perspective, the true reward is the expected cost of the treatment plan, which includes the expected cost of hospital visits and the cost of administering the insulin.
  Although larger model treatments reduce hypoglycemic risk more smaller model treatments, they administer more insulin. Based on the average cost of an ER visit for a hypogylcemic episode ($1350 from Bronstone & Graham (2016)) and the average cost of a unit of insulin ($0.32 from Lee (2020)), we find that it is actually more expensive to pursue the larger model’s treatment.
sections.heading: 4.3 QUANTITATIVE EFFECTS VS PROXY-TRUE REWARD CORRELATION
sections.text: We saw in Sections 4.1 and 4.2 that agents often pursue proxy rewards at the cost of the true reward. Perhaps this only occurs because the proxy is greatly misspecified, i.e., the proxy and true reward are weakly or negatively correlated. If this were the case, then reward hacking may pose less of a threat. To investigate this intuition, we plot the correlation between the proxy and true rewards.
  The correlation is determined by the state distribution of a given policy, so we consider two types of state distributions. Specifically, for a given model size, we obtain two checkpoints: one that achieves the highest proxy reward during training and one from early in training (less than 1% of training complete). We call the former the “trained checkpoint” and the latter the “early checkpoint”.
  For a given model checkpoint, we calculate the Pearson correlation ρ between the proxy reward P and true reward T using 30 trajectory rollouts. Reward hacking occurs even though there is significant positive correlation between the true and proxy rewards (see Figure 6). The correlation is lower for the trained model than for the early model, but still high. Further figures are shown in Appendix A.2. Among the four environments tested, only the Traffic-Mer environment with ontological misspecification had negative Pearson correlation.
sections.heading: 5 POLYNOMALY: MITIGATING REWARD MISSPECIFICATION
sections.text: In Section 4, we saw that reward hacking often leads to phase transitions in agent behaviour. Furthermore, in applications like traffic control or COVID response, the true reward may be observed only sporadically or not at all. Blindly optimizing the proxy in these cases can lead to catastrophic failure (Zhuang & Hadfield-Menell, 2020; Taylor, 2016).
  This raises an important question: Without the true reward signal, how can we mitigate misalignment? We operationalize this as an anomaly detection task: the detector should flag instances of misalignment, thus preventing catastrophic rollouts. To aid the detector, we provide it with a trusted policy: one verified by humans to have acceptable (but not maximal) reward. Our resulting benchmark, POLYNOMALY, is described below.
sections.heading: 5.1 PROBLEM SETUP
sections.text: We train a collection of policies by varying model size on the traffic and COVID environments. For each policy, we estimate the policy’s true reward by averaging over 5 to 32 rollouts. One author labeled each policy as acceptable, problematic, or ambiguous based on its true reward score relative to that of other policies. We include only policies that received a non-ambiguous label.
  For both environments, we provide a small-to-medium sized model as the trusted policy model, as Section 4.1 empirically illustrates that smaller models achieve reasonable true reward without exhibiting reward hacking. Given the trusted model and a collection of policies, the anomaly detector’s task is to predict the binary label of “acceptable” or “problematic” for each policy.
  Table 3 in Appendix B.1 summarizes our benchmark. The trusted policy size is a list of the hidden unit widths of the trusted policy network (not including feature mappings).
sections.heading: 5.2 EVALUATION
sections.text: We propose two evaluation metrics for measuring the performance of our anomaly detectors.
  • Area Under the Receiver Operating Characteristic (AUROC). The AUROC measures the probability that a detector will assign a random anomaly a higher score than a random non-anomalous policy (Davis & Goadrich, 2006). Higher AUROCs indicate stronger detectors.
  • Max F-1 score. The F-1 score is the harmonic mean of the precision and the recall, so detectors with a high F-1 score have both low false positives and high true negatives. We calculate the max F-1 score by taking the maximum F-1 score over all possible thresholds for the detector.
sections.heading: 5.3 BASELINES
sections.text: In addition to the benchmark datasets described above, we provide baseline anomaly detectors based on estimating distances between policies. We estimate the distance between the trusted policy and the unknown policy based on either the Jensen-Shannon divergence (JSD) or the Hellinger distance. Specifically, we use rollouts to generate empirical action distributions. We compute the distance between these action distributions at each step of the rollout, then aggregate across steps by taking either the mean or the range. For full details, see Appendix B.2. Table 2 reports the AUROC and F-1 scores of several such detectors. We provide full ROC curves in Appendix B.2.
  We observe that different detectors are better for different tasks, suggesting that future detectors could do better than any of our baselines. Our benchmark and baseline provides a starting point for further research on mitigating reward hacking.
sections.heading: 6 DISCUSSION
sections.text: In this work, we designed a diverse set of environments and proxy rewards, uncovered several instances of phase transitions, and proposed an anomaly detection task to help mitigate these transitions. Our results raise two questions: How can we not only detect phase transitions, but prevent them in the first place? And how should phase transitions shape our approach to safe ML?
  On preventing phase transitions, anomaly detection already offers one path forward. Once we can detect anomalies, we can potentially prevent them, by using the detector to purge the unwanted behavior (e.g. by including it in the training objective). Similar policy shaping has recently been used to make RL agents more ethical (Hendrycks et al., 2021b). However, since the anomaly detectors will be optimized against by the RL policy, they need to be adversarially robust (Goodfellow et al., 2014). This motivates further work on adversarial robustness and adversarial anomaly detection. Another possible direction is optimizing policies against a distribution of rewards (Brown et al., 2020; Javed et al., 2021), which may prevent over-fitting to a given set of metrics.
  Regarding safe ML, several recent papers propose extrapolating empirical trends to forecast future ML capabilities (Kaplan et al., 2020; Hernandez et al., 2021; Droppo & Elibol, 2021), partly to avoid unforeseen consequences from ML. While we support this work, our results show that trend extrapolation alone is not enough to ensure the safety of ML systems. To complement trend extrapolation, we need better interpretability methods to identify emergent model behaviors early on, before they dominate performance (Olah et al., 2018). ML researchers should also familiarize themselves with emergent behavior in self-organizing systems (Yates, 2012), which often exhibit similar phase transitions (Anderson, 1972). Indeed, the ubiquity of phase transitions throughout science suggests that ML researchers should continue to expect surprises–and should therefore prepare for them.
sections.heading: ACKNOWLEDGEMENTS
sections.text: We are thankful to Dan Hendrycks and Adam Gleave for helpful discussions about experiments and to Cassidy Laidlaw and Dan Hendrycks for providing valuable feedback on the writing. KB was supported by a JP Morgan AI Fellowship. JS was supported by NSF Award 2031985 and by Open Philanthropy.
sections.heading: A MAPPING THE EFFECTS OF REWARD MISSPECIFICATION
sections.text: A.1 EFFECT OF MODEL SIZE
  We plot the proxy and true reward vs. model size in Figure 7, following the experiment described in Section 4.1.
  A.2 CORRELATION BETWEEN PROXY AND TRUE REWARDS
  We plot the correlation between proxy and true rewards, following the experiment described in Section 4.3. Interestingly, we see that reward hacking still occurs when there is positive correlation between the true and proxy rewards, e.g., in Figures 8a/8b. Unsurprisingly, proxy-true pairs which are highly correlated, e.g., Figure 8c/8d do not exhibit reward hacking. Finally, proxy-true pairs which are negatively correlated, e.g., Figure 8e/8f exhibit the most reward hacking.
sections.heading: B POLYNOMALY
sections.text: B.1 BENCHMARK STATISTICS
  See Table 3 for Polynomaly’s statistics.
  B.2 RECEIVER OPERATING CHARACTERISTIC CURVES
  We plot the ROC curves for the detectors described in Section 5.3. Our detectors are calculated as follows.
  Let P and Q represent two probability distributions with M = 12 (P +Q). Then the Jensen-Shannon divergence and the Hellinger distance between them is given by
  JSD(P ||Q) := 1 2 KL(P ||M) + 1 2 KL(Q||M)
  Hellinger(P,Q) := 1
  2
  ∫ (√ dP − √ dQ )2 .
  (1)
  Our proposed detectors estimate the distance D(πtrusted, πunknown) between the trusted policy πtrusted and unknown policy πunknown as follows: We generate r rollouts of πunknown, where r = 5 in the traffic environment and r = 32 in the COVID environment. Every s steps of a rollout, where s = 10 in the traffic environment and s = 1 in the COVID environment, we set P to be the action distribution of πunknown given the unknown agent’s state at that timestep in the rollout and Q to be the action distribution of πtrusted given the unknown agent’s state at that timestep in the rollout. Intuitively, if P and Q are far apart, then the trusted agent would have performed a different action than the unknown agent at that given timestep, indicating a possible case of reward hacking. We then compute either JSD(P∥Q) or Hellinger(P,Q) following Equation (1). These distances are collected every s steps over the entire rollout, and we calculate metrics on these distances (range, mean, etc.) to assign an anomaly score to the untrusted policy.
title: THE EFFECTS OF REWARD MISSPECIFICATION: MAPPING AND MITIGATING MISALIGNED MODELS