Searcharxiv⌕ Search

arXiv subjects

Jiayao Zhang

Publications and source records attributed to Jiayao Zhang.

20 records · Page 2Linked to original sources

Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learning

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.

cs.LG↗

Automatic Recognition of Space-Time Constellations by Learning on the Grassmann Manifold (Extended Version)

Recent breakthroughs in machine learning especially artificial intelligence shift the paradigm of wireless communication towards intelligence radios. One of their core operations is automatic modulation recognition (AMR). Existing research focuses on coherent modulation schemes such as QAM, PSK and FSK. The AMR of (non-coherent) space-time modulation remains an uncharted area despite its wide deployment in modern multiple-input-multiple-output (MIMO) systems. The scheme using a so called Grassmann constellation enables rate-enhancement using multi-antennas and blind detection. In this work, we propose an AMR approach for Grassmann constellation based on data clustering, which differs from traditional AMR based on classification using a modulation database. The approach allows algorithms for clustering on the Grassmann manifold, such as Grassmann K-means and depth-first search, originally developed for computer vision to be applied to AMR. We further develop an analytical framework for studying and designing these algorithms in the context of AMR. First, the maximum-likelihood Grassmann constellation detection is proved to be equivalent to clustering on the Grassmannian. Thereby, a well-known machine-learning result that was originally established only for the Euclidean space is rediscovered for the Grassmannian. Next, despite a rich literature on algorithmic design, theoretical analysis of data clustering is largely overlooked due to the lack of tractable techniques. We tackle the challenge by introducing probabilistic metrics for measuring the inter-cluster separability and intra-cluster connectivity of received space-time symbols and deriving them using tools from differential geometry and Grassmannian packing. The results provide useful insights into the effects of various parameters ranging from the signal-to-noise ratio to constellation size, facilitating algorithmic design.

cs.IT↗