Metraipolis › archive › dc_40baead00b13
Scaling Bayesian Bandit Encoding with Shared Learning — arXiv:2609.06293
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.06293
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T15:01:49.167Z
- SHA-256 of the archived text
a17edbc3cfa98095f1ca538ad13aab617f8a50f52b0ed7aa0dfae9939d91741b- Stable URL of this page
https://metraipolis.com/documento/dc_40baead00b13
How to cite
Scaling Bayesian Bandit Encoding with Shared Learning — arXiv:2609.06293 — arXiv (en), https://arxiv.org/abs/2609.06293 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_40baead00b13 (Metraipolis archive dc_40baead00b13, sha256 a17edbc3cfa98095f1ca538ad13aab617f8a50f52b0ed7aa0dfae9939d91741b)
BibTeX
@misc{dc40baead00b13,
title = {Scaling Bayesian Bandit Encoding with Shared Learning — arXiv:2609.06293},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.06293},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_40baead00b13; sha256 a17edbc3cfa98095f1ca538ad13aab617f8a50f52b0ed7aa0dfae9939d91741b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06293. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A communication system must choose error protection and decoding effort as channel conditions change. A Bayesian bandit encoder (BBE) uses receiver feedback to learn which transmission configuration to select. We study a receiver that decodes by guessing error patterns, using Guessing Random Additive Noise Decoding (GRAND). We extend BBE's selection component to 1,008 code and decoder configurations by learning shared performance patterns offline and updating their weights online. Decoder noise models remain fixed. On a six-configuration training-selected shortlist, sharing reduces accumulated utility loss by 33.5% relative to independent learning. A fixed training-selected configuration matches the shared learner that searches the full catalog. After channel changes, the pruned shared learner first meets a near-optimal selection criterion in 88.5% of events by 2,000 packets, compared with 54.2% for pruned independent learning with the same discounting. The results support combining sharing and pruning for configuration selection, although packet losses remain high for the tested codes under severe noise. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.06293 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T14:48:50.700Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).