paper-with-me

Papers

MDPFuzz: Testing Models Solving Markov Decision Processes

2021-12-06 · Qi Pang, Yuanyuan Yuan, Shuai Wang

The Markov decision process (MDP) provides a mathematical framework for modeling sequential decision-making problems, many of which are crucial to security and safety, such as autonomous driving and robot control. The rapid development of artificial intelligence research has created efficient methods for solving MDPs, such as deep neural networks (DNNs), reinforcement learning (RL), and imitation learning (IL). However, these popular models solving MDPs are neither thoroughly tested nor rigorously reliable. We present MDPFuzz, the first blackbox fuzz testing framework for models solving MDPs. MDPFuzz forms testing oracles by checking whether the target model enters abnormal and dangerous states. During fuzzing, MDPFuzz decides which mutated state to retain by measuring if it can reduce cumulative rewards or form a new state sequence. We design efficient techniques to quantify the "freshness" of a state sequence using Gaussian mixture models (GMMs) and dynamic expectation-maximization (DynEM). We also prioritize states with high potential of revealing crashes by estimating the local sensitivity of target models over states. MDPFuzz is evaluated on five state-of-the-art models for solving MDPs, including supervised DNN, RL, IL, and multi-agent RL. Our evaluation includes scenarios of autonomous driving, aircraft collision avoidance, and two games that are often used to benchmark RL. During a 12-hour run, we find over 80 crash-triggering state sequences on each model. We show inspiring findings that crash-triggering states, though they look normal, induce distinct neuron activation patterns compared with normal states. We further develop an abnormal behavior detector to harden all the evaluated models and repair them with the findings of MDPFuzz to significantly enhance their robustness without sacrificing accuracy.

📄 PDF Abstract BibTeX arXiv:2112.02807

Code (0)

등록된 구현이 없습니다.

Tasks

Autonomous DrivingCollision AvoidanceDecision MakingImitation LearningReinforcement Learning (RL)Sequential Decision Making

Methods 이 논문이 사용한 방법론

Repair 설명 없음

Similar Papers 제목 키워드 기반

Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes

2013-02-06 · Anthony R. Cassandra, Michael L. Littman, Nevin Lianwen Zhang

Most exact algorithms for general partially observable Markov decision processes (POMDPs) use a form of dynamic programming in which a piecewise-linear and convex representation of one value function is transformed into …

Does the Markov Decision Process Fit the Data: Testing for the Markov Property in Sequential Decision Making

2020-02-05 · ICML 2020 1 · Chengchun Shi, Runzhe Wan, Rui Song, Wenbin Lu 외

The Markov assumption (MA) is fundamental to the empirical validity of reinforcement learning. In this paper, we propose a novel Forward-Backward Learning procedure to test MA in sequential decision making. The proposed …

Decision Makingreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1

Constructing Non-Markovian Decision Process via History Aggregator

2025-06-30 · Yongyi Wang, Wenxin Li

In the domain of algorithmic decision-making, non-Markovian dynamics manifest as a significant impediment, especially for paradigms such as Reinforcement Learning (RL), thereby exerting far-reaching consequences on the a…

Decision MakingReinforcement Learning (RL)

Decentralized Control of Partially Observable Markov Decision Processes using Belief Space Macro-actions

2015-02-20 · Shayegan Omidshafiei, Ali-akbar Agha-mohammadi, Christopher Amato, Jonathan P. How

The focus of this paper is on solving multi-robot planning problems in continuous spaces with partial observability. Decentralized partially observable Markov decision processes (Dec-POMDPs) are general models for multi-…

Decision Making

Penetration Testing == POMDP Solving?

2013-06-19 · Carlos Sarraute, Olivier Buffet, Joerg Hoffmann

Penetration Testing is a methodology for assessing network security, by generating and executing possible attacks. Doing so automatically allows for regular and systematic testing without a prohibitive amount of human la…