Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learning
arXiv:1808.02229
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.
arXiv commentSubmitted to IEEE Signal Processing Magazine
Cited by in corpus (9)
- Manifold learning-based polynomial chaos expansions for high-dimensional surrogate models
- Federated PCA on Grassmann Manifold for IoT Anomaly Detection
- Quantum Deep Hedging
- Leveraging tensor kernels to reduce objective function mismatch in deep clustering
- Unsupervised Domain Adaptation with Progressive Domain Augmentation
- Grassmann Iterative Linear Discriminant Analysis with Proxy Matrix Optimization
- Topological Electrostatics
- Manifold learning for coarse-graining atomistic simulations: Application to amorphous solids
- Manifold Optimization Assisted Gaussian Variational Approximation