Efficient, Adaptive Near-Field Beam Training based on Linear Bandit
Abstract
This letter proposes a linear bandit-based beam training framework for near-field communication under multi-path channels. By leveraging Thompson Sampling (TS), the framework adaptively balances exploration and exploitation to maximize cumulative beamforming gain under limited pilot overhead. To ensure data-efficient learning, we incorporate a correlated Gaussian prior in the DFT domain, using a Gaussian kernel to capture spatial correlations and near-field energy leakage. We develop three TS strategies: codebook-constrained search for rapid convergence via structural regularization, continuous-space search to achieve near-optimal performance, and a two-stage hybrid refinement scheme that balances convergence speed and estimation accuracy. Simulation results show that the proposed framework reduces pilot overhead by up to 90\% while achieving more than a 2dB SNR gain over baselines in multipath environments. Furthermore, the continuous-space search is shown to be asymptotically optimal, approaching the full-CSI bound when the pilot overhead is unconstrained.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.