中文
相关论文

相关论文: Bandit-Based Task Assignment for Heterogeneous Cro…

200 篇论文

Crowdsourcing has been part of the IR toolbox as a cheap and fast mechanism to obtain labels for system development and evaluation. Successful deployment of crowdsourcing at scale involves adjusting many variables, a very important one…

人工智能 · 计算机科学 2016-05-20 Ittai Abraham , Omar Alonso , Vasilis Kandylas , Rajesh Patel , Steven Shelford , Aleksandrs Slivkins

We define and analyze a multi-agent multi-armed bandit problem in which decision-making agents can observe the choices and rewards of their neighbors. Neighbors are defined by a network graph with heterogeneous and stochastic…

最优化与控制 · 数学 2019-05-22 Udari Madhushani , Naomi Ehrich Leonard

Recently, there has been a burst in the number of research projects on human computation via crowdsourcing. Multiple choice (or labeling) questions could be referred to as a common type of problem which is solved by this approach. As an…

人工智能 · 计算机科学 2014-09-04 Jafar Muhammadi , Hamid Reza Rabiee , Abbas Hosseini

Crowdsourcing is an online outsourcing mode which can solve the current machine learning algorithm's urge need for massive labeled data. Requester posts tasks on crowdsourcing platforms, which employ online workers over the Internet to…

人机交互 · 计算机科学 2022-04-28 Guangyang Han , Sufang Li , Runmin Wang , Chunming Wu

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

Contextual Multi-Armed Bandits is a well-known and accepted online optimization algorithm, that is used in many Web experiences to tailor content or presentation to users' traffic. Much has been published on theoretical guarantees (e.g.…

信息检索 · 计算机科学 2019-07-12 David Abensur , Ivan Balashov , Shaked Bar , Ronny Lempel , Nurit Moscovici , Ilan Orlov , Danny Rosenstein , Ido Tamir

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

We consider a variant of the contextual bandit problem. In standard contextual bandits, when a user arrives we get the user's complete feature vector and then assign a treatment (arm) to that user. In a number of applications (like…

机器学习 · 计算机科学 2020-02-25 Sanath Kumar Krishnamurthy , Susan Athey

Multi-armed bandit problems are receiving a great deal of attention because they adequately formalize the exploration-exploitation trade-offs arising in several industrially relevant applications, such as online advertisement and, more…

机器学习 · 计算机科学 2013-11-05 Nicolò Cesa-Bianchi , Claudio Gentile , Giovanni Zappella

As the adoption of federated learning increases for learning from sensitive data local to user devices, it is natural to ask if the learning can be done using implicit signals generated as users interact with the applications of interest,…

机器学习 · 计算机科学 2023-03-21 Alekh Agarwal , H. Brendan McMahan , Zheng Xu

We propose an extensible deep learning method that uses reinforcement learning to train neural networks for offline ranking in information retrieval (IR). We call our method BanditRank as it treats ranking as a contextual bandit problem. In…

信息检索 · 计算机科学 2019-10-24 Phanideep Gampa , Sumio Fujita

With the prevalence of mobile devices and ubiquitous wireless networks, spatial crowdsourcing has attracted much attention from both academic and industry communities. On spatial crowdsourcing platforms, task requesters can publish spatial…

数据库 · 计算机科学 2023-03-09 Yunjun Zhou , Shuhan Wan , Detian Zhang , Shiting Wen

In multi-task learning, a learner is given a collection of prediction tasks and needs to solve all of them. In contrast to previous work, which required that annotated training data is available for all tasks, we consider a new setting, in…

机器学习 · 统计学 2017-06-09 Anastasia Pentina , Christoph H. Lampert

We study the problem of decentralized task offloading and load-balancing in a dense network with numerous devices and a set of edge servers. Solving this problem optimally is complicated due to the unknown network information and random…

分布式、并行与集群计算 · 计算机科学 2024-07-02 Mariam Yahya , Alexander Conzelmann , Setareh Maghsudi

One of the questions that arises when designing models that learn to solve multiple tasks simultaneously is how much of the available training budget should be devoted to each individual task. We refer to any formalized approach to…

机器学习 · 计算机科学 2019-07-16 John Glover , Chris Hokamp

Contextual multi-armed bandit (MAB) achieves cutting-edge performance on a variety of problems. When it comes to real-world scenarios such as recommendation system and online advertising, however, it is essential to consider the resource…

机器学习 · 计算机科学 2020-04-07 Mengyue Yang , Qingyang Li , Zhiwei Qin , Jieping Ye

Crowdsourcing has been widely used to efficiently obtain labeled datasets for supervised learning from large numbers of human resources at low cost. However, one of the technical challenges in obtaining high-quality results from…

人机交互 · 计算机科学 2023-02-28 Ryosuke Ueda , Koh Takeuchi , Hisashi Kashima

Crowdsourcing has become a popular method for collecting labeled training data. However, in many practical scenarios traditional labeling can be difficult for crowdworkers (for example, if the data is high-dimensional or unintuitive, or the…

机器学习 · 统计学 2017-12-14 Tom Hope , Dafna Shahaf

With the rapid advancement of mobile networks and the widespread use of mobile devices, spatial crowdsourcing, which involves assigning location-based tasks to mobile workers, has gained significant attention. However, most existing…

机器学习 · 计算机科学 2025-03-28 Jinwen Chen , Jiannan Guo , Dazhuo Qiu , Yawen Li , Guanhua Ye , Yan Zhao , Kai Zheng

The multi-armed bandit(MAB) is a classical sequential decision problem. Most work requires assumptions about the reward distribution (e.g., bounded), while practitioners may have difficulty obtaining information about these distributions to…

机器学习 · 计算机科学 2023-12-14 Han Qi , Fei Guo , Li Zhu