mlsanityData to 7 Oct 2026

Knockoff-Guided Feature Selection via A Single Pre-trained Reinforced Agent

arXiv 2403.04015 ↗First posted 6 Mar 2024cs.LG cs.AI stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

Feature selection prepares the AI-readiness of data by eliminating redundant features. Prior research falls into two primary categories: i) Supervised Feature Selection, which identifies the optimal feature subset based on their relevance to the target variable; ii) Unsupervised Feature Selection, which reduces the feature space dimensionality by capturing the essential information within the feature set instead of using target variable. However, SFS approaches suffer from time-consuming processes and limited generalizability due to the dependence on the target variable and downstream ML tasks. UFS methods are constrained by the deducted feature space is latent and untraceable. To address these challenges, we introduce an innovative framework for feature selection, which is guided by knockoff features and optimized through reinforcement learning, to identify the optimal and effective feature subset. In detail, our method involves generating "knockoff" features that replicate the distribution and characteristics of the original features but are independent of the target variable. Each feature is then assigned a pseudo label based on its correlation with all the knockoff features, serving as a novel metric for feature evaluation. Our approach utilizes these pseudo labels to guide the feature selection process in 3 novel ways, optimized by a single reinforced agent: 1). A deep Q-network, pre-trained with the original features and their corresponding pseudo labels, is employed to improve the efficacy of the exploration process in feature selection. 2). We introduce unsupervised rewards to evaluate the feature subset quality based on the pseudo labels and the feature space reconstruction loss to reduce dependencies on the target variable. 3). A new ε-greedy strategy is used, incorporating insights from the pseudo labels to make the feature selection process more effective.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 13 of its 76 references that are in the map. First posted on arXiv 6 Mar 2024.

Builds on

13 of 76 references.

References · 13

  1. 2016Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selectioncited by 120
  2. 2014Controlling the false discovery rate via knockoffscited by 97
  3. 2019Analysis of Explainers of Black Box Deep Neural Networks for Computer Vision: A Surveycited by 93
  4. 2018Temporal Difference Models: Model-Free Deep RL for Model-Based Controlcited by 89
  5. 2023Beyond Discrete Selection: Continuous Embedding Space Optimization for Generative Feature Selectioncited by 28
  6. 2015Survey on Feature Selectioncited by 25
  7. 2021Efficient Reinforced Feature Selection via Early Stopping Traverse Strategycited by 19
  8. 2017Gene Hunting with Knockoffs for Hidden Markov Modelscited by 14
  9. 2020Simplifying Reinforced Feature Selection via Restructured Choice Strategy of Single Agentcited by 14
  10. 2020False Discovery Rate Control via Data Splittingcited by 12
  11. 2018Knockoffs for the mass: new feature importance statistics with false discovery guaranteescited by 11
  12. 2018Auto-Encoding Knockoff Generator for FDR Controlled Variable Selectioncited by 8
1 more
  1. 2022C2IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selectioncited by 1

Built on by

Cited by year

Citing papers per year: 2024: 4; 2025: 10.

14 papers.

Sort:

By area: