中文
相关论文

相关论文: Bandit Models of Human Behavior: Reward Processing…

200 篇论文

Thompson Sampling has been widely used for contextual bandit problems due to the flexibility of its modeling power. However, a general theory for this class of methods in the frequentist setting is still lacking. In this paper, we present a…

机器学习 · 计算机科学 2021-10-05 Tong Zhang

Assistive multi-armed bandit problems can be used to model team situations between a human and an autonomous system like a domestic service robot. To account for human biases such as the risk-aversion described in the Cumulative Prospect…

机器人学 · 计算机科学 2021-04-13 Michael Koller , Timothy Patten , Markus Vincze

We consider a Bayesian budgeted multi-armed bandit problem, in which each arm consumes a different amount of resources when selected and there is a budget constraint on the total amount of resources that can be used. Budgeted Thompson…

机器学习 · 计算机科学 2024-08-29 Woojin Jeong , Seungki Min

The staggering feats of AI systems have brought to attention the topic of AI Alignment: aligning a "superintelligent" AI agent's actions with humanity's interests. Many existing frameworks/algorithms in alignment study the problem on a…

机器学习 · 计算机科学 2024-10-22 Hong Jun Jeon , Benjamin Van Roy

The multi-armed bandit (MAB) problem is a classical learning task that exemplifies the exploration-exploitation tradeoff. However, standard formulations do not take into account {\em risk}. In online decision making systems, risk is a…

机器学习 · 计算机科学 2020-08-04 Qiuyu Zhu , Vincent Y. F. Tan

How to explore efficiently is a central problem in multi-armed bandits. In this paper, we introduce the metadata-based multi-task bandit problem, where the agent needs to solve a large number of related multi-armed bandit tasks and can…

机器学习 · 计算机科学 2021-08-17 Runzhe Wan , Lin Ge , Rui Song

In this paper we consider the contextual multi-armed bandit problem for linear payoffs under a risk-averse criterion. At each round, contexts are revealed for each arm, and the decision maker chooses one arm to pull and receives the…

机器学习 · 计算机科学 2022-06-28 Yifan Lin , Yuhao Wang , Enlu Zhou

Contextual bandits constitute a classical framework for decision-making under uncertainty. In this setting, the goal is to learn the arms of highest reward subject to contextual information, while the unknown reward parameters of each arm…

机器学习 · 统计学 2024-02-19 Hongju Park , Mohamad Kazem Shirani Faradonbeh

We propose new parametric frameworks of regression analysis with the conditional mode of a bounded response as the focal point of interest. Covariate effects estimation and prediction based on the maximum likelihood method under two new…

统计方法学 · 统计学 2020-06-22 Haiming Zhou , Xianzheng Huang

The multi-armed bandit (MAB) model is one of the most classical models to study decision-making in an uncertain environment. In this model, a player chooses one of $K$ possible arms of a bandit machine to play at each time step, where the…

机器学习 · 计算机科学 2023-06-13 Bo Li , Chi Ho Yeung

Non-stationarity is ubiquitous in human behavior and addressing it in the contextual bandits is challenging. Several works have addressed the problem by investigating semi-parametric contextual bandits and warned that ignoring…

机器学习 · 统计学 2022-05-18 Young-Geun Choi , Gi-Soo Kim , Seunghoon Paik , Myunghee Cho Paik

We study the benefits of sparsity in nonparametric contextual bandit problems, in which the set of candidate features is countably or uncountably infinite. Our contribution is two-fold. First, using a novel reduction to sequences of…

机器学习 · 统计学 2026-01-16 Hamish Flynn , Julia Olkhovskaya , Paul Rognon-Vael

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 study a generalization of the multi-armed bandit problem with multiple plays where there is a cost associated with pulling each arm and the agent has a budget at each time that dictates how much she can expect to spend. We derive an…

机器学习 · 统计学 2019-09-13 Alexander Luedtke , Emilie Kaufmann , Antoine Chambaz

In recent years, instructional practices in Operations Research (OR), Management Science (MS), and Analytics have increasingly shifted toward digital environments, where large and diverse groups of learners make it difficult to provide…

机器学习 · 统计学 2026-03-12 Lukas De Kerpel , Arthur Thuy , Dries F. Benoit

In this paper, we consider a new Multi-Armed Bandit (MAB) problem where arms are nodes in an unknown and possibly changing graph, and the agent (i) initiates random walks over the graph by pulling arms, (ii) observes the random walk…

机器学习 · 计算机科学 2022-06-28 Tianyu Wang , Lin F. Yang , Zizhuo Wang

A key feature of sequential decision making under uncertainty is a need to balance between exploiting--choosing the best action according to the current knowledge, and exploring--obtaining information about values of other actions. The…

机器学习 · 计算机科学 2021-08-27 Dimitrije Markovic , Hrvoje Stojic , Sarah Schwoebel , Stefan J. Kiebel

Recent advances in generative artificial intelligence (GenAI) models have enabled the generation of personalized content that adapts to up-to-date user context. While personalized decision systems are often modeled using bandit…

机器学习 · 统计学 2025-05-23 Marc Brooks , Gabriel Durham , Kihyuk Hong , Ambuj Tewari

We consider the multiarm bandit problems in the timevarying dynamic system for rich structural features. For the nonlinear dynamic model, we propose the approximate inference for the posterior distributions based on Laplace Approximation.…

机器学习 · 计算机科学 2013-10-21 Tianbing Xu , Yaming Yu , John Turner , Amelia Regan

Restless bandit problems are instances of non-stationary multi-armed bandits. These problems have been studied well from the optimization perspective, where the goal is to efficiently find a near-optimal policy when system parameters are…

机器学习 · 计算机科学 2019-10-29 Young Hun Jung , Ambuj Tewari