Cost-Bounded Active Classification Using Partially Observable Markov Decision Processes
Abstract
Active classification, i.e., the sequential decision making process aimed at data acquisition for classification purposes, arises naturally in many applications, including medical diagnosis, intrusion detection, and object tracking. In this work, we study the problem of actively classifying dynamical systems with a finite set of Markov decision process (MDP) models. We are interested in finding strategies that actively interact with the dynamical system, and observe its reactions so that the true model is determined efficiently with high confidence. To this end, we present a decision-theoretic framework based on partially observable Markov decision processes (POMDPs). The proposed framework relies on assigning a classification belief (a probability distribution) to each candidate MDP model. Given an initial belief, some misclassification probabilities, a cost bound, and a finite time horizon, we design POMDP strategies leading to classification decisions. We present two different approaches to find such strategies. The first approach computes the optimal strategy "exactly" using value iteration. To overcome the computational complexity of finding exact solutions, the second approach is based on adaptive sampling to approximate the optimal probability of reaching a classification decision. We illustrate the proposed methodology using two examples from medical diagnosis and intruder detection.
Additional Information
© 2019 AACC. This work was supported by AFOSR FA9550-19-1-0005, DARPA D19AP00004, NSF 1646522 and NSF 1652113.Attached Files
Submitted - 1810.00097.pdf
Files
Name | Size | Download all |
---|---|---|
md5:457c00bfa25fdfbe628f2eb106ff4a33
|
466.2 kB | Preview Download |
Additional details
- Eprint ID
- 98463
- Resolver ID
- CaltechAUTHORS:20190905-154452427
- FA9550-19-1-0005
- Air Force Office of Scientific Research (AFOSR)
- D19AP00004
- Defense Advanced Research Projects Agency (DARPA)
- CNS-1646522
- NSF
- CNS-1652113
- NSF
- Created
-
2019-09-05Created from EPrint's datestamp field
- Updated
-
2023-06-02Created from EPrint's last_modified field