Classification with Costly Features as a Sequential Decision-Making Problem
Jaromír Janisch, Tomáš Pevný, Viliam Lisý
Code Available — Be the first to reproduce this paper.
ReproduceCode
- github.com/jaromiru/cwcfOfficialIn paperpytorch★ 0
- github.com/jaara/classification-with-costly-featurespytorch★ 0
Abstract
This work focuses on a specific classification problem, where the information about a sample is not readily available, but has to be acquired for a cost, and there is a per-sample budget. Inspired by real-world use-cases, we analyze average and hard variations of a directly specified budget. We postulate the problem in its explicit formulation and then convert it into an equivalent MDP, that can be solved with deep reinforcement learning. Also, we evaluate a real-world inspired setting with sparse training dataset with missing features. The presented method performs robustly well in all settings across several distinct datasets, outperforming other prior-art algorithms. The method is flexible, as showcased with all mentioned modifications and can be improved with any domain independent advancement in RL.