Supervised Dimensionality Reduction and Visualization using Centroid-encoder
Not on the map. Why?
Abstract (arXiv)
Visualizing high-dimensional data is an essential task in Data Science and Machine Learning. The Centroid-Encoder (CE) method is similar to the autoencoder but incorporates label information to keep objects of a class close together in the reduced visualization space. CE exploits nonlinearity and labels to encode high variance in low dimensions while capturing the global structure of the data. We present a detailed analysis of the method using a wide variety of data sets and compare it with other supervised dimension reduction techniques, including NCA, nonlinear NCA, t-distributed NCA, t-distributed MCML, supervised UMAP, supervised PCA, Colored Maximum Variance Unfolding, supervised Isomap, Parametric Embedding, supervised Neighbor Retrieval Visualizer, and Multiple Relational Embedding. We empirically show that centroid-encoder outperforms most of these techniques. We also show that when the data variance is spread across multiple modalities, centroid-encoder extracts a significant amount of information from the data in low dimensional space. This key feature establishes its value to use it as a tool for data visualization.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 3; 2024: 0; 2025: 3; 2026: 1.
10 papers.
- 2021Inspect, Understand, Overcome: A Survey of Practical Methods for AI Safetycited by 35
- 2025Random Forest Autoencoders for Guided Representation Learningcited by 4
- 2022Sparse Centroid-Encoder: A Nonlinear Model for Feature Selectioncited by 0
- 2022A Brief Survey on Representation Learning based Graph Dimensionality Reduction Techniquescited by 0
- 2023Yet Another Algorithm for Supervised Principal Component Analysis: Supervised Linear Centroid-Encodercited by 0
- 2023Feature Selection using Sparse Adaptive Bottleneck Centroid-Encodercited by 0
- 2023Sparse Linear Centroid-Encoder: A Convex Method for Feature Selectioncited by 0
- 2025A Convex formulation for linear discriminant analysiscited by 0
- 2025Why Can't I See My Clusters? A Precision-Recall Approach to Dimensionality Reduction Validationcited by 0
- 2026Online Supervised Dimension Reduction with Random Features: Diagnostics and Computational Trade-offscited by 0
- 2026Online Supervised Dimension Reduction with Random Features: Diagnostics and Computational Trade-offs17 Sep 2026
- 2025Why Can't I See My Clusters? A Precision-Recall Approach to Dimensionality Reduction Validation4 Sep 2025
- 2025A Convex formulation for linear discriminant analysis17 Mar 2025
- 2025Random Forest Autoencoders for Guided Representation Learning18 Feb 2025
- 2023Sparse Linear Centroid-Encoder: A Convex Method for Feature Selection7 Jun 2023
- 2023Feature Selection using Sparse Adaptive Bottleneck Centroid-Encoder7 Jun 2023
- 2023Yet Another Algorithm for Supervised Principal Component Analysis: Supervised Linear Centroid-Encoder7 Jun 2023
- 2022A Brief Survey on Representation Learning based Graph Dimensionality Reduction Techniques13 Oct 2022
- 2022Sparse Centroid-Encoder: A Nonlinear Model for Feature Selection30 Jan 2022
- 2021Inspect, Understand, Overcome: A Survey of Practical Methods for AI Safety29 Apr 2021