MEL: Efficient Multi-Task Evolutionary Learning for High-Dimensional Feature Selection
Not on the map. Why?
Abstract (arXiv)
Feature selection is a crucial step in data mining to enhance model performance by reducing data dimensionality. However, the increasing dimensionality of collected data exacerbates the challenge known as the "curse of dimensionality", where computation grows exponentially with the number of dimensions. To tackle this issue, evolutionary computational (EC) approaches have gained popularity due to their simplicity and applicability. Unfortunately, the diverse designs of EC methods result in varying abilities to handle different data, often underutilizing and not sharing information effectively. In this paper, we propose a novel approach called PSO-based Multi-task Evolutionary Learning (MEL) that leverages multi-task learning to address these challenges. By incorporating information sharing between different feature selection tasks, MEL achieves enhanced learning ability and efficiency. We evaluate the effectiveness of MEL through extensive experiments on 22 high-dimensional datasets. Comparing against 24 EC approaches, our method exhibits strong competitiveness. Additionally, we have open-sourced our code on GitHub at https://github.com/wangxb96/MEL.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 6 of its 82 references that are in the map. First posted on arXiv 14 Feb 2024.
Builds on
6 of 82 references.
References · 6
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2017A Survey on Multi-Task Learningcited by 840
- 2021UniT: Multimodal Multitask Learning with a Unified Transformercited by 195
- 2020A Multitask Learning Approach for Diacritic Restorationcited by 12
- 2021A Self-adaptive Weighted Differential Evolution Approach for Large-scale Feature Selectioncited by 4
- 2014Flower Pollination Algorithm: A Novel Approach for Multiobjective Optimizationcited by 2
Built on by
Citing papers per year: 2025: 4; 2026: 2.
6 papers.
- 2025Continuous Optimization for Feature Selection with Permutation-Invariant Embedding and Policy-Guided Searchcited by 7
- 2025Permutation-Invariant Representation Learning for Robust and Privacy-Preserving Feature Selectioncited by 4
- 2025SurvBench: A Standardised Preprocessing Pipeline for Multi-Modal Electronic Health Record Survival Analysiscited by 2
- 2025Iterative Feature Space Optimization through Incremental Adaptive Evaluationcited by 1
- 2026Meta-Sel: Efficient Demonstration Selection for In-Context Learning via Supervised Meta-Learningcited by 0
- 2026Geometric Manifold Rectification for Imbalanced Learningcited by 0
- 2026Geometric Manifold Rectification for Imbalanced Learning13 Feb 2026
- 2026Meta-Sel: Efficient Demonstration Selection for In-Context Learning via Supervised Meta-Learning12 Feb 2026
- 2025SurvBench: A Standardised Preprocessing Pipeline for Multi-Modal Electronic Health Record Survival Analysis14 Nov 2025
- 2025Permutation-Invariant Representation Learning for Robust and Privacy-Preserving Feature Selection7 Oct 2025
- 2025Continuous Optimization for Feature Selection with Permutation-Invariant Embedding and Policy-Guided Search16 May 2025
- 2025Iterative Feature Space Optimization through Incremental Adaptive Evaluation24 Jan 2025