Unsupervised Dynamic Feature Selection for Robust Latent Spaces in Vision Tasks
Not on the map. Why?
Abstract (arXiv)
Latent representations are critical for the performance and robustness of machine learning models, as they encode the essential features of data in a compact and informative manner. However, in vision tasks, these representations are often affected by noisy or irrelevant features, which can degrade the model's performance and generalization capabilities. This paper presents a novel approach for enhancing latent representations using unsupervised Dynamic Feature Selection (DFS). For each instance, the proposed method identifies and removes misleading or redundant information in images, ensuring that only the most relevant features contribute to the latent space. By leveraging an unsupervised framework, our approach avoids reliance on labeled data, making it broadly applicable across various domains and datasets. Experiments conducted on image datasets demonstrate that models equipped with unsupervised DFS achieve significant improvements in generalization performance across various tasks, including clustering and image generation, while incurring a minimal increase in the computational cost.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 44 references that are in the map. First posted on arXiv 2 Oct 2025.
Builds on
30 of 44 references.
References · 30
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2018World Modelscited by 1,444
- 2018Towards Accurate Generative Models of Video: A New Metric & Challengescited by 1,204
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 640
- 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 636
- 2020Prototypical Contrastive Learning of Unsupervised Representationscited by 636
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2016The CMA Evolution Strategy: A Tutorialcited by 364
- 2020SCAN: Learning to Classify Images without Labelscited by 351
18 more
- 2020Contrastive Clusteringcited by 264
- 2018Learning to Explain: An Information-Theoretic Perspective on Model Interpretationcited by 248
- 2017VAE with a VampPriorcited by 247
- 2017GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibriumcited by 208
- 2022On Feature Learning in the Presence of Spurious Correlationscited by 145
- 2015A Large-Scale Car Dataset for Fine-Grained Categorization and Verificationcited by 129
- 2019Concrete Autoencoders for Differentiable Feature Selection and Reconstructioncited by 90
- 2018Learning Deep Features for One-Class Classificationcited by 76
- 2021Clustering-friendly Representation Learning via Instance Discrimination and Feature Decorrelationcited by 65
- 2021Graph Contrastive Clusteringcited by 61
- 2022Twin Contrastive Learning for Online Clusteringcited by 60
- 2021Learning Representation for Clustering via Prototype Scattering and Positive Samplingcited by 58
- 2023Learning to Maximize Mutual Information for Dynamic Feature Selectioncited by 54
- 2021You Never Cluster Alonecited by 38
- 2021Locally Sparse Neural Networks for Tabular Biomedical Datacited by 34
- 2020Infinite Feature Selection: A Graph-based Feature Filtering Approachcited by 16
- 2021Instance-wise Causal Feature Selection for Model Interpretationcited by 8
- 2020E2E-FS: An End-to-End Feature Selection Method for Neural Networkscited by 4
Built on by
Not cited yet.