mlsanityData to 14 Oct 2026

AutoFS: Automated Feature Selection via Diversity-aware Interactive Reinforcement Learning

arXiv 2008.12001 ↗First posted 27 Aug 2020cs.LG cs.AI stat.MLcited by 24

Not on the map. Why?

Abstract (arXiv)

In this paper, we study the problem of balancing effectiveness and efficiency in automated feature selection. Feature selection is a fundamental intelligence for machine learning and predictive analysis. After exploring many feature selection methods, we observe a computational dilemma: 1) traditional feature selection methods (e.g., mRMR) are mostly efficient, but difficult to identify the best subset; 2) the emerging reinforced feature selection methods automatically navigate feature space to explore the best subset, but are usually inefficient. Are automation and efficiency always apart from each other? Can we bridge the gap between effectiveness and efficiency under automation? Motivated by such a computational dilemma, this study is to develop a novel feature space navigation method. To that end, we propose an Interactive Reinforced Feature Selection (IRFS) framework that guides agents by not just self-exploration experience, but also diverse external skilled trainers to accelerate learning for feature exploration. Specifically, we formulate the feature selection problem into an interactive reinforcement learning framework. In this framework, we first model two trainers skilled at different searching strategies: (1) KBest based trainer; (2) Decision Tree based trainer. We then develop two strategies: (1) to identify assertive and hesitant agents to diversify agent training, and (2) to enable the two trainers to take the teaching role in different stages to fuse the experiences of the trainers and diversify teaching process. Such a hybrid teaching strategy can help agents to learn broader knowledge, and, thereafter, be more effective. Finally, we present extensive experiments on real-world datasets to demonstrate the improved performances of our method: more efficient than existing reinforced selection and more effective than classic selection.

Key facts. Cited by 24 papers in the map (data through 14 Oct 2026). First posted on arXiv 27 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 4; 2023: 3; 2024: 6; 2025: 7; 2026: 2.

24 papers.

Sort:

By area:

  1. 2024A Comprehensive Survey on Data Augmentationcited by 40
  2. 2022AutoField: Automating Feature Selection in Deep Recommender Systemscited by 30
  3. 2023Beyond Discrete Selection: Continuous Embedding Space Optimization for Generative Feature Selectioncited by 28
  4. 2021Intelligent Electric Vehicle Charging Recommendation Based on Multi-Agent Reinforcement Learningcited by 20
  5. 2021Efficient Reinforced Feature Selection via Early Stopping Traverse Strategycited by 19
  6. 2024Deep Frequency Derivative Learning for Non-stationary Time Series Forecastingcited by 13
  7. 2024TFWT: Tabular Feature Weighting with Transformercited by 12
  8. 2024ERASE: Benchmarking Feature Selection Methods for Deep Recommender Systemscited by 9
  9. 2024FedGCS: A Generative Framework for Efficient Client Selection in Federated Learning via Gradient-based Optimizationcited by 9
  10. 2023UADB: Unsupervised Anomaly Detection Boostercited by 8
  11. 2025LLM Meeting Decision Trees on Tabular Datacited by 8
  12. 2023Feature Interaction Aware Automated Data Representation Transformationcited by 6
12 more
  1. 2022A Comprehensive Survey on Automated Machine Learning for Recommendationscited by 4
  2. 2022Feature and Instance Joint Selection: A Reinforcement Learning Perspectivecited by 3
  3. 2022Toward Efficient Automated Feature Engineeringcited by 2
  4. 2024Enhancing Classification Performance via Reinforcement Learning for Feature Selectioncited by 2
  5. 2025Towards Data-Centric AI: A Comprehensive Survey of Traditional, Reinforcement, and Generative Approaches for Tabular Data Transformationcited by 2
  6. 2025Automation and Feature Selection Enhancement with Reinforcement Learning (RL)cited by 2
  7. 2025Comprehend, Divide, and Conquer: Feature Subspace Exploration via Multi-Agent Hierarchical Reinforcement Learningcited by 1
  8. 2025How Usable is Automated Feature Engineering for Tabular Data?cited by 1
  9. 2025Feature selection based on cluster assumption in PU learningcited by 0
  10. 2025P-CAFE: Personalized Cost-Aware Incremental Feature Selection For Electronic Health Recordscited by 0
  11. 2026Rethinking Recurrent Neural Networks for Time Series Forecasting: A Reinforced Recurrent Encoder with Prediction-Oriented Proximal Policy Optimizationcited by 0
  12. 2026FlowPipe: LLM-Enhanced Conditional Generative Flow Networks for Data Preparation Pipeline Constructioncited by 0