Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits

• URL: http://arxiv.org/abs/2604.14908v1
• Date: Thu, 16 Apr 2026 11:49:51 GMT
• Title: Multi-User mmWave Beam and Rate Adaptation via Combinatorial Satisficing Bandits
• Abstract summary: We study downlink beam and rate adaptation in a multi-user mmWave MISO system where multiple base stations (BSs) serve multiple single-antenna user equipments (UEs) with a unique beam per UE and discrete data transmission rates.<n>To encode service goals, we introduce a satisficing throughput threshold $_r$ and cast joint beam and rate adaptation as a semi-bandit over beam-rate bounds.<n>We show that SAT-CTS consistently reduces satising regret and maintains competitive standard regret, while achieving favorable average throughput and fairness across users.
• Score: 5.873949143662286
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study downlink beam and rate adaptation in a multi-user mmWave MISO system where multiple base stations (BSs), each using analog beamforming from finite codebooks, serve multiple single-antenna user equipments (UEs) with a unique beam per UE and discrete data transmission rates. BSs learn about transmission success based on ACK/NACK feedback. To encode service goals, we introduce a satisficing throughput threshold $τ_r$ and cast joint beam and rate adaptation as a combinatorial semi-bandit over beam-rate tuples. Within this framework, we propose SAT-CTS, a lightweight, threshold-aware policy that blends conservative confidence estimates with posterior sampling, steering learning toward meeting $τ_r$ rather than merely maximizing. Our main theoretical contribution provides the first finite-time regret bounds for combinatorial semi-bandits with satisficing objective: when $τ_r$ is realizable, we upper bound the cumulative satisficing regret to the target with a time-independent constant, and when $τ_r$ is non-realizable, we show that SAT-CTS incurs only a finite expected transient outside committed CTS rounds, after which its regret is governed by the sum of the regret contributions of restarted CTS rounds, yielding an $O((\log T)^2)$ standard regret bound. On the practical side, we evaluate the performance via cumulative satisficing regret to $τ_r$ alongside standard regret and fairness. Experiments with time-varying sparse multipath channels show that SAT-CTS consistently reduces satisficing regret and maintains competitive standard regret, while achieving favorable average throughput and fairness across users, indicating that feedback-efficient learning can equitably allocate beams and rates to meet QoS targets without channel state knowledge.

Related papers

• Worst-Case Regret Bounds for Combinatorial Thompson Sampling in Sleeping Semi-Bandits [6.725466985159166]
  We provide the first worst-case regret analysis of Thompson sampling (CTS) for semi-bandits with sleeping arms.<n>We propose CL-SG, a simple CTS-G variant that samples a single shared Gaussian seed each round to coordinate exploration across arms.<n>We show that CL-SG achieves an improved regret bound of $tildeO(sqrtmNT)$, together with a matching lower bound $(sqrtmNT)$.
  arXiv  Detail & Related papers  (2026-05-10T02:57:45Z)
• Multi-Objective Multi-Agent Bandits: From Learning Efficiency to Fairness Optimization [4.774863352469391]
  We study multi-objective multi-agent multi-armed bandits (MO-MA-MAB) under rewards, where agents observe heterogeneous reward vectors and communicate over time-varying graphs.<n>We formulate this emerging problem setting to address emphefficient learning, measured by Pareto regret, and incorporate emphfair learning as an additional goal, captured via social welfare.<n>To express the fairness constraint, we formulate a Nash Social Welfare objective over preference-scalarized rewards and propose textscSimulated NSW UCB Gossip, which integrates preference-based reward simulation, gossip
  arXiv  Detail & Related papers  (2026-05-07T19:06:34Z)
• MARBLE: Multi-Aspect Reward Balance for Diffusion RL [71.6241143519038]
  Reinforcement learning has become the dominant approach for aligning diffusion models with human preferences.<n>Existing practice deal with multiple rewards by training one specialist model per reward.<n>We propose MARBLE, a gradient-space optimization framework that maintains independent advantage estimators for each reward.
  arXiv  Detail & Related papers  (2026-05-07T16:20:42Z)
• RASP-Tuner: Retrieval-Augmented Soft Prompts for Context-Aware Black-Box Optimization in Non-Stationary Environments [0.0]
  We present online tuning as context-conditioned regret minimization.<n>RASP-Tuner instantiates a decomposition motivated by first principles.<n>On nine synthetic non-stationary benchmarks, RASP-Tuner improves or matches cumulative regret relative to our GP-UCB and CMA-ES implementations.
  arXiv  Detail & Related papers  (2026-04-20T09:52:36Z)
• Reinforcement Learning from Multi-Source Imperfect Preferences: Best-of-Both-Regimes Regret [71.69884486156359]
  We study episodic RL from emphmulti-source imperfect preferences through a cumulative imperfection budget.<n>We propose a unified algorithm with regret $tildeO(sqrtK/M+)$, which exhibits a best-of-both-regimes behavior.
  arXiv  Detail & Related papers  (2026-03-20T19:34:53Z)
• Time Is All It Takes: Spike-Retiming Attacks on Event-Driven Spiking Neural Networks [87.16809558673403]
  Spiking neural networks (SNNs) compute with discrete spikes and exploit temporal structure.<n>We study a timing-only adversary that retimes existing spikes while preserving spike counts and amplitudes in event-driven SNNs.
  arXiv  Detail & Related papers  (2026-02-03T09:06:53Z)
• ZIP-RC: Optimizing Test-Time Compute via Zero-Overhead Joint Reward-Cost Prediction [57.799425838564]
  We present ZIP-RC, an adaptive inference method that equips models with zero-overhead inference-time predictions of reward and cost.<n> ZIP-RC improves accuracy by up to 12% over majority voting at equal or lower average cost.
  arXiv  Detail & Related papers  (2025-12-01T09:44:31Z)
• Stochastic Approximation with Delayed Updates: Finite-Time Rates under Markovian Sampling [73.5602474095954]
  We study the non-asymptotic performance of approximation schemes with delayed updates under Markovian sampling. Our theoretical findings shed light on the finite-time effects of delays for a broad class of algorithms.
  arXiv  Detail & Related papers  (2024-02-19T03:08:02Z)
• Discounted Thompson Sampling for Non-Stationary Bandit Problems [13.656518163592349]
  Non-stationary multi-armed bandit (NS-MAB) problems have recently received significant attention. We propose Discounted Thompson Sampling (DS-TS) with Gaussian priors to address both non-stationary settings. Our algorithm passively adapts to changes by incorporating a discounted factor into Thompson Sampling.
  arXiv  Detail & Related papers  (2023-05-18T05:29:52Z)
• Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms [59.8188496313214]
  We study the semi-bandits (CMAB) and focus on reducing the dependency of the batch-size $K$ in the regret bound. First, for the setting of CMAB with probabilistically triggered arms (CMAB-T), we propose a BCUCB-T algorithm with variance-aware confidence intervals. Second, for the setting of non-triggering CMAB with independent arms, we propose a SESCB algorithm which leverages on the non-triggering version of the TPVM condition.
  arXiv  Detail & Related papers  (2022-08-31T13:09:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.