Variable-Length Feedback Coding With Universal Decoding and Bandit Channel Selection

@misc{yavas2026variablelength,
  title = {{Variable-Length Feedback Coding With Universal Decoding and Bandit Channel Selection}},
  author = {Recep Can Yavas},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.36818},
  eprint = {2610.36818},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.36818},
}

TY  - UNPB
TI  - Variable-Length Feedback Coding With Universal Decoding and Bandit Channel Selection
AU  - Recep Can Yavas
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.36818
UR  - https://arxiv.org/abs/2610.36818
AB  - We study variable-length feedback (VLF) coding over K additive white Gaussian noise (AWGN) channels whose noise variances are unknown to both terminals but lie in a known interval. The receiver selects one channel at each time, conveys the selection over noiseless feedback, and must learn the channel qualities while decoding, to avoid overusing suboptimal channels. This setting, which we call the VLF-Bandit problem, combines VLF coding, universal decoding, and bandit channel selection. We develop two joint coding and channel-selection schemes. The VLSF-Bandit scheme is a single-phase variable-length stop-feedback (VLSF) scheme based on a Gaussian random codebook, a score formed from a ratio of likelihood mixtures, and the asymptotically optimal kl−UCB^++ bandit algorithm applied to the received power. The VLF-Bandit scheme sends the message in packets by Schalkwijk--Kailath transmission, uses its normalized outputs as noise samples to learn the variances, and lets its exploration packets carry message bits. We prove second-order achievability bounds for both schemes, which are first-order optimal. In the logarithm of the achievable codebook size, the magnitude of the log N coefficient, with N the average decoding time, is a baseline of one plus a channel-exploration term for VLSF-Bandit. For VLF-Bandit, this magnitude is smaller, with a universal-decoding term replacing the baseline and a smaller channel-exploration term. The VLF-Bandit bound improves on the universal VLF bound of Yavas and Tan (2025) for K=1 and on the bound of an explore-then-commit strategy whenever K≥2.
ER  -