Sampling-guided exploration of active feature selection policies
Gabriel Bernardino, Anders Jonsson, Patrick Clarysse, Nicolas Duchateau

TL;DR
This paper introduces a reinforcement learning framework for active feature selection that efficiently handles larger datasets by focusing on promising feature combinations and reducing policy complexity, improving accuracy and decision simplicity.
Contribution
It extends previous RL-based feature selection methods to larger datasets with heuristic strategies and regularization, enabling scalable and compact decision policies.
Findings
Outperforms state-of-the-art methods in accuracy
Reduces complexity of feature acquisition policies
Effective on high-dimensional datasets with 56 features
Abstract
Determining the most appropriate features for machine learning predictive models is challenging regarding performance and feature acquisition costs. In particular, global feature choice is limited given that some features will only benefit a subset of instances. In previous work, we proposed a reinforcement learning approach to sequentially recommend which modality to acquire next to reach the best information/cost ratio, based on the instance-specific information already acquired. We formulated the problem as a Markov Decision Process where the state's dimensionality changes during the episode, avoiding data imputation, contrary to existing works. However, this only allowed processing a small number of features, as all possible combinations of features were considered. Here, we address these limitations with two contributions: 1) we expand our framework to larger datasets with a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification · Explainable Artificial Intelligence (XAI) · Machine Learning and Algorithms
