Unsupervised Feature Selection via Robust Autoencoder and Adaptive Graph Learning

arXiv stat.ML / 3/23/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper identifies limitations of existing unsupervised feature selection methods that rely on linear mappings and assume uniform cluster distributions, and proposes a robust autoencoder-based approach to capture nonlinear feature relationships and improve robustness to outliers.
  • The proposed Robust Autoencoder-based Unsupervised Feature Selection (RAEUFS) model uses a deep autoencoder to learn nonlinear representations while enhancing resilience to outliers and enabling feature selection.
  • An adaptive graph learning component and an efficient optimization algorithm are developed to jointly learn representations and discriminative features.
  • Extensive experiments demonstrate that RAEUFS outperforms state-of-the-art UFS methods on both clean data and data with outlier contamination.

Abstract

Effective feature selection is essential for high-dimensional data analysis and machine learning. Unsupervised feature selection (UFS) aims to simultaneously cluster data and identify the most discriminative features. Most existing UFS methods linearly project features into a pseudo-label space for clustering, but they suffer from two critical limitations: (1) an oversimplified linear mapping that fails to capture complex feature relationships, and (2) an assumption of uniform cluster distributions, ignoring outliers prevalent in real-world data. To address these issues, we propose the Robust Autoencoder-based Unsupervised Feature Selection (RAEUFS) model, which leverages a deep autoencoder to learn nonlinear feature representations while inherently improving robustness to outliers. We further develop an efficient optimization algorithm for RAEUFS. Extensive experiments demonstrate that our method outperforms state-of-the-art UFS approaches in both clean and outlier-contaminated data settings.