Energy-Efficient Processing and Robust Wireless Cooperative Transmission for Edge Inference

被引:36
作者
Yang, Kai [1 ,2 ,3 ]
Shi, Yuanming [1 ]
Yu, Wei [4 ]
Ding, Zhi [5 ]
机构
[1] ShanghaiTech Univ, Sch Informat Sci & Technol, Shanghai 201210, Peoples R China
[2] Chinese Acad Sci, Shanghai Inst Microsyst & Informat Technol, Shanghai 200050, Peoples R China
[3] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[4] Univ Toronto, Elect & Comp Engn Dept, Toronto, ON M5S 3G4, Canada
[5] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA
基金
美国国家科学基金会; 加拿大自然科学与工程研究理事会;
关键词
Difference-of-convex-functions (DC); edge intelligence; energy efficiency; group sparse beamforming; robust communication; robust optimization; DEEP NEURAL-NETWORKS; OPTIMIZATION; COMPRESSION; SYSTEMS;
D O I
10.1109/JIOT.2020.2979523
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Edge machine learning can deliver low-latency and private artificial intelligent (AI) services for mobile devices by leveraging computation and storage resources at the network edge. This article presents an energy-efficient edge processing framework to execute deep learning inference tasks at the edge computing nodes whose wireless connections to mobile devices are prone to channel uncertainties. Aimed at minimizing the sum of computation and transmission power consumption with probabilistic Quality-of-Service (QoS) constraints, we formulate the joint inference tasking and the downlink beamforming problem that is characterized by a group sparse objective function. We provide a statistical learning-based robust optimization approach to approximate the highly intractable probabilisticQoS constraints by nonconvex quadratic constraints, which are further reformulated as matrix inequalities with a rankone constraint via matrix lifting. We design a reweighted power minimization approach by iteratively reweighted l(1) minimization with difference-of-convex-functions (DC) regularization and updating weights, where the reweighted approach is adopted for enhancing group sparsity whereas the DC regularization is designed for inducing rank-one solutions. The numerical results demonstrate that the proposed approach outperforms other state-of-the-art approaches.
引用
收藏
页码:9456 / 9470
页数:15
相关论文
共 37 条
[1]  
[Anonymous], 2014, Convex Optimiza- tion
[2]   Optimization with Sparsity-Inducing Penalties [J].
Bach, Francis ;
Jenatton, Rodolphe ;
Mairal, Julien ;
Obozinski, Guillaume .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2012, 4 (01) :1-106
[3]   Model Compression and Acceleration for Deep Neural Networks The principles, progress, and challenges [J].
Cheng, Yu ;
Wang, Duo ;
Zhou, Pan ;
Zhang, Tao .
IEEE SIGNAL PROCESSING MAGAZINE, 2018, 35 (01) :126-136
[4]   Energy Efficiency of Downlink Transmission Strategies for Cloud Radio Access Networks [J].
Dai, Binbin ;
Yu, Wei .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2016, 34 (04) :1037-1050
[5]   Joint User Scheduling and Power Allocation Optimization for Energy-Efficient NOMA Systems With Imperfect CSI [J].
Fang, Fang ;
Zhang, Haijun ;
Cheng, Julian ;
Roy, Sebastien ;
Leung, Victor C. M. .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2017, 35 (12) :2874-2885
[6]  
Han S., 2016, INT C LEARN REPR ICL
[7]   Efficient Solutions for Weighted Sum Rate Maximization in Multicellular Networks With Channel Uncertainties [J].
Hanif, Muhammad Fainan ;
Le-Nam Tran ;
Tolli, Antti ;
Juntti, Markku ;
Glisic, Savo .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2013, 61 (22) :5659-5674
[8]  
Hong L. J., 2017, LEARNING BASED ROBUS
[9]   Joint Base Station Clustering and Beamformer Design for Partial Coordinated Transmission in Heterogeneous Networks [J].
Hong, Mingyi ;
Sun, Ruoyu ;
Baligh, Hadi ;
Luo, Zhi-Quan .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (02) :226-240
[10]   Incentive Mechanism for Reliable Federated Learning: A Joint Optimization Approach to Combining Reputation and Contract Theory [J].
Kang, Jiawen ;
Xiong, Zehui ;
Niyato, Dusit ;
Xie, Shengli ;
Zhang, Junshan .
IEEE INTERNET OF THINGS JOURNAL, 2019, 6 (06) :10700-10714