中文
相关论文

相关论文: Efficient Online Learning for Cognitive Radar-Cell…

200 篇论文

In linear contextual bandits, the objective is to select actions that maximize cumulative rewards, modeled as a linear function with unknown parameters. Although Thompson Sampling performs well empirically, it does not achieve optimal…

机器学习 · 统计学 2025-06-18 Wonyoung Kim

Meta-learning is characterized by its ability to learn how to learn, enabling the adaptation of learning strategies across different tasks. Recent research introduced the Meta-Thompson Sampling (Meta-TS), which meta-learns an unknown prior…

机器学习 · 统计学 2024-09-12 Hao Li , Dong Liang , Zheng Xie

Thompson sampling has proven effective across a wide range of stationary bandit environments. However, as we demonstrate in this paper, it can perform poorly when applied to non-stationary environments. We attribute such failures to the…

机器学习 · 计算机科学 2025-05-06 Yueyang Liu , Xu Kuang , Benjamin Van Roy

In this paper, we investigate the performance of Thompson Sampling (TS) for online learning with censored feedback, focusing primarily on the classic repeated newsvendor model--a foundational framework in inventory management--and…

机器学习 · 计算机科学 2026-01-19 Li Chen , Hanzhang Qin , Yunbei Xu , Ruihao Zhu , Weizhou Zhang

We introduce a framework for Thompson sampling (TS) contextual bandit algorithms, in which the algorithm's ability to quantify uncertainty and make decisions depends on the quality of a generative model that is learned offline. Instead of…

机器学习 · 计算机科学 2025-11-13 Kelly W. Zhang , Tiffany Tianhui Cai , Hongseok Namkoong , Daniel Russo

This paper describes important considerations and challenges associated with online reinforcement-learning based waveform selection for target identification in frequency modulated continuous wave (FMCW) automotive radar systems. We present…

信号处理 · 电气工程与系统科学 2022-12-02 Charles E. Thornton , William W. Howard , R. Michael Buehrer

Contextual bandits are a core technology for personalized mobile health interventions, where decision-making requires adapting to complex, non-linear user behaviors. While Thompson Sampling (TS) is a preferred strategy for these problems,…

机器学习 · 统计学 2026-02-10 Ruizhe Deng , Bibhas Chakraborty , Ran Chen , Yan Shuo Tan

Real-world applications of contextual bandits often exhibit non-stationarity due to seasonality, serendipity, and evolving social trends. While a number of non-stationary contextual bandit learning algorithms have been proposed in the…

机器学习 · 计算机科学 2023-10-17 Zheqing Zhu , Yueyang Liu , Xu Kuang , Benjamin Van Roy

Much of the recent literature on bandit learning focuses on algorithms that aim to converge on an optimal action. One shortcoming is that this orientation does not account for time sensitivity, which can play a crucial role when learning an…

机器学习 · 计算机科学 2020-01-09 Daniel Russo , Benjamin Van Roy

Contextual bandits are widely used in industrial personalization systems. These online learning frameworks learn a treatment assignment policy in the presence of treatment effects that vary with the observed contextual features of the…

机器学习 · 计算机科学 2022-05-11 Claudia Roberts , Maria Dimakopoulou , Qifeng Qiao , Ashok Chandrashekhar , Tony Jebara

A contextual bandit is a popular framework for online learning to act under uncertainty. In practice, the number of actions is huge and their expected rewards are correlated. In this work, we introduce a general framework for capturing such…

机器学习 · 计算机科学 2023-03-07 Imad Aouali , Branislav Kveton , Sumeet Katariya

In this paper, a novel approach based on the concept of opportunistic spatial orthogonalization (OSO) is proposed for interference management between machine type communications (MTC) and conventional cellular communications. In particular,…

信息论 · 计算机科学 2019-05-27 Samad Ali , Hossein Asgharimoghaddam , Nandana Rajatheva , Walid Saad , Jussi Haapola

Thompson sampling (TS) is a Bayesian randomized exploration strategy that samples options (e.g., system parameters or control laws) from the current posterior and then applies the selected option that is optimal for a task, thereby…

机器学习 · 计算机科学 2026-02-06 Kaikai Zheng , Dawei Shi , Yang Shi , Long Wang

Thompson Sampling has recently been shown to be optimal in the Bernoulli Multi-Armed Bandit setting[Kaufmann et al., 2012]. This bandit problem assumes stationary distributions for the rewards. It is often unrealistic to model the real…

机器学习 · 计算机科学 2013-02-18 Joseph Mellor , Jonathan Shapiro

We address the problem of online sequential decision making, i.e., balancing the trade-off between exploiting the current knowledge to maximize immediate performance and exploring the new information to gain long-term benefits using the…

机器学习 · 计算机科学 2022-09-20 Kartik Anand Pant , Amod Hegde , K. V. Srinivas

The design and performance analysis of bandit algorithms in the presence of stage-wise safety or reliability constraints has recently garnered significant interest. In this work, we consider the linear stochastic bandit problem under…

机器学习 · 计算机科学 2020-03-03 Ahmadreza Moradipari , Sanae Amani , Mahnoosh Alizadeh , Christos Thrampoulidis

How can we make use of information parallelism in online decision making problems while efficiently balancing the exploration-exploitation trade-off? In this paper, we introduce a batch Thompson Sampling framework for two canonical online…

机器学习 · 计算机科学 2021-06-04 Amin Karbasi , Vahab Mirrokni , Mohammad Shadravan

Cellular network configuration plays a critical role in network performance. In current practice, network configuration depends heavily on field experience of engineers and often remains static for a long period of time. This practice is…

机器学习 · 计算机科学 2019-05-29 Xiaoxiao Wang , Xueying Guo , Jie Chuai , Zhitang Chen , Xin Liu

It has been shown (Amuru et al. 2015) that online learning algorithms can be effectively used to select optimal physical layer parameters for jamming against digital modulation schemes without a priori knowledge of the victim's transmission…

机器学习 · 计算机科学 2022-07-07 Charles E. Thornton , R. Michael Buehrer

In many biomedical, science, and engineering problems, one must sequentially decide which action to take next so as to maximize rewards. One general class of algorithms for optimizing interactions with the world, while simultaneously…

机器学习 · 统计学 2021-05-05 Iñigo Urteaga , Chris H. Wiggins