Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Opportunistic Learning: Budgeted Cost-Sensitive Learning from Data Streams (1901.00243v2)

Published 2 Jan 2019 in cs.LG, cs.AI, cs.NE, and stat.ML

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Mohammad Kachuee (25 papers)
  2. Orpaz Goldstein (6 papers)
  3. Sajad Darabi (15 papers)
  4. Majid Sarrafzadeh (30 papers)
  5. Kimmo Karkkainen (5 papers)
Citations (29)

Summary

We haven't generated a summary for this paper yet.