Data-Importance Aware User Scheduling for Communication-Efficient Edge Machine Learning

被引:46
作者
Liu, Dongzhu [1 ,2 ]
Zhu, Guangxu [3 ]
Zhang, Jun [4 ]
Huang, Kaibin [1 ]
机构
[1] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Peoples R China
[2] Kings Coll London, Dept Engn, London WC2R 2LS, England
[3] Shenzhen Res Inst Big Data, Dept Data Driven Intelligent Informat Syst, Shenzhen 518000, Peoples R China
[4] Hong Kong Polytech Univ, Dept Elect & Informat Engn, Hong Kong, Peoples R China
基金
国家重点研发计划;
关键词
Data models; Scheduling; Computational modeling; Wireless communication; Training; Uncertainty; Servers; resource management; image classification; multiuser channels; data acquisition; WIRELESS; TRANSMISSION; INTELLIGENCE;
D O I
10.1109/TCCN.2020.2999606
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
With the prevalence of intelligent mobile applications, edge learning is emerging as a promising technology for powering fast intelligence acquisition for edge devices from distributed data generated at the network edge. One critical task of edge learning is to efficiently utilize the limited radio resource to acquire data samples for model training at an edge server. In this paper, we develop a novel user scheduling algorithm for data acquisition in edge learning, called (data) importance-aware scheduling. A key feature of this scheduling algorithm is that it takes into account the informativeness of data samples, besides communication reliability. Specifically, the scheduling decision is based on a data importance indicator (DII), elegantly incorporating two "important" metrics from communication and learning perspectives, i.e., the signal-to-noise ratio (SNR) and data uncertainty. We first derive an explicit expression for this indicator targeting the classic classifier of support vector machine (SVM), where the uncertainty of a data sample is measured by its distance to the decision boundary. Then, the result is extended to convolutional neural networks (CNN) by replacing the distance based uncertainty measure with the entropy. As demonstrated via experiments using real datasets, the proposed importance-aware scheduling can exploit the two-fold multi-user diversity, namely the diversity in both the multiuser channels and the distributed data samples. This leads to faster model convergence than the conventional scheduling schemes that exploit only a single type of diversity.
引用
收藏
页码:265 / 278
页数:14
相关论文
共 46 条
[1]  
Alistarh D, 2017, ADV NEUR IN, V30
[2]  
Amiri MM, 2019, IEEE INT SYMP INFO, P1432, DOI [10.1109/tsp.2020.2981904, 10.1109/ISIT.2019.8849334]
[3]  
[Anonymous], 1994, A Comprehensive Foundation: Neural Networks, DOI 10.1142/S0129065794000372
[4]   Channel predictive proportional fair scheduling [J].
Bang, Hans Jorgen ;
Ekman, Torbjoern ;
Gesbert, David .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (02) :482-487
[5]  
Bishop C. M., 2006, Pattern recognition and machine learning
[6]  
Bonawitz Keith, 2019, P MACHINE LEARNING S, P374, DOI 10.48550/arXiv.1902.01046
[7]   Deep Joint Source-Channel Coding for Wireless Image Transmission [J].
Bourtsoulatze, Eirina ;
Kurka, David Burth ;
Gunduz, Deniz .
IEEE TRANSACTIONS ON COGNITIVE COMMUNICATIONS AND NETWORKING, 2019, 5 (03) :567-579
[8]  
Cauwenberghs G, 2001, ADV NEUR IN, V13, P409
[9]   Label-less Learning for Traffic Control in an Edge Network [J].
Chen, Min ;
Hao, Yixue ;
Lin, Kai ;
Yuan, Zhiyong ;
Hu, Long .
IEEE NETWORK, 2018, 32 (06) :8-14
[10]   Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming [J].
Chen, Tzu-Li ;
Cheng, Chen-Yang ;
Chou, Yi-Han .
ANNALS OF OPERATIONS RESEARCH, 2020, 290 (1-2) :813-836