Continuous Optimization for Feature Selection with Permutation-Invariant Embedding and Policy-Guided Search
Rui Liu, Rui Xie, Zijun Yao, Yanjie Fu, Dongjie Wang
Abstract
Feature selection removes redundant features to enhance both performance and computational efficiency in downstream tasks. Existing methods often struggle to capture complex feature interactions and adapt to diverse scenarios. Recent advances in this domain have incorporated generative intelligence to address these drawbacks by uncovering intricate relationships between features. However, two key limitations remain: 1) embedding feature subsets in a continuous space is challenging due to permutation sensitivity, as changes in feature order can introduce biases and weaken the embedding learning process; 2) gradient-based search in the embedding space assumes convexity, which is rarely guaranteed, leading to reduced search effectiveness and suboptimal subsets. To address these limitations, we propose a new framework that can: 1) preserve feature subset knowledge in a continuous embedding space while ensuring permutation invariance; 2) effectively explore the embedding space without relying on strong convex assumptions. For the first objective, we develop an encoder-decoder paradigm to preserve feature selection knowledge into a continuous embedding space. This paradigm captures feature interactions through pairwise relationships within the subset, removing the influence of feature order on the embedding. Moreover, an inducing point mechanism is introduced to accelerate pairwise relationship computations. For the second objective, we employ a policy-based reinforcement learning (RL) approach to guide the exploration of the embedding space. The RL agent effectively navigates the space by balancing multiple objectives. By prioritizing high-potential regions adaptively and eliminating the reliance on convexity assumptions, this search strategy effectively reduces the risk of converging to local optima. Finally, we conduct extensive experiments to demonstrate the effectiveness, efficiency, robustness and explicitness of our model. Our code and dataset are publicly accessible on GitHub. https://github.com/RayLiu1103/CAPS.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 3439ce41-2fce-4aa1-b670-63dd331b45abCited by top-tier papers2
- Dimension-Aware Active Annotation for Aesthetic Perception via Multi-Agent Human-AI CollaborationYe Zhang, Jinlong He, Dongjie Wang, Yupeng Zhou et al.AAAI 2026
- Heterogeneous Multi-Agent Reinforcement Learning with Attention for Cooperative and Scalable Feature TransformationTao Zhe, Huazhen Fang, Kunpeng Liu, Qian Lou et al.KDD 2026
Builds on3
- Group-wise Reinforcement Feature Generation for Optimal and Explainable Representation Space ReconstructionDongjie Wang, Yanjie Fu, Kunpeng Liu, Xiaolin Li et al.KDD 2022 · 26 citations
- Few-shot Learning for Feature Selection with Hilbert-Schmidt Independence CriterionAtsutoshi Kumagai, Tomoharu Iwata, Yasutoshi Ida, Yasuhiro FujiwaraNeurIPS 2022 · 13 citations
- Unsupervised Generative Feature Transformation via Graph Contrastive Pre-training and Multi-objective Fine-tuningWangyang Ying, Dongjie Wang, Xuanming Hu, Yuanchun Zhou et al.KDD 2024 · 10 citations
Related papers
- Toward Efficient Automated Feature EngineeringKafeng Wang, Pengyang Wang, Chengzhong XuICDE 2023 · 6 citations
- Reinforcement-Enhanced Autoregressive Feature Transformation: Gradient-steered Search in Continuous Space for Postfix ExpressionsDongjie Wang, Meng Xiao, Min Wu, Pengfei Wang et al.NeurIPS 2023 · 34 citations
- Automatic Feature Selection By One-Shot Neural Architecture Search In Recommendation SystemsHe Wei, Yuekui Yang, Haiyang Wu, Yangyang Tang et al.WWW 2023 · 5 citations
- PA-FEAT: Fast Feature Selection for Structured Data via Progress-Aware Multi-Task Deep Reinforcement LearningJianing Zhang, Zhaojing Luo, Quanqing Xu, Meihui ZhangICDE 2023 · 3 citations
- Palm up: Playing in the Latent Manifold for Unsupervised PretrainingHao Liu, Tom Zahavy, Volodymyr Mnih, Satinder SinghNeurIPS 2022 · 8 citations
