← Search

Navid Naderializadeh

10 accepted papers

2026

Decentralized Learning Strategies for Estimation Error Minimization with Graph Neural Networks

ICASSP 2026poster

We address real-time sampling and estimation of autoregressive Markovian sources in dynamic yet structurally similar multi-hop wireless networks. Each node caches samples from others and communicates over wireless collision channels, aiming to minimize time-average estimation error via decentralized…

Cited by 0SourcePDFScholar
2025

ESPFormer: Doubly-Stochastic Attention with Expected Sliced Transport Plans

ICML 2025poster

While self-attention has been instrumental in the success of Transformers, it can lead to over-concentration on a few tokens during training, resulting in suboptimal information flow. Enforcing doubly-stochastic constraints in attention matrices has been shown to improve structure and balance in att…

2025

State-Augmented Opportunistic Routing in Wireless Communication Systems with Graph Neural Networks

ICASSP 2025accepted

In this study, we address the challenge of packet based information routing in large-scale wireless communication networks. We approach this scenario by framing the problem as a statistical learning problem, where each node in the network relies only on the local data. Our exploration focuses on the…

Cited by 0SourceScholar
2024

State-Augmented Information Routing In Communication Systems With Graph Neural Networks

ICASSP 2024accepted

We consider the problem of routing network packets in a large-scale communication system where the nodes have access to only local information. We formulate this problem as a constrained learning problem, which can be solved using a distributed optimization algorithm. We approach this distributed op…

Cited by 0SourceScholar
2021

Pooling by Sliced-Wasserstein Embedding

NeurIPS 2021poster

Learning representations from sets has become increasingly important with many applications in point cloud processing, graph learning, image/video recognition, and object detection. We introduce a geometrically-interpretable and generic pooling mechanism for aggregating a set of features into a fixe…

2021

Wasserstein Embedding for Graph Learning

ICLR 2021poster

We present Wasserstein Embedding for Graph Learning (WEGL), a novel and fast framework for embedding entire graphs in a vector space, in which various machine learning models are applicable for graph-level prediction tasks. We leverage new insights on defining similarity between graphs as a function…

2019

Deep CNN for Wideband Mmwave Massive Mimo Channel Estimation Using Frequency Correlation

ICASSP 2019accepted

For millimeter wave (mmWave) systems with large-scale arrays, hybrid processing structure is usually used at both transmitters and receivers to reduce the complexity and cost, which poses a very challenging issue in channel estimation, especially at the low transmit signal-to-noise ratio regime. In…

Cited by 0SourceScholar