Taming the Uncertainty: Budget Limited Robust Crowdsensing Through Online Learning

被引:58
作者
Han, Kai [1 ]
Zhang, Chi [2 ]
Luo, Jun [2 ]
机构
[1] Univ Sci & Technol China, Suzhou Inst Adv Study, Sch Comp Sci & Technol, Suzhou, Peoples R China
[2] Nanyang Technol Univ, Sch Comp Engn, Singapore, Singapore
基金
中国国家自然科学基金;
关键词
Crowdsourcing; machine learning algorithms; RANDOM-VARIABLES; MIXING PROCESSES; INEQUALITIES; BANDITS; ALLOCATION;
D O I
10.1109/TNET.2015.2418191
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile crowdsensing has been intensively explored recently due to its flexible and pervasive sensing ability. Although many crowdsensing platforms have been built for various applications, the general issue of how to manage such systems intelligently remains largely open. While recent investigations mostly focus on incentivizing crowdsensing, the robustness of crowdsensing toward uncontrollable sensing quality, another important issue, has been widely neglected. Due to the non-professional personnel and devices, the quality of crowdsensing data cannot be fully guaranteed, hence the revenue gained from mobile crowdsensing is generally uncertain. Moreover, the need for compensating the sensing costs under a limited budget has exacerbated the situation: one does not enjoy an infinite horizon to learn the sensing ability of the crowd and hence to make decisions based on sufficient statistics. In this paper, we present a novel framework, Budget LImited robuSt crowdSensing (BLISS), to handle this problem through an online learning approach. Our approach aims to minimize the difference on average sense (a.k.a. regret) between the achieved total sensing revenue and the (unknown) optimal one, and we show that our BLISS sensing policies achieve logarithmic regret bounds and Hannan-consistency. Finally, we use extensive simulations to demonstrate the effectiveness of BLISS.
引用
收藏
页码:1462 / 1475
页数:14
相关论文
共 35 条
[1]  
[Anonymous], 2010, P 8 INT C MOBILE SYS, DOI [DOI 10.1145/1814433.1814448, 10.1145/1814433.1814448]
[2]  
[Anonymous], 2010, Handbook of Mathematical Functions
[3]  
[Anonymous], 1990, COMPUT INTRACTABILIT
[4]  
[Anonymous], 2010, P 8 INT C MOB SYST A
[5]  
[Anonymous], 2009, Encyclopedia of Optimization
[6]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[7]   Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems [J].
Bubeck, Sebastien ;
Cesa-Bianchi, Nicolo .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 5 (01) :1-122
[8]  
Cesa-Bianchi N., 2006, PREDICTION LEARNING
[9]  
Chon Y, 2012, UBICOMP'12: PROCEEDINGS OF THE 2012 ACM INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING, P481
[10]  
Doukhan Paul, 2012, MIXING PROPERTIES EX, V85