REVIEW 7 cited by
Knockoff-Guided Feature Selection via A Single Pre-trained Reinforced Agent
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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 {\epsilon}-greedy strategy is used, incorporating insights from the pseudo labels to make the feature selection process more effective.
Forward citations
Cited by 7 Pith papers
-
Bridging the Domain Gap in Equation Distillation with Reinforcement Feedback
Reinforcement learning fine-tuning with numerical fitness rewards improves equation discovery accuracy and noise robustness of a pretrained symbolic regression transformer.
-
Brownian Bridge Augmented Surrogate Simulation and Injection Planning for Geological CO$_2$ Storage
A Brownian bridge augmented framework improves surrogate simulation accuracy and injection plan quality on synthetic CO2 storage datasets compared with established baselines.
-
Sculpting Features from Noise: Reward-Guided Hierarchical Diffusion for Task-Optimal Feature Transformation
DIFFT generates task-optimal feature transformations via reward-guided latent diffusion with a semi-autoregressive decoder, outperforming ten baselines on 14 tabular datasets.
-
Teaching Time Series to See and Speak: Forecasting with Aligned Visual and Textual Perspectives
TimesCLIP aligns image-based and text-based views of the same time series via contrastive learning to improve forecasting accuracy on several benchmarks, but the full multimodal model is not used on two of the six lon...
-
Biological Pathway Guided Gene Selection Through Collaborative Reinforcement Learning
BioMARL combines pathway-guided pre-filtering with multi-agent reinforcement learning to select gene sets that predict cancer outcomes and enrich known biological pathways.
-
Agentic Feature Augmentation: Unifying Selection and Generation with Teaming, Planning, and Memories
A router-selector-generator LLM agent team with offline PPO and dual memories unifies feature selection and generation, reporting improved downstream performance on six tabular datasets.
-
LLM-ML Teaming: Integrated Symbolic Decoding and Gradient Search for Valid and Stable Generative Feature Transformation
A product-of-experts decoder that blends a fine-tuned LLM's token probabilities with a gradient-searched sequence decoder produces more valid and stable feature transformations than either alone.
Discussion (0). Sign in to comment.