Lune

ICML2020Top-tier venue

A Geometric Approach to Archetypal Analysis via Sparse Projections

Vinayak Abrol, Pulkit Sharma

Abstract

Archetypal analysis (AA) aims to extract patterns using self-expressive decomposition of data as convex combinations of extremal points (on the convex hull) of the data. This work presents a computationally efficient greedy AA (GAA) algorithm. GAA leverages the underlying geometry of AA, is scalable to larger datasets, and has significantly faster convergence rate. To achieve this, archetypes are learned via sparse projection of data. In the transformed space, GAA employs an iterative subset selection approach to identify archetypes based on the sparsity of convex representations. The work further presents the use of GAA algorithm for extended AA models such as robust and kernel AA. Experimental results show that GAA is considerably faster while performing comparable to existing methods for tasks such as classification, data visualization/categorization.

Ask Lune

Know this paper in minutes, not an afternoon.

Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.

1 top-tier paper has cited it since. Know what they found before your reviewers do.

Questions to start from

Lune can draw on

the full paper · the top-tier papers that cite it · related work

Get the answer

Free to start. No credit card required.

Lineage

Builds onCited byLeft to right by year; the more cited, the higher.

Cited by top-tier papers1

  1. Archetypal SAE: Adaptive and Stable Dictionary Learning for Concept Extraction in Large Vision ModelsThomas Fel, Ekdeep Singh Lubana, Jacob S. Prince, Matthew Kowal et al.ICML 2025

Related papers

  1. Extending Kernel PCA through Dualization: Sparsity, Robustness and Fast AlgorithmsFrancesco Tonin, Alex Lambert, Panagiotis Patrinos, Johan A. K. SuykensICML 2023 · 3 citations
  2. A Generalized Geometric Theoretical Framework of Centroid Discriminant Analysis for Linear Classification of Multi-dimensional DataYue Wu, Jialin Zhao, Carlo Vittorio CannistraciICLR 2026
  3. Efficient Adversarial Contrastive Learning via Robustness-Aware Coreset SelectionXilie Xu, Jingfeng Zhang, Feng Liu, Masashi Sugiyama et al.NeurIPS 2023 · 26 citations
  4. Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub-OptimalityGuihong Wan, Haim SchweitzerAAAI 2021 · 3 citations
  5. Efficient Dictionary Learning with Switch Sparse AutoencodersAnish Mudide, Joshua Engels, Eric J. Michaud, Max Tegmark et al.ICLR 2025
Dusk over the sea between two cliffs drawn in fine vertical lines