LNUCB-TA用时空注意力机制提升多臂老虎机的长期趋势与局部模式捕捉能力。
LNUCB-TA: Linear-nonlinear Hybrid Bandit Learning with Temporal Attention
- 融合线性与非线性估计,动态调整kNN参数以识别时空模式。
- 在多个数据集上累计奖励提升超15%,收敛更快且对探索率不敏感。
- 适合高动态环境下的在线决策,如推荐系统与资源调度。
现有上下文多臂老虎机算法难以有效捕捉所有臂的长期趋势与局部模式,导致在快速变化的奖励结构中表现不佳;同时依赖静态探索率,无法自适应调整。为此,我们提出LNUCB-TA,一种结合新型非线性模块(自适应k-近邻)与全局-局部注意力探索机制的混合模型。该方法通过动态调整k值以适应奖励方差,增强时空模式识别能力,降低选择次优臂的概率,同时提升奖励估计精度与计算效率。注意力机制基于历史表现与选择频率实时调整探索与利用,无需人工设定探索率。结合全局注意力(整体评估各臂)与局部注意力(聚焦单臂),有效应对时空复杂性。实验表明,LNUCB-TA在累积奖励、平均奖励、收敛速度和鲁棒性方面均显著优于当前先进线性、非线性和混合带状算法。理论分析进一步证明其具有次线性遗憾界,可靠性得到保障。
原文摘要 · Abstract (English)
Existing contextual multi-armed bandit (MAB) algorithms fail to effectively capture both long-term trends and local patterns across all arms, leading to suboptimal performance in environments with rapidly changing reward structures. They also rely on static exploration rates, which do not dynamically adjust to changing conditions. To overcome these limitations, we propose LNUCB-TA, a hybrid bandit model integrating a novel nonlinear component (adaptive k-Nearest Neighbors (k-NN)) for reducing time complexity, alongside a global-and-local attention-based exploration mechanism. Our approach uniquely combines linear and nonlinear estimation techniques, with the nonlinear module dynamically adjusting k based on reward variance to enhance spatiotemporal pattern recognition. This reduces the likelihood of selecting suboptimal arms while improving reward estimation accuracy and computational efficiency. The attention-based mechanism ranks arms by past performance and selection frequency, dynamically adjusting exploration and exploitation in real time without requiring manual tuning of exploration rates. By integrating global attention (assessing all arms collectively) and local attention (focusing on individual arms), LNUCB-TA efficiently adapts to temporal and spatial complexities. Empirical results show LNUCB-TA significantly outperforms state-of-the-art linear, nonlinear, and hybrid bandits in cumulative and mean reward, convergence, and robustness across different exploration rates. Theoretical analysis further confirms its reliability with a sub-linear regret bound.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。