Stealthy Imitation: Reward-guided Environment-free Policy Stealing
On the map: LLM alignment / RLHF / preference optimisation → Reward hacking and misspecification
Abstract (arXiv)
Deep reinforcement learning policies, which are integral to modern control systems, represent valuable intellectual property. The development of these policies demands considerable resources, such as domain expertise, simulation fidelity, and real-world validation. These policies are potentially vulnerable to model stealing attacks, which aim to replicate their functionality using only black-box access. In this paper, we propose Stealthy Imitation, the first attack designed to steal policies without access to the environment or knowledge of the input range. This setup has not been considered by previous model stealing methods. Lacking access to the victim's input states distribution, Stealthy Imitation fits a reward model that allows to approximate it. We show that the victim policy is harder to imitate when the distribution of the attack queries matches that of the victim. We evaluate our approach across diverse, high-dimensional control tasks and consistently outperform prior data-free approaches adapted for policy stealing. Lastly, we propose a countermeasure that significantly diminishes the effectiveness of the attack.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Placed in Reward hacking and misspecification, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 22 of its 35 references that are in the map. First posted on arXiv 11 May 2024.
Builds on
22 of 35 references.
References · 22
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2016Stealing Machine Learning Models via Prediction APIscited by 602
- 2013Do Deep Nets Really Need to be Deep?cited by 466
- 2016Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samplescited by 439
- 2018Knockoff Nets: Stealing Functionality of Black-Box Modelscited by 285
- 2018PRADA: Protecting against DNN Model Stealing Attackscited by 159
- 2020Controlling Overestimation Bias with Truncated Mixture of Continuous Distributional Quantile Criticscited by 154
- 2017Data-Free Knowledge Distillation for Deep Neural Networkscited by 136
- 2019Zero-shot Knowledge Transfer via Adversarial Belief Matchingcited by 129
- 2020Data-Free Model Extractioncited by 121
10 more
- 2019Data-Free Adversarial Distillationcited by 90
- 2020Error Bounds of Imitating Policies and Environmentscited by 90
- 2019Prediction Poisoning: Towards Defenses Against DNN Model Stealing Attackscited by 79
- 2022Towards Data-Free Model Stealing in a Hard Label Settingcited by 57
- 2021panda-gym: Open-source goal-conditioned environments for robotic learningcited by 56
- 2017Model Extraction Warning in MLaaS Paradigmcited by 39
- 2022Controlling Commercial Cooling Systems Using Reinforcement Learningcited by 25
- 2020Stealing Deep Reinforcement Learning Models for Fun and Profitcited by 24
- 2023Dual Student Networks for Data-Free Model Stealingcited by 17
- 2019Adversarial Exploitation of Policy Imitationcited by 13
Built on by
Citing papers per year: 2025: 3.
3 papers.
Similar, not cited
Close in wording, no citation either way
- 2020Adversarial Imitation Learning via Random Search
- 2023Provably Efficient Adversarial Imitation Learning with Unknown Transitions
- 2024Efficient Imitation Learning with Conservative World Models
- 2022Imitating Opponent to Win: Adversarial Policy Imitation Learning in Two-player Competitive Games
- 2020Preventing Imitation Learning with Adversarial Policy Ensembles
- 2026Recovering Hidden Reward in Diffusion-Based Policies
- 2024EvIL: Evolution Strategies for Generalisable Imitation Learning
- 2019A New Framework for Query Efficient Active Imitation Learning