paper-with-me

홈 › Papers

Context-Aware Hierarchical Online Learning for Performance Maximization in Mobile Crowdsourcing

2017-05-10 · Sabrina Klos, Cem Tekin, Mihaela van der Schaar, Anja Klein

In mobile crowdsourcing (MCS), mobile users accomplish outsourced human intelligence tasks. MCS requires an appropriate task assignment strategy, since different workers may have different performance in terms of acceptance rate and quality. Task assignment is challenging, since a worker's performance (i) may fluctuate, depending on both the worker's current personal context and the task context, (ii) is not known a priori, but has to be learned over time. Moreover, learning context-specific worker performance requires access to context information, which may not be available at a central entity due to communication overhead or privacy concerns. Additionally, evaluating worker performance might require costly quality assessments. In this paper, we propose a context-aware hierarchical online learning algorithm addressing the problem of performance maximization in MCS. In our algorithm, a local controller (LC) in the mobile device of a worker regularly observes the worker's context, her/his decisions to accept or decline tasks and the quality in completing tasks. Based on these observations, the LC regularly estimates the worker's context-specific performance. The mobile crowdsourcing platform (MCSP) then selects workers based on performance estimates received from the LCs. This hierarchical approach enables the LCs to learn context-specific worker performance and it enables the MCSP to select suitable workers. In addition, our algorithm preserves worker context locally, and it keeps the number of required quality assessments low. We prove that our algorithm converges to the optimal task assignment strategy. Moreover, the algorithm outperforms simpler task assignment strategies in experiments based on synthetic and real data.

📄 PDF Abstract BibTeX arXiv:1705.03822

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Real-time Topic-aware Influence Maximization Using Preprocessing

2014-03-01 · Wei Chen, Tian Lin, Cheng Yang

Influence maximization is the task of finding a set of seed nodes in a social network such that the influence spread of these seed nodes based on certain influence diffusion model is maximized. Topic-aware influence diff…

Context-Aware Online Client Selection for Hierarchical Federated Learning

2021-12-02 · Zhe Qu, Rui Duan, Lixing Chen, Jie Xu 외

Federated Learning (FL) has been considered as an appealing framework to tackle data privacy issues of mobile devices compared to conventional Machine Learning (ML). Using Edge Servers (ESs) as intermediaries to perform …

Federated Learning

Online Baum-Welch algorithm for Hierarchical Imitation Learning

2021-03-22 · Vittorio Giammarino, Ioannis Ch. Paschalidis

The options framework for hierarchical reinforcement learning has increased its popularity in recent years and has made improvements in tackling the scalability problem in reinforcement learning. Yet, most of these recen…

Hierarchical Reinforcement LearningImitation Learningreinforcement-learningReinforcement Learning+1

WAT: Online Video Understanding Needs Watching Before Thinking

2026-03-12 · Zifan Han, Hongbo Sun, Jinglin Xu, Canhui Tang 외 arxiv

Multimodal Large Language Models (MLLMs) have shown strong capabilities in image understanding, motivating recent efforts to extend them to video reasoning. However, existing Video LLMs struggle in online streaming scena…

Fitting Large Nonlinear Mixed Effects Models Using Variational Expectation Maximization

2026-04-28 · Mohamed Tarek, Pedro Afonso arxiv

Nonlinear Mixed Effects models (NLME) models are widely used in pharmacometrics and related fields to analyze hierarchical and longitudinal data. However, as the number of parameters and random effects increases, traditi…