Apr 2025· ACM Transactions on Knowledge Discovery from Data· Vol 20, pp. 1 - 25· 1 citation· 79 references
Computer Science
TL;DR
Compared to contemporary or one-feature-one-agent RL-based approaches, HRLFS improves the downstream ML performance with iterative feature subspace exploration while accelerating total runtime by reducing the number of agents involved.
Abstract
Feature selection aims to preprocess the target dataset, find an optimal and most streamlined feature subset, and enhance the downstream machine learning task. Among filter, wrapper, and embedded-based approaches, the reinforcement learning (RL)-based subspace exploration strategy provides a novel objective optimization-directed perspective and promising performance. Nevertheless, even with improved performance, current reinforcement learning approaches face challenges similar to conventional methods when dealing with complex datasets. These challenges stem from the inefficient paradigm of using one-agent-per-feature and the inherent complexities present in the datasets. This observation motivates us to investigate and address the above issue and propose a novel approach, namely HRLFS. Our methodology initially employs a Large Language Model (LLM)-based hybrid state extractor to capture each feature’s mathematical and semantic characteristics. Based on this information, features are clustered, facilitating the construction of hierarchical agents for each cluster and sub-cluster. Extensive experiments demonstrate the efficiency, scalability, and robustness of our approach. Compared to contemporary or one-feature-one-agent RL-based approaches, HRLFS improves the downstream ML performance with iterative feature subspace exploration while accelerating total runtime by reducing the number of agents involved. Our code and dataset are publicly accessible on GitHub and Huggingface.
Trie-GRPO, a novel reinforcement learning algorithm based on action prefix trees, which enables step-level advantage estimation, is introduced, which resolves the credit assignment problem by isolating intermediate correct decisions from downstream errors, while effectively balancing exploration efficiency and depth co...
This work proposes MCRL2, a novel reinforcement learning approach augmented with multi-resource cross-attention-based representation learning for microservice scheduling that significantly outperforms existing baselines in load balancing, scheduling success rate and average completion time across diverse workload patte...
Tiangang Li, Shi Ying, Xiang-Bo Tian et al.· 0 citations
High-dimensional bioinformatics data, characterized by a large number of features relative to the number of samples, pose major challenges such as the ``curse of dimensionality,''leading to overfitting, high computational cost, and poor generalization. Traditional feature selection methods often suffer from limited sca...
This work reformulates LoRA-based CL as a consistent feature mapping problem that mimics the behavior of the joint-training upper bound, wherein a unified adaptation parameter matrix is learned to simultaneously capture the input-output relationships established by all task-specific LoRAs.
Yue Lu, Shi-Zhou Zhang, De Cheng et al.· IEEE Transactions on Pattern...· 0 citations
ECHO-$k$ is introduced, a task-agnostic and self-supervised learning principle for modality acquisition that uses a deep model's internal pretrained representations as proxy targets that summarize cross-modal information and consistently improves budgeted downstream performance across diverse foundation-model backends.
Eeshaan Jain, L. Bleistein, B. Deplancke et al.· 0 citations
This work compares three fusion paradigms by the artefacts they reuse and suggests that Merge when experts already exist and cheap fusion is paramount; Mix RL when training a unified model without experts, with domain proportions adjusted for cross-domain transfer; and MOPD when preserving domain-specific gains matters...
Sicheng Wu, Kai Yang, Yu-Chen Cai et al.· 5 citations· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.