Using reinforcement learning to find an optimal set of features

2013-12-01 · Elsevier 2013 12 · Seyed Mehdi Hazrati Fard, Ali Hamzeh, Sattar Hashemi

Identifying the most characterizing features of observed data is critical for minimizing the classification error. Feature selection is the process of identifying a small subset of highly predictive features out of a large set of candidate features. In the literature, many feature selection methods approach the task as a search problem, where each state in the search space is a possible feature subset. In this study, we consider feature selection problem as a reinforcement learning problem in general and use a well-known method, temporal difference, to traverse the state space and select the best subset of features. Specifically, first, we consider the state space as a Markov decision process, and then we introduce an optimal graph search to overcome the complexity of the problem of concern. Since this approach needs a state evaluation paradigm as an aid to traverse the promising regions in the state space, the presence of a low-cost evaluation function is necessary. This method initially explores the lattice of feature sets, and then exploits the obtained experiments. Finally, two methods, based on filters and wrappers, are proposed for the ultimate selection of features. Our empirical evaluation shows that this strategy performs well in comparison with other commonly used feature selection strategies, while maintaining compatibility with all datasets in hand.

📄 PDF Abstract BibTeX

Code (1)

blefo/FSRLearning

Tasks

feature selectionreinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Teaching Inverse Reinforcement Learners via Features and Demonstrations

2018-10-21 · NeurIPS 2018 12 · Luis Haug, Sebastian Tschiatschek, Adish Singla

Learning near-optimal behaviour from an expert's demonstrations typically relies on the assumption that the learner knows the features that the true reward function depends on. In this paper, we study the problem of lear…

Reinforcement Learning

Value Pursuit Iteration

2012-12-01 · NeurIPS 2012 12 · Amir M. Farahmand, Doina Precup

Value Pursuit Iteration (VPI) is an approximate value iteration algorithm that finds a close to optimal policy for reinforcement learning and planning problems with large state spaces. VPI has two main features: First, …

Reinforcement Learning Reinforcement Learning (RL)

Cost Function Estimation Using Inverse Reinforcement Learning with Minimal Observations

2025-05-13 · Sarmad Mehrdad, Avadesh Meduri, Ludovic Righetti

We present an iterative inverse reinforcement learning algorithm to infer optimal cost functions in continuous spaces. Based on a popular maximum entropy criteria, our approach iteratively finds a weight improvement step…

Feature Construction for Inverse Reinforcement Learning

2010-12-01 · NeurIPS 2010 12 · Sergey Levine, Zoran Popovic, Vladlen Koltun

The goal of inverse reinforcement learning is to find a reward function for a Markov decision process, given example traces from its optimal policy. Current IRL techniques generally rely on user-supplied features that fo…

reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Solving Dynamic Graph Problems with Multi-Attention Deep Reinforcement Learning

2022-01-13 · Udesh Gunarathna, Renata Borovica-Gajic, Shanika Karunasekara, Egemen Tanin

Graph problems such as traveling salesman problem, or finding minimal Steiner trees are widely studied and used in data engineering and computer science. Typically, in real-world applications, the features of the graph t…

Combinatorial Optimization Deep Reinforcement Learning reinforcement-learning Reinforcement Learning (RL)+1