Costly Features Classification using Monte Carlo Tree Search

2021-02-14 · Ziheng Chen, Jin Huang, Hongshik Ahn, Xin Ning

We consider the problem of costly feature classification, where we sequentially select the subset of features to make a balance between the classification error and the feature cost. In this paper, we first cast the task into a MDP problem and use Advantage Actor Critic algorithm to solve it. In order to further improve the agent's performance and make the policy explainable, we employ the Monte Carlo Tree Search to update the policy iteratively. During the procedure, we also consider its performance on the unbalanced dataset and its sensitivity to the missing value. We evaluate our model on multiple datasets and find it outperforms other methods.

📄 PDF Abstract BibTeX arXiv:2102.07073

Code (0)

등록된 구현이 없습니다.

Tasks

Classification General ClassificationSensitivity

A Bayesian Decision Tree Algorithm

2019-01-10 · Giuseppe Nuti, Lluís Antoni Jiménez Rugama, Andreea-Ingrid Cross

Bayesian Decision Trees are known for their probabilistic interpretability. However, their construction can sometimes be costly. In this article we present a general Bayesian Decision Tree algorithm applicable to both re…

General Classification regression

Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms

2024-04-14 · Tristan Cazenave

Monte Carlo Tree Search and Monte Carlo Search have good results for many combinatorial problems. In this paper we propose to use Monte Carlo Search to design mathematical expressions that are used as exploration terms f…

Monte Carlo Tree Search for Generating Interactive Data Analysis Interfaces

2020-01-07 · Yiru Chen, Eugene Wu

Interactive tools like user interfaces help democratize data access for end-users by hiding underlying programming details and exposing the necessary widget interface to users. Since customized interfaces are costly to b…

Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network

2020-05-14 · Zhihao Xing, Shikui Tu, Lei Xu

We present a self-learning approach that combines deep reinforcement learning and Monte Carlo tree search to solve the traveling salesman problem. The proposed approach has two advantages. First, it adopts deep reinforce…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+2

Top-down particle filtering for Bayesian decision trees

2013-03-03 · Balaji Lakshminarayanan, Daniel M. Roy, Yee Whye Teh

Decision tree learning is a popular approach for classification and regression in machine learning and statistics, and Bayesian formulations---which introduce a prior distribution over decision trees, and formulate learn…