Pith. sign in

REVIEW 1 cited by

Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1808.02229 v2 pith:4UZU4OUC submitted 2018-08-07 cs.LG cs.CVcs.ITeess.SPmath.ITstat.ML

classification cs.LGcs.CVcs.ITeess.SPmath.ITstat.ML
keywords learninggrassmannianbeendeepproblemsalgorithmsapplicationsconstrained
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Modern machine learning algorithms have been adopted in a range of signal-processing applications spanning computer vision, natural language processing, and artificial intelligence. Many relevant problems involve subspace-structured features, orthogonality constrained or low-rank constrained objective functions, or subspace distances. These mathematical characteristics are expressed naturally using the Grassmann manifold. Unfortunately, this fact is not yet explored in many traditional learning algorithms. In the last few years, there have been growing interests in studying Grassmann manifold to tackle new learning problems. Such attempts have been reassured by substantial performance improvements in both classic learning and learning using deep neural networks. We term the former as shallow and the latter deep Grassmannian learning. The aim of this paper is to introduce the emerging area of Grassmannian learning by surveying common mathematical problems and primary solution approaches, and overviewing various applications. We hope to inspire practitioners in different fields to adopt the powerful tool of Grassmannian learning in their research.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Improving Fine-Tuning with Latent Cluster Correction

    cs.LG 2025-01 conditional novelty 5.0 of 10

    Latent cluster correction, a Louvain-based clustering loss, improves CIFAR-100 fine-tuning accuracy by up to 1 point on ResNet-18, but not on AlexNet.

Pith tools