Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learning

Author name not available (Why is that?)

Publication date: 7 August 2018

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.

Has companion code repository: https://github.com/matthew-mcateer/Keras_pruning

This page was built for publication: Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6305128)