The paper introduces LIDFS, an unsupervised feature selection technique that uses Local Intrinsic Dimensionality (LID) to rank features based on their local discriminability. By treating each feature as a point and estimating its LID via maximum likelihood from distances to its k nearest neighboring features, LIDFS assigns higher importance to features with lower LID and refines the ranking to remove locally redundant features. Experiments on 23 high‑dimensional datasets show that LIDFS outperforms both classic and state‑of‑the‑art methods in supervised and clustering evaluations while running faster than its closest competitor.
By Oussama Chelly, Michael E. Houle, Ken-ichi Kawarabayashi, Muhammad Rajabinasab, Arthur Zimek
The paper introduces a meta‑learning framework that uses a rich set of dataset‑complexity meta‑features to predict the accuracy of different classifiers on image datasets, avoiding exhaustive training. By extracting features with autoencoders, pre‑trained networks, and dimensionality reduction, regression models estimate classifier accuracies, while clustering groups similar performers to simplify recommendations. Tested on 56 diverse image datasets, the method achieves over 86% ranking prediction accuracy, offering a scalable, interpretable solution for model selection and cost reduction.
By Zahra Nabizadeh_Shahre_Babak, Farzaneh Koohestani, Nader Karimi, Shahram Shirani, Shadrokh Samavi
arXiv:2607. 03839v1 Announce Type: new Abstract: Sparse feature selection is critical for high-dimensional machine learning, yet traditional $\ell_1$-regularized methods are often brittle under observational noise and spurious correlations, leading to unstable feature supports and degraded generalization.
By Zhen Huang, Peicheng Xu, Junbiao Pang, Yulong Zheng
The paper introduces Inverted Contrastive Learning for Unsupervised Feature Selection (ICLFS), a method that treats each feature as a sample by inverting the data matrix and applies a contrastive learning framework to learn consistent representations across masked positive views and a shuffled negative view. Feature saliency is derived from the magnitude of projector‑space embeddings, and a Laplacian‑Gated Ranking Correction step refines the ranking by reducing local redundancy. Experiments on 12 benchmark datasets show that ICLFS achieves the best clustering accuracy on 10 datasets compared to both classical and neural baselines, demonstrating the effectiveness of feature‑wise contrastive consistency for unsupervised feature selection.
By Utsab Ghosh, Roshni Chakraborty
arXiv:2311. 02960v5 Announce Type: replace Abstract: Over the past decade, deep learning has proven to be a highly effective tool for learning meaningful features from raw data.
By Peng Wang, Xiao Li, Can Yaras, Zhihui Zhu, Laura Balzano, Wei Hu, Qing Qu
arXiv:2508. 12745v2 Announce Type: replace-cross Abstract: Image set classification (ISC), which can be viewed as a task of comparing similarities between sets consisting of unordered heterogeneous images with variable quantities and qualities, has attracted growing research attention in recent years.
By Xizhan Gao, Wei Hu
arXiv:2611.07741v1 Announce Type: new
Abstract: Classification and feature learning are two closely interrelated fundamental tasks. Feature learning in supervised settings is typically achieved by tr...
By Qiufu Li, Huibin Xiao, Linlin Shen, Weijia Fan, Xi Jia, Yongdong Huang
The paper evaluates how different encoding strategies and pair selection methods affect Pairwise Difference Learning (PDC) for classification. It compares four encoders—including a new triplet with absolute difference—and four pair selection schemes across almost 200 datasets using several base models. The study finds that the new encoder yields the best average F1 scores, that using only upper‑triangle pairs cuts training time by about 40% with little accuracy loss, and that no single configuration dominates across all datasets.
By Bernard Georges, Mohamed Karim Belaid, Manuel Rodrigues
arXiv:2610.19436v1 Announce Type: cross
Abstract: Unsupervised feature selection (UFS) is of great significance in image processing and pattern recognition. Nevertheless, existing model-based methods...
By Jingjing Liu, Pei Tai, Xianchao Xiu, Wanquan Liu
arXiv:2609.38263v1 Announce Type: new
Abstract: Feature selection in neural networks remains a challenging problem, particularly in the presence of noisy or contaminated data. LassoNet is a recent ap...
By Daniela De Canditiis, Italia De Feis, Paola Stolfi
arXiv:2605. 18629v2 Announce Type: replace Abstract: Sparse autoencoders (SAEs) are one of the main methods to interpret the inner workings of deep neural networks (DNNs), decomposing activations into higher-dimensional features.
By Micha{\l} Brzozowski, Neo Christopher Chung
arXiv:2410. 01669v3 Announce Type: replace Abstract: Covariance Neural Networks (VNNs) perform graph convolutions on the covariance matrix of input data to leverage correlation information as pairwise connections.
By Andrea Cavallo, Zhan Gao, Elvin Isufi