Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams

01/02/2019
by   Mohammad Kachuee, et al.
0

In many real-world learning scenarios, features are only acquirable at a cost constrained under a budget. In this paper, we propose a novel approach for cost-sensitive feature acquisition at the prediction-time. The suggested method acquires features incrementally based on a context-aware feature-value function. We formulate the problem in the reinforcement learning paradigm, and introduce a reward function based on the utility of each feature. Specifically, MC dropout sampling is used to measure expected variations of the model uncertainty which is used as a feature-value function. Furthermore, we suggest sharing representations between the class predictor and value function estimator networks. The suggested approach is completely online and is readily applicable to stream learning setups. The solution is evaluated on three different datasets including the well-known MNIST dataset as a benchmark as well as two cost-sensitive datasets: Yahoo Learning to Rank and a dataset in the medical domain for diabetes classification. According to the results, the proposed method is able to efficiently acquire features and make accurate predictions.

READ FULL TEXT
research
11/03/2018

Dynamic Feature Acquisition Using Denoising Autoencoders

In real-world scenarios, different features have different acquisition c...
research
12/17/2019

Cost-Sensitive Feature-Value Acquisition Using Feature Relevance

In many real-world machine learning problems, feature values are not rea...
research
03/13/2019

Online Budgeted Learning for Classifier Induction

In real-world machine learning applications, there is a cost associated ...
research
02/19/2019

Nutrition and Health Data for Cost-Sensitive Learning

Traditionally, machine learning algorithms have been focused on modeling...
research
03/06/2020

Cost-Sensitive Portfolio Selection via Deep Reinforcement Learning

Portfolio Selection is an important real-world financial task and has at...
research
01/16/2014

Value of Information Lattice: Exploiting Probabilistic Independence for Effective Feature Subset Acquisition

We address the cost-sensitive feature acquisition problem, where misclas...
research
08/18/2022

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem

Maximum Common induced Subgraph (MCS) is an important NP-hard problem wi...

Please sign up or login with your details

Forgot password? Click here to reset