Machine Learning

Accurate channel estimation is a major challenge in the next generation of wireless communication networks. To fully exploit setups with many antennas, estimation errors must be kept small. This can be achieved by exploiting the structure inherent in the channel vectors. For example, line-of-sight paths result in highly correlated channel coefficients.

Filtering is the fundamental operation upon which the field of signal processing is built. Loosely speaking, filtering is a mapping between signals, typically used to extract useful information (output signal) from data (input signal). Arguably, the most popular type of filter is the linear and shift-invariant (i.e. independent of the starting point of the signal) filter, which can be computed efficiently by leveraging the convolution operation. 

Deep learning on graphs, also known as Geometric deep learning (GDL) [1], Graph representation learning (GRL), or relational inductive biases, has recently become one of the hottest topics in machine learning. While early works on graph learning go back at least a decade [2], if not two [3], it is undoubtedly the past few years’ progress that has taken these methods from a niche into the spotlight of the Machine Learning (ML) community.