Wireless Data Acquisition for Edge Learning: Importance-Aware Retransmission

By deploying machine learning algorithms at the network edge, edge learning recently emerges as a promising framework to support intelligent mobile services. It effectively leverages the rich data collected by abundant mobile devices, and exploits the proximate edge computing resource for low-latency execution. Edge learning crosses two disciplines, machine learning and wireless communication, and thereby gives rise to many new research issues. In this paper, we address a wireless data acquisition problem, which involves a retransmission decision in each communication round to optimize the data quality-vs-quantity tradeoff. A new retransmission protocol called importance-aware automatic-repeat-request (importance ARQ) is proposed. Unlike classic ARQ focusing merely on reliability, importance ARQ selectively retransmits a data sample based on its uncertainty that can be measured using the model under training. Underpinning the proposed protocol is an elegant communication-learning relation between two corresponding metrics, i.e., signal-to-noise ratio (SNR) and data uncertainty. This new relation facilitates the design of a simple threshold based policy for retransmission decisions. As demonstrated via experiments with real datasets, the proposed method avoids learning performance degradation caused by channel noise while achieving faster convergence than conventional SNR-based ARQ.

[1]  David D. Lewis,et al.  Heterogeneous Uncertainty Sampling for Supervised Learning , 1994, ICML.

[2]  Khaled Ben Letaief,et al.  ARQ with adaptive feedback for energy harvesting receivers , 2016, 2016 IEEE Wireless Communications and Networking Conference.

[3]  Mark Craven,et al.  Multiple-Instance Active Learning , 2007, NIPS.

[4]  Leonardo Badia,et al.  Markov analysis of selective repeat type II hybrid ARQ using block codes , 2008, IEEE Transactions on Communications.

[5]  Andrea J. Goldsmith,et al.  Energy-efficient joint estimation in sensor networks: analog vs. digital , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[6]  Thomas L. Marzetta,et al.  Fast transfer of channel state information in wireless systems , 2006, IEEE Transactions on Signal Processing.

[7]  Yoshua Bengio,et al.  Gradient-based learning applied to document recognition , 1998, Proc. IEEE.

[8]  Yu-Dong Yao,et al.  An effective go-back-N ARQ scheme for variable-error-rate channels , 1995, IEEE Trans. Commun..

[9]  Nello Cristianini,et al.  Large Margin DAGs for Multiclass Classification , 1999, NIPS.

[10]  Andrew McCallum,et al.  Toward Optimal Active Learning through Monte Carlo Estimation of Error Reduction , 2001, ICML 2001.

[11]  Nagarajan Natarajan,et al.  Learning with Noisy Labels , 2013, NIPS.

[12]  Yan Hui,et al.  Hybrid ARQ transmission and combining for MIMO systems , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[13]  E. J. Weldon An Improved Selective-Repeat ARQ Strategy , 1982, IEEE Trans. Commun..

[14]  Kin K. Leung,et al.  When Edge Meets Learning: Adaptive Control for Resource-Constrained Distributed Machine Learning , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[15]  John M. Cioffi,et al.  On the combining schemes for MIMO systems with hybrid ARQ , 2009, IEEE Transactions on Wireless Communications.

[16]  Kaibin Huang,et al.  Towards an Intelligent Edge: Wireless Communication Meets Machine Learning , 2018, ArXiv.

[17]  Michael L. Honig,et al.  Reliability-based incremental redundancy with convolutional codes , 2005, IEEE Transactions on Communications.

[18]  K. B. Letaief,et al.  A Survey on Mobile Edge Computing: The Communication Perspective , 2017, IEEE Communications Surveys & Tutorials.

[19]  Robert J. Piechocki,et al.  The Throughput Analysis of Different IR-HARQ Schemes Based on Fountain Codes , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[20]  Blaise Agüera y Arcas,et al.  Communication-Efficient Learning of Deep Networks from Decentralized Data , 2016, AISTATS.

[21]  David Cohn,et al.  Active Learning , 2010, Encyclopedia of Machine Learning.

[22]  M. Verleysen,et al.  Classification in the Presence of Label Noise: A Survey , 2014, IEEE Transactions on Neural Networks and Learning Systems.

[23]  Pietro Perona,et al.  Entropy-based active learning for object recognition , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[24]  Mark Craven,et al.  An Analysis of Active Learning Strategies for Sequence Labeling Tasks , 2008, EMNLP.

[25]  Dacheng Tao,et al.  Classification with Noisy Labels by Importance Reweighting , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Saleem A. Kassam,et al.  Hybrid ARQ with selective combining for fading channels , 1999, IEEE J. Sel. Areas Commun..

[27]  Marc Moeneclaey,et al.  Throughput Optimization for a Generalized Stop-and-Wait ARQ Scheme , 1986, IEEE Trans. Commun..

[28]  Xindong Wu,et al.  Majority Voting and Pairing with Multiple Noisy Labeling , 2019, IEEE Transactions on Knowledge and Data Engineering.