arXiv:2010.03962
Test-Cost Sensitive Methods for Identifying Nearby Points
원문 초록
Real-world applications that involve missing values are often constrained by the cost to obtain data. Test-cost sensitive, or costly feature, methods additionally consider the cost of acquiring features. Such methods have been extensively studied in the problem of classification. In this paper, we study a related problem of test-cost sensitive methods to identify nearby points from a large set, given a new point with some unknown feature values. We present two models, one based on a tree and another based on Deep Reinforcement Learning. In our simulations, we show that the models outperform random agents on a set of five real-world data sets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Margin Trader: A Reinforcement Learning Framework for Portfolio Management with Margin and Constraints
Energy Harvesting Reconfigurable Intelligent Surface for UAV Based on Robust Deep Reinforcement Learning
Task Independent Capsule-Based Agents for Deep Q-Learning
User Allocation in Mobile Edge Computing: A Deep Reinforcement Learning Approach
Context-aware taxi dispatching at city-scale using deep reinforcement learning
Throughput Optimization for Grant-Free Multiple Access With Multiagent Deep Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.