Dual-Agent Reinforcement Learning for Automated Feature Generation

• URL: http://arxiv.org/abs/2505.12628v1
• Date: Mon, 19 May 2025 02:24:16 GMT
• Title: Dual-Agent Reinforcement Learning for Automated Feature Generation
• Authors: Wanfu Gao, Zengyao Man, Hanlin Pan, Kunpeng Liu,
• Abstract summary: Feature generation involves creating new features from raw data to capture complex relationships among the original features.<n>Current methods using reinforcement learning for feature generation have made feature exploration more flexible and efficient.<n>We propose a novel dual-agent reinforcement learning method for feature generation.
• Score: 3.635311806373203
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Feature generation involves creating new features from raw data to capture complex relationships among the original features, improving model robustness and machine learning performance. Current methods using reinforcement learning for feature generation have made feature exploration more flexible and efficient. However, several challenges remain: first, during feature expansion, a large number of redundant features are generated. When removing them, current methods only retain the best features each round, neglecting those that perform poorly initially but could improve later. Second, the state representation used by current methods fails to fully capture complex feature relationships. Third, there are significant differences between discrete and continuous features in tabular data, requiring different operations for each type. To address these challenges, we propose a novel dual-agent reinforcement learning method for feature generation. Two agents are designed: the first generates new features, and the second determines whether they should be preserved. A self-attention mechanism enhances state representation, and diverse operations distinguish interactions between discrete and continuous features. The experimental results on multiple datasets demonstrate that the proposed method is effective. The code is available at https://github.com/extess0/DARL.

Related papers

• ShuffleGate: An Efficient and Self-Polarizing Feature Selection Method for Large-Scale Deep Models in Industry [12.690406065558394]
  ShuffleGate shuffles all feature values across instances simultaneously.<n>It can generate well-separated feature importance scores and estimate the performance without retraining the model.<n>It has been successfully integrated into the daily iteration of Bilibili's search models across various scenarios.
  arXiv  Detail & Related papers  (2025-03-12T12:05:03Z)
• Task-Agnostic Guided Feature Expansion for Class-Incremental Learning [59.78858949137853]
  The ability to learn new concepts while preserve the learned knowledge is desirable for learning systems in Class-Incremental Learning (CIL)<n>Recently, feature expansion of the model become a prevalent solution for CIL, where the old features are fixed during the training of the new task while new features are expanded for the new tasks.<n>We propose a framework called Task-Agnostic Guided Feature Expansion (TagFex) to promote the learning and transferring of diverse features across tasks.
  arXiv  Detail & Related papers  (2025-03-02T09:56:50Z)
• Retain, Blend, and Exchange: A Quality-aware Spatial-Stereo Fusion Approach for Event Stream Recognition [57.74076383449153]
  We propose a novel dual-stream framework for event stream-based pattern recognition via differentiated fusion, termed EFV++. It models two common event representations simultaneously, i.e., event images and event voxels. We achieve new state-of-the-art performance on the Bullying10k dataset, i.e., $90.51%$, which exceeds the second place by $+2.21%$.
  arXiv  Detail & Related papers  (2024-06-27T02:32:46Z)
• Self-optimizing Feature Generation via Categorical Hashing Representation and Hierarchical Reinforcement Crossing [37.73656271138515]
  We propose a principled and generic representation-crossing framework to solve self-optimizing feature generation. We present extensive experimental results to demonstrate the effectiveness and efficiency of the proposed method.
  arXiv  Detail & Related papers  (2023-09-08T22:05:27Z)
• Exploring Fine-Grained Representation and Recomposition for Cloth-Changing Person Re-Identification [78.52704557647438]
  We propose a novel FIne-grained Representation and Recomposition (FIRe$2$) framework to tackle both limitations without any auxiliary annotation or data. Experiments demonstrate that FIRe$2$ can achieve state-of-the-art performance on five widely-used cloth-changing person Re-ID benchmarks.
  arXiv  Detail & Related papers  (2023-08-21T12:59:48Z)
• Mutual Exclusivity Training and Primitive Augmentation to Induce Compositionality [84.94877848357896]
  Recent datasets expose the lack of the systematic generalization ability in standard sequence-to-sequence models. We analyze this behavior of seq2seq models and identify two contributing factors: a lack of mutual exclusivity bias and the tendency to memorize whole examples. We show substantial empirical improvements using standard sequence-to-sequence models on two widely-used compositionality datasets.
  arXiv  Detail & Related papers  (2022-11-28T17:36:41Z)
• Adaptive Online Incremental Learning for Evolving Data Streams [4.3386084277869505]
  The first major difficulty is concept drift, that is, the probability distribution in the streaming data would change as the data arrives. The second major difficulty is catastrophic forgetting, that is, forgetting what we have learned before when learning new knowledge. Our research builds on this observation and attempts to overcome these difficulties.
  arXiv  Detail & Related papers  (2022-01-05T14:25:53Z)
• Tensor feature hallucination for few-shot learning [17.381648488344222]
  Few-shot classification addresses the challenge of classifying examples given limited supervision and limited data. Previous works on synthetic data generation for few-shot classification focus on exploiting complex models. We investigate how a simple and straightforward synthetic data generation method can be used effectively.
  arXiv  Detail & Related papers  (2021-06-09T18:25:08Z)
• Decoupled and Memory-Reinforced Networks: Towards Effective Feature Learning for One-Step Person Search [65.51181219410763]
  One-step methods have been developed to handle pedestrian detection and identification sub-tasks using a single network. There are two major challenges in the current one-step approaches. We propose a decoupled and memory-reinforced network (DMRNet) to overcome these problems.
  arXiv  Detail & Related papers  (2021-02-22T06:19:45Z)
• Multi-scale Interactive Network for Salient Object Detection [91.43066633305662]
  We propose the aggregate interaction modules to integrate the features from adjacent levels. To obtain more efficient multi-scale features, the self-interaction modules are embedded in each decoder unit. Experimental results on five benchmark datasets demonstrate that the proposed method without any post-processing performs favorably against 23 state-of-the-art approaches.
  arXiv  Detail & Related papers  (2020-07-17T15:41:37Z)
• Generative Feature Replay with Orthogonal Weight Modification for Continual Learning [20.8966035274874]
  generative replay is a promising strategy which generates and replays pseudo data for previous tasks to alleviate catastrophic forgetting. We propose to replay penultimate layer feature with a generative model; 2) leverage a self-supervised auxiliary task to further enhance the stability of feature. Empirical results on several datasets show our method always achieves substantial improvement over powerful OWM.
  arXiv  Detail & Related papers  (2020-05-07T13:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.