Classification and Representation via Separable Subspaces: Performance Limits and Algorithms

2017-05-07 · Ishan Jindal, Matthew Nokleby

We study the classification performance of Kronecker-structured models in two asymptotic regimes and developed an algorithm for separable, fast and compact K-S dictionary learning for better classification and representation of multidimensional signals by exploiting the structure in the signal. First, we study the classification performance in terms of diversity order and pairwise geometry of the subspaces. We derive an exact expression for the diversity order as a function of the signal and subspace dimensions of a K-S model. Next, we study the classification capacity, the maximum rate at which the number of classes can grow as the signal dimension goes to infinity. Then we describe a fast algorithm for Kronecker-Structured Learning of Discriminative Dictionaries (K-SLD2). Finally, we evaluate the empirical classification performance of K-S models for the synthetic data, showing that they agree with the diversity order analysis. We also evaluate the performance of K-SLD2 on synthetic and real-world datasets showing that the K-SLD2 balances compact signal representation and good classification performance.

📄 PDF Abstract BibTeX arXiv:1705.02556

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationDictionary LearningDiversityGeneral Classification

Sparse Subspace Clustering Friendly Deep Dictionary Learning for Hyperspectral Image Classification

2021-11-27 · Anurag Goel, Angshul Majumdar

Subspace clustering techniques have shown promise in hyperspectral image segmentation. The fundamental assumption in subspace clustering is that the samples belonging to different clusters/segments lie in separable subsp…

Clustering Dictionary Learning Hyperspectral Image Classification hyperspectral image clustering+6

End-to-end Early Classification of Time Series in Non-Stationary Environments

2026-08-20 · Aurélien Renault, Alexis Bondu, Antoine Cornuéjols, Vincent Lemaire arxiv

Early Classification of Time Series (ECTS) requires making accurate decisions as early as possible in inherently online and evolving environments. Yet, most existing methods assume stationarity and rely on separable desi…

Reinforcement Learning

Robust Representation Learning in Masked Autoencoders

2026-02-03 · Anika Shrivastava, Renu Rameshan, Samar Agnihotri arxiv

Masked Autoencoders (MAEs) achieve impressive performance in image classification tasks, yet the internal representations they learn remain less understood. This work started as an attempt to understand the strong downst…

Representation Learning Image Classification

The Representational Geometry of Number

2026-02-06 · Zhimin Hu, Lanhao Niu, Sashank Varma arxiv

A central question in cognitive science is whether conceptual representations converge onto a shared manifold to support generalization, or diverge into orthogonal subspaces to minimize task interference. While prior wor…

Transformed Subspace Clustering

2019-12-10 · Jyoti Maggu, Angshul Majumdar, Emilie Chouzenoux

Subspace clustering assumes that the data is sepa-rable into separate subspaces. Such a simple as-sumption, does not always hold. We assume that, even if the raw data is not separable into subspac-es, one can learn a rep…

Benchmarking Clustering Image Clustering