mlsanityData to 14 Oct 2026

Learning-Based User Association for MmWave Vehicular Networks With Kernelized Contextual Bandits

arXiv 2504.10959 ↗First posted 15 Apr 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Vehicles require timely channel conditions to determine the base station (BS) to communicate with, but it is costly to estimate the fast-fading mmWave channels frequently. Without additional channel estimations, the proposed Distributed Kernelized Upper Confidence Bound (DK-UCB) algorithm estimates the current instantaneous transmission rates utilizing past contexts, such as the vehicle's location and velocity, along with past instantaneous transmission rates. To capture the nonlinear mapping from a context to the instantaneous transmission rate, DK-UCB maps a context into the reproducing kernel Hilbert space (RKHS) where a linear mapping becomes observable. To improve estimation accuracy, we propose a novel kernel function in RKHS which incorporates the propagation characteristics of the mmWave signals. Moreover, DK-UCB encourages a vehicle to share necessary information when it has conducted significant explorations, which speeds up the learning process while maintaining affordable communication costs.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 21 references that are in the map. First posted on arXiv 15 Apr 2025.

Builds on

3 of 21 references.

References · 3

  1. 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
  2. 2022Communication Efficient Distributed Learning for Kernelized Contextual Banditscited by 15
  3. 2024Contextual Bandits with Non-Stationary Correlated Rewards for User Association in MmWave Vehicular Networkscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.