mlsanityData to 14 Oct 2026

Grassmann Iterative Linear Discriminant Analysis with Proxy Matrix Optimization

arXiv 2104.08112 ↗First posted 16 Apr 2021cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Linear Discriminant Analysis (LDA) is commonly used for dimensionality reduction in pattern recognition and statistics. It is a supervised method that aims to find the most discriminant space of reduced dimension that can be further used for classification. In this work, we present a Grassmann Iterative LDA method (GILDA) that is based on Proxy Matrix Optimization (PMO). PMO makes use of automatic differentiation and stochastic gradient descent (SGD) on the Grassmann manifold to arrive at the optimal projection matrix. Our results show that GILDAoutperforms the prevailing manifold optimization method.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 15 references that are in the map. First posted on arXiv 16 Apr 2021.

Builds on

3 of 15 references.

References · 3

  1. 2015Training Deep Networks with Structured Layers by Matrix Backpropagationcited by 30
  2. 2018Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learningcited by 19
  3. 2019Cascaded Projection: End-to-End Network Compression and Accelerationcited by 5

Built on by

Not cited yet.