Online Optimization for Learning to Communicate over Time-Correlated Channels
Not on the map. Why?
Abstract (arXiv)
Machine learning techniques have garnered great interest in designing communication systems owing to their capacity in tackling with channel uncertainty. To provide theoretical guarantees for learning-based communication systems, some recent works analyze generalization bounds for devised methods based on the assumption of Independently and Identically Distributed (I.I.D.) channels, a condition rarely met in practical scenarios. In this paper, we drop the I.I.D. channel assumption and study an online optimization problem of learning to communicate over time-correlated channels. To address this issue, we further focus on two specific tasks: optimizing channel decoders for time-correlated fading channels and selecting optimal codebooks for time-correlated additive noise channels. For utilizing temporal dependence of considered channels to better learn communication systems, we develop two online optimization algorithms based on the optimistic online mirror descent framework. Furthermore, we provide theoretical guarantees for proposed algorithms via deriving sub-linear regret bound on the expected error probability of learned systems. Extensive simulation experiments have been conducted to validate that our presented approaches can leverage the channel correlation to achieve a lower average symbol error rate compared to baseline methods, consistent with our theoretical findings.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 61 references that are in the map. First posted on arXiv 1 Sep 2024.
Builds on
23 of 61 references.
References · 23
- 2019Introduction to Online Convex Optimizationcited by 793
- 2017An Introduction to Deep Learning for the Physical Layercited by 227
- 2018More Adaptive Algorithms for Adversarial Banditscited by 114
- 2018Deep Learning-Based Channel Estimationcited by 75
- 2017Deep Learning Methods for Improved Decoding of Linear Codescited by 66
- 2019Hyper-Graph-Network Decoders for Block Codescited by 42
- 2018A Very Brief Introduction to Machine Learning With Applications to Communication Systemscited by 35
- 2022Overview of Deep Learning-based CSI Feedback in Massive MIMO Systemscited by 35
- 2019Deep Learning for Physical-Layer 5G Wireless Techniques: Opportunities, Challenges and Solutionscited by 29
- 2019ViterbiNet: A Deep Learning Based Viterbi Algorithm for Symbol Detectioncited by 25
- 2023Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimizationcited by 22
- 2020Deep Learning for Wireless Communications: An Emerging Interdisciplinary Paradigmcited by 20
11 more
- 2017An Iterative BP-CNN Architecture for Channel Decodingcited by 18
- 2019Unsupervised Linear and Nonlinear Channel Equalization and Decoding using Variational Autoencoderscited by 11
- 2019Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decodingcited by 10
- 2024On the Necessity of Collaboration for Online Model Selection with Decentralized Datacited by 6
- 2019Deep Learning based Channel Estimation Algorithm over Time Selective Fading Channelscited by 5
- 2023Generalization Bounds for Neural Belief Propagation Decoderscited by 4
- 2022Fast Beam Alignment via Pure Exploration in Multi-armed Banditscited by 3
- 2016Asymptotically optimal pilot allocation over Markovian fading channelscited by 2
- 2022Fast Change Identification in Multi-Play Bandits and its Applications in Wireless Networkscited by 2
- 2023Information-Theoretic Generalization Analysis for Topology-aware Heterogeneous Federated Edge Learning over Noisy Channelscited by 2
- 2023Topology Learning for Heterogeneous Decentralized Federated Learning over Unreliable D2D Networkscited by 2
Built on by
Not cited yet.