AI & ML
Can Bandits Learn to Share a Channel? Distributed Multi-Armed Bandits for Slotted ALOHA
arXiv cs.NI0 views
arXiv:2611.24676v1 Announce Type: new Abstract: Slotted ALOHA networks constitute a playground for research on machine learning (ML)-based channel access schemes. We consider ML agents deployed in such networks and operating under severe constraints: fully distributed (independent operation), fully online (no pre-training), aperiodic (no fixed schedule), and with no explicit coordination (no signaling). We ask whether a multi-armed bandit (MAB), a minimal reinforcement learning agent, can learn the optimal policy for a capture-free slotted ALOHA system. We evaluate several MAB algorithms on aggregate network throughput and per-node fairness. Our best-performing agent is based on a Softmax bandit, which we call SALSA (Softmax ALOHA Learning for Shared Access). SALSA learns a per-node transmission policy close to optimal, with throughput near the theoretical maximum for fair random access. We achieve performance comparable to a competing state-of-the-art solution, but without requiring a priori knowledge of the network size.
Source:https://arxiv.org/abs/2611.24676PreviousCooperative UAV and Ground Station for Robust MEC of Dynamic Aquatic IoT: A Generative AI-Enhanced ApproachNextImproving Outdoor Multi-cell Fingerprinting-based Positioning via Mobile Data Augmentation
Related posts
Prompt, Workflow, Agent or Agentic System: Which One Does Your Process Need?
0dev.to
Running Claude Code and Codex from your phone: the official options, and the self-hosted app I built
0dev.to
Unlocking Enhanced Visuals: Dlss5 Without Extra Load --An unofficial side-story version
0dev.to
Fiona the Hippo Died After Eating a Hat. But How Does a Hat Kill a Hippo?
0Wired

Why ChatGPT Cites Review Sites Instead of Your Company Website
0dev.to
Basalt walkthrough is up: why 776 tok/s needs the whole card to itself
0dev.to