The DOI matches its Crossref record; 61 of the 62 references it cites were found in a registry or an index.
Federated Learning via Over-the-Air Computation
Open accessAbstract
The stringent requirements for low-latency and privacy of the emerging high-stake applications with intelligent devices such as drones and smart vehicles make the cloud computing inapplicable in these scenarios. Instead, edge machine learning becomes increasingly attractive for performing training and inference directly at network edges without sending data to a centralized data center. This stimulates a nascent field termed as federated learning for training a machine learning model on computation, storage, energy and bandwidth limited mobile devices in a distributed manner. To preserve data privacy and address the issues of unbalanced and non-IID data points across different devices, the federated averaging algorithm has been proposed for global model aggregation by computing the weighted average of locally updated model at each selected device. However, the limited communication bandwidth becomes the main bottleneck for aggregating the locally computed updates. We thus propose a novel over-the-air computation based approach for fast global model aggregation via exploring the superposition property of a wireless multiple-access channel. This is achieved by joint device selection and beamforming design, which is modeled as a sparse and low-rank optimization problem to support efficient algorithms design. To achieve this goal, we provide a difference-of-convex-functions (DC) representation for the sparse and low-rank function to enhance sparsity and accurately detect the fixe…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“For instance, over-the-air federated learning (FL) provides a collaborative ML framework to train a global statistical model over wireless networks without accessing edge devices' private raw data [31].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [31]
In the citing paper
“Specifically, the transmitted signals at edge devices are first multiplied by the fading channels and then superposed over-the-air with additive channel noise, resulting in a noisy weighted sum of transmitted signals [31].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [31]
In the citing paper
“Specifically, for edge training systems, we need to jointly optimize the subcarrier and bandwidth allocation [88], [90], [241], transmit power and receive beamforming [31], [48], [178], passive beamforming at RIS [48], [178], device selection [31], [242] and activity detection [76], local updates computation [92], and global aggregation frequency control [130], thereby reducing the optimality gap”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [31]
In the citing paper
“For instance, the group sparsity can represent the combinatorial variables for edge devices selection in FL [31], edge devices activity detection [76], and inference tasks selection [53].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [31]
In the citing paper
“Most of the resource allocation problems in edge AI need to solve a series of nonconvex optimization problems, e.g., nonconvex sparse optimization for device selection in wireless FL, nonconvex quadratic programming for transceiver design in over-the-air FL [31], lowrank matrix optimization for interference management in edge device distributed inference [52], and unit modulus constrained phase”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [31]
2 more claims about this paper
Create a free account to see every claim other papers make about this one.
Citations
Cites
Hao, X.-B., & Zhang, G.-G. (2017) · Encycl. Semantic Comput. Robotic Intell. · doi:10.1142/s2425038416300184 · Cited by 86,401 · cited 1×
“THE astounding growth in data volume promotes widespread artificial intelligent applications such as image recognition and natural language processing [1], thanks to”
BackgroundLeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Vorontsova, E., Hildebrand, R., Gasnikov, A. V., & Stonyakin, F. (2010) · Computer Vision · doi:10.1007/978-1-4614-5257-7_6 · Cited by 39,270 · cited 2×
“The resulting problem is known as the sum-of-infeasibilities in the literature of optimization [39].”
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215 · cited 7×
“In particular, the federated averaging (FedAvg) algorithm [12] turns out to be a promising way to efficiently average the locally updated model at each device with unbalanced and non-IID data, thereby reducing the number of communication rounds between the center node and the end devices.”
InfluentialFederated Machine Learning: Concept and Applications
Yang, Q., Liu, Y., Chen, T., & Tong, Y. (2019) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3298981 · Cited by 6,322
Han, S., Mao, H., & Dally, W. J. (2015) · arXiv · doi:10.48550/arxiv.1510.00149 · Cited by 4,662 · cited 1×
“To address this issue, there is a growing body of recent works to reduce the storage overhead, time and power consumption in the inference process using the model compression methods via hardware and software co-design [7], [8].”
MethodTowards Federated Learning at Scale: System Design
Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Konečný, J., Mazzocchi, S., McMahan, H. B., et al. (2019) · arXiv · doi:10.48550/arxiv.1902.01046 · Cited by 2,334 · cited 2×
“It has promising applications [14], [15] such as smart retail, smart healthcare, financial services, mobile content predictions, etc.”
BackgroundFederated Learning with Non-IID Data
Zhao, Y., Li, M., Lai, L., Suda, N., Civin, D., & Chandra, V. (2018) · arXiv · doi:10.48550/arxiv.1806.00582 · Cited by 2,077 · cited 1×
“, the data is generated by distinct distributions across different devices), imposes significant statistical challenges to fit a mode from the non-IID data [13], [17].”
BackgroundMarzetta, T. L., Larsson, E. G., Yang, H., & Ngo, H. Q. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9781316799895 · Cited by 1,718
Larsson, E. (2016) · International Workshop on Signal Processing Advances in Wireless Communications · doi:10.1109/spawc.2015.7226986 · Cited by 1,425 · cited 1×
“…to support efficient algorithms design, we shall propose a sparse representation approach to find the maximum number of involved devices, followed by reformulating the nonconvex quadratic constraints as affine constraints with an additional rank-one constraint by the matrix lifting technique.”
(2017) · neural information processing systems · Cited by 1,413
Transmit beamforming for physical-layer multicasting
Sidiropoulos, N. D., Davidson, T. N., & Luo, Z.-Q. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.872578 · Cited by 1,335 · cited 1×
“A natural way to address it is adopting the matrix lifting technique [40].”
Federated Multi-Task LearningPreprint
Smith, V., Chiang, C.-K., Sanjabi, M., & Talwalkar, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.10467 · Cited by 1,320 · cited 2×
“Furthermore, various advanced distributed optimization algorithms [9]–[13] have been proposed to speed up the training process by taking advantages of the computing power and distributed data over multiple devices.”
BackgroundIteratively reweighted algorithms for compressive sensing
Chartrand, R., & Yin, W. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518498 · Cited by 1,248 · cited 1×
“However, the smoothing parameters should be chosen carefully since the convergence behavior of iterative reweighted algorithms may be sensitive to them [33], [47].”
BackgroundDeep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training
Lin, Y., Han, S., Mao, H., Wang, Y., & Dally, W. J. (2017) · arXiv · doi:10.48550/arxiv.1712.01887 · Cited by 1,134 · cited 1×
“Furthermore, various advanced distributed optimization algorithms [9]–[13] have been proposed to speed up the training process by taking advantages of the computing power and distributed data over multiple devices.”
BackgroundComputational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046 · cited 1×
“Sparse optimization and low-rank optimization have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [30], [31], [32], [33], [34].”
Federated Learning over Wireless Networks: Optimization Model Design and Analysis
Tran, N. H., Bao, W., Zomaya, A., Nguyen, M. N. H., & Hong, C. S. (2019) · IEEE INFOCOM 2019 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2019.8737464 · Cited by 1,013 · cited 1×
“Recently, a nascent field called federated learning [12]–[16] investigates the possibility of distributed learning directly on the mobile devices to enjoy the benefits of better privacy and less network bandwidth.”
BackgroundOffloading in Mobile Edge Computing: Task Allocation and Computational Frequency Scaling
Thinh, T. Q., Tang, J., La, Q. D., & Quek, T. Q. S. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2699660 · Cited by 866 · cited 1×
“This emerging technique is termed as edge ML [4], which is supported by mobile edge computing [5], [6] via pushing the cloud computing services to the network edges.”
MethodCheng, Y., Wang, D., Zhou, P., & Zhang, T. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2765695 · Cited by 817 · cited 1×
“To address this issue, there is a growing body of recent works to reduce the storage overhead, time and power consumption in the inference process using the model compression methods via hardware and software co-design [7], [8].”
MethodBroadband Analog Aggregation for Low-Latency Federated Edge Learning
Zhu, G., Wang, Y., & Huang, K. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2946245 · Cited by 761 · cited 1×
“This tradeoff between learning and aggregation is also considered in the recent parallel work [30], which quantifies the device population by excluding the devices with weak channel coefficients under deep channel fading and assuming IID located devices.”
BackgroundComputation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753 · cited 5×
“In consideration of both computation and communication, we shall propose a co-design approach for fast model aggregation by leveraging the principles of over-the-air computation (AirComp) [22].”
BackgroundMethodInfluentialToward an Intelligent Edge: Wireless Communication Meets Machine Learning
Zhu, G., Liu, D., Du, Y., You, C., Zhang, J., & Huang, K. (2020) · IEEE Communications Magazine · doi:10.1109/mcom.001.1900103 · Cited by 606
Towards an Intelligent Edge: Wireless Communication Meets Machine LearningPreprint
Zhu, G., Liu, D.-Z., Du, Y.-Q., You, C.-S., Zhang, J., & Huang, K.-B. (2018) · arXiv.org · doi:10.48550/arxiv.1809.00343 · Cited by 600
Multiuser MIMO Achievable Rates With Downlink Training and Channel State Feedback
Caire, G., Jindal, N., Kobayashi, M., & Ravindran, N. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046225 · Cited by 537 · cited 1×
“The feedback problem can be addressed using unquantized analog feedback or quantized digital feedback [39].”
MethodMultiuser MIMO achievable rates with downlink training and channel state feedback
Caire, G., Jindal, N., Kobayashi, M., & Ravindran, N. (2010) · HAL · Cited by 533
On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima
Keskar, N. S., Mudigere, D., Nocedal, J., Smelyanskiy, M., & Tang, P. T. P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.04836 · Cited by 525 · cited 1×
“Furthermore, we notice that the aggregation error also causes a notable drop of the prediction accuracy [32].”
BackgroundConvex analysis approach to d.c. programming: Theory, Algorithm and Applications
Dinh, T. P., & Thi, H. A. L. (1997) · HAL · Cited by 515
Group Sparse Beamforming for Green Cloud-RAN
(2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.040214.131770 · Cited by 468 · cited 1×
“Sparse and low-rank optimizations have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [41]–[45].”
BackgroundSelf-citationMaximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
Fan, K. (1951) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.37.11.760 · Cited by 459 · cited 2×
“Definition 1: Ky Fan k-norm [36]: The Ky Fan k-norm of vector x ∈ C is a convex function of x and is given by the sum of largest-k absolute values, i.”
BackgroundMethodAn Overview of Low-Rank Matrix Recovery From Incomplete Observations
Davenport, M. A., & Romberg, J. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2539100 · Cited by 439 · cited 1×
“Sparse optimization and low-rank optimization have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [30], [31], [32], [33], [34].”
BackgroundDistributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
Chen, Y., Su, L., & Xu, J. (2017) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3154503 · Cited by 390 · cited 1×
“Byzantine failures [20]) bring critical security issues for large-scale distributed learning, which will incur a major degradation of the learning performance [21].”
BackgroundWang, J., & Joshi, G. (2018) · arXiv.org · doi:10.48550/arxiv.1808.07576 · Cited by 365
Characterization of the subdifferential of some matrix norms
Watson, G. A. (1992) · Linear Algebra and its Applications · doi:10.1016/0024-3795(92)90407-2 · Cited by 364 · cited 1×
“Proof: The subdifferential of orthogonal invariant norm ‖M‖2 for PSD matrix M is given by [52] ∂‖M‖2 = conv{V diag(d)V H : d ∈ ∂‖σ(M)‖∞}, (46) where conv denotes the convex hull of a set and M = V ΣV H is the singular value decomposition of M , and σ(M) = [σi(M)] ∈ C is the vector formed by all singular values of M .”
BackgroundMIMO Over-the-Air Computation for High-Mobility Multimodal Sensing
Zhu, G., & Huang, K. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2871070 · Cited by 273
Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
Chen, Y., Su, L., & Xu, J. (2018) · Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems · doi:10.1145/3219617.3219655 · Cited by 228
Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
Luo, Z., Sidiropoulos, N. D., Tseng, P., & Zhang, S. (2007) · SIAM Journal on Optimization · doi:10.1137/050642691 · Cited by 225 · cited 15×
“• Reweighted ℓ 2 +SDR [26]: We take the smoothed ℓ p norm for sparsity inducing of x in Step 1, which is solved by the reweighted ℓ 2 -minimization algorithm.”
BackgroundMethodInfluentialLearning for Computation Offloading in Mobile Edge Computing
Dinh, T. Q., La, Q. D., Quek, T. Q. S., & Shin, H. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2866572 · Cited by 214 · cited 1×
“This emerging technique is termed as edge ML [4], which is supported by mobile edge computing [5], [6] via pushing the cloud computing services to the network edges.”
MethodWhen Edge Meets Learning: Adaptive Control for Resource-Constrained Distributed Machine Learning
Wang, S., Tuor, T., Salonidis, T., Leung, K. K., Makaya, C., He, T., & Chan, K. (2018) · IEEE INFOCOM 2018 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2018.8486403 · Cited by 209 · cited 2×
“, devices that run slow) may cause significant delays [8], [17].”
BackgroundRobust Analog Function Computation via Wireless Multiple-Access Channels
Goldenbaum, M., & Stanczak, S. (2013) · IEEE Transactions on Communications · doi:10.1109/tcomm.2013.072913.120815 · Cited by 187 · cited 1×
“Recent research works on AirComp have achieved significant progresses from the point of view of information theory [22], signal processing [23], transceiver design [24], [25], channel state information acquisition [26], synchronization issues [27], [28], the AirComp based model aggregation problem poses unique challen…”
BackgroundDC formulations and algorithms for sparse optimization problems
Gotoh, J.-Y., Takeda, A., & Tono, K. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1181-0 · Cited by 184 · cited 3×
“Specifically, to enhance sparsity, we adopt a novel DC representation for the 0-norm [35], which is given by the difference of the 1-norm and the Ky Fan k-norm [36], i.”
BackgroundMethodHarnessing Interference for Analog Function Computation in Wireless Sensor Networks
Goldenbaum, M., Boche, H., & Stanczak, S. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2272921 · Cited by 183 · cited 4×
“The advantages of the over-the-air computation beyond traditional communicationand-computation separation method that computes a linear function of messages across distributed mobile nodes at the center node have been demonstrated in terms of higher communication efficiency and lower bandwidth [22], [23].”
BackgroundInfluentialA Berkeley View of Systems Challenges for AI
Stoica, I., Song, D., Popa, R. A., Patterson, D., Mahoney, M. W., Katz, R., Joseph, A. D., Jordan, M., Hellerstein, J. M., Gonzalez, J. E., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.05855 · Cited by 171 · cited 1×
“2961673 the recent breakthroughs in machine learning (ML) techniques particularly deep learning, as well as the unprecedented levels of computing power [2].”
BackgroundAirShare: Distributed coherent transmission made seamless
Abari, O., Rahul, H., Katabi, D., & Pant, M. (2015) · 2015 IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2015.7218555 · Cited by 170 · cited 1×
“Recent research works on AirComp have achieved significant progresses from the point of view of information theory [22], signal processing [23], transceiver design [24], [25], channel state information acquisition [26], synchronization issues [27], [28], the AirComp based model aggregation problem poses unique challen…”
BackgroundOver-the-Air Computation for IoT Networks: Computing Multiple Functions With Antenna Arrays
Chen, L., Zhao, N., Chen, Y., Yu, F. R., & Wei, G. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2843321 · Cited by 136
A Uniform-Forcing Transceiver Design for Over-the-Air Function Computation
Chen, L., Qin, X., & Wei, G. (2018) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2018.2840157 · Cited by 129 · cited 4×
“However, when the number of antennas N increases, its performance deteriorates since the probability of returning rank-one solutions is low [34], [48].”
BackgroundInfluentialGIANT: Globally Improved Approximate Newton Method for Distributed OptimizationPreprint
Wang, S., Roosta, F., Xu, P., & Mahoney, M. W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.03528 · Cited by 120 · cited 1×
“2) Large communication loads across mobile devices limit the scalability for federated learning to efficiently exchange locally computed updates at each device [12], [18].”
BackgroundStraggler Mitigation in Distributed Optimization Through Data EncodingPreprint
Karakus, C., Sun, Y., Diggavi, S. N., & Yin, W. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.04969 · Cited by 118 · cited 1×
“Furthermore, various advanced distributed optimization algorithms [7], [8], [9], [10], [11] have been proposed to speed up the training process by taking advantages of the computing power and distributed data over multiple devices.”
BackgroundADMM-Based Fast Algorithm for Multi-Group Multicast Beamforming in Large-Scale Wireless Systems
Chen, E., & Tao, M. (2017) · IEEE Transactions on Communications · doi:10.1109/tcomm.2017.2679708 · Cited by 114 · cited 1×
“However, when the number of antennas N increases, its performance deteriorates since the probability of returning rank-one solutions is low [34], [48].”
BackgroundNear-Optimal Straggler Mitigation for Distributed Gradient Methods
Li, S.-Z., Kalan, S. M. M., Avestimehr, A., & Soltanolkotabi, M. (2017) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2018.00137 · Cited by 105 · cited 1×
“, devices that run slow) may cause significant delays [8], [17].”
BackgroundWireless Network Intelligence at the Edge
Park, J., Samarakoon, S., Bennis, M., & Debbah, M. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2941458 · Cited by 92 · cited 1×
“This emerging technique is termed as edge ML [4], which is supported by mobile edge computing [5], [6] via pushing the cloud computing services to the network edges.”
MethodConvergence guarantees for a class of non-convex and non-smooth optimization problemsPreprint
Khamaru, K., & Wainwright, M. J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.09629 · Cited by 77 · cited 1×
“Based on [49, Proposition 2] and [53, Proposition 1], we have provided the convergence results of the DC algorithm for problem PS1 and problem PS2 in the following proposition, where the metric of convergence rate is chosen following [53].”
MethodSmoothed -Minimization for Green Cloud-RAN With User Admission Control
Shi, Y., Cheng, J., Zhang, J., Bai, B., Chen, W., & Letaief, K. B. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2544578 · Cited by 70 · cited 4×
“• Reweighted l2+SDR [26]: We take the smoothed lpnorm for sparsity inducing of x in Step 1, which is solved by the reweighted l2-minimization algorithm.”
BackgroundMethodInfluentialSelf-citationAdaptive Learning in Complex Reproducing Kernel Hilbert Spaces Employing Wirtinger's Subgradients
Bouboulis, P., Slavakis, K., & Theodoridis, S. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2011.2179810 · Cited by 66 · cited 2×
“For complex domain X , we shall apply Wirtinger calculus [50] for algorithm design.”
MethodAn Efficient Global Algorithm for Single-Group Multicast Beamforming
Lu, C., & Liu, Y.-F. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2699640 · Cited by 62 · cited 4×
“1) Sparse Optimization: ℓ 1 -norm is a natural convex surrogate for the nonconvex sparse function, i.e., ℓ 0 -norm.”
InfluentialJiang, T., Shi, Y., Zhang, J., & Letaief, K. B. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2881486 · Cited by 60 · cited 1×
“This sporadic property of IoT data traffic can be exploited to support massive device connectivity via jointly detecting active devices and estimating channel coefficients [54].”
BackgroundSelf-citationLow-Rank Matrix Completion for Topological Interference Management by Riemannian Pursuit
Shi, Y., Zhang, J., & Letaief, K. B. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2544758 · Cited by 56 · cited 1×
“Sparse optimization and low-rank optimization have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [30], [31], [32], [33], [34].”
BackgroundSelf-citationGeneralized Sparse and Low-Rank Optimization for Ultra-Dense Networks
Shi, Y., Zhang, J., Chen, W., & Letaief, K. B. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700472 · Cited by 44 · cited 1×
“Sparse and low-rank optimizations have attracted much attention in machine learning, signal processing, high-dimensional statistics, as well as wireless communication [41]–[45].”
BackgroundSelf-citationRobust Design for Massive CSI Acquisition in Analog Function Computation Networks
Ang, F., Chen, L., Zhao, N., Chen, Y., & Yu, F. R. (2019) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2019.2891904 · Cited by 25 · cited 1×
“Recent research works on AirComp have achieved significant progresses from the point of view of information theory [22], signal processing [23], transceiver design [24], [25], channel state information acquisition [26], synchronization issues [27], [28], the AirComp based model aggregation problem poses unique challen…”
BackgroundNonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods
Wang, H., Zhang, F., Shi, Y., & Hu, Y. (2021) · Journal of Global Optimization · doi:10.1007/s10898-021-01093-0 · Cited by 24 · cited 2×
“The nonconvex smoothed p-norm supported by the iteratively reweighted algorithm is a promising way to enhance the sparsity level [32], [33].”
Self-citation
Research works printed but not linked: 2
- rockafellar, 2015, Convex Analysis
- tao, 1997, Convex analysis approach to DC programming: Theory, algorithms and applications, Acta Math Vietn, 22, 289
Cited by
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
Lim, W. Y. B., Luong, N. C., Hoang, D. T., Jiao, Y., Liang, Y.-C., Yang, Q., Niyato, D., & Miao, C. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2986024 · Cited by 2,565
“Similar to [129], the authors in [130] propose an integration of computation and communication via over-the-air computation.”
BackgroundA survey on federated learning
Zhang, C., Xie, Y., Bai, H., Yu, B., Li, W., & Gao, Y. (2021) · Knowledge-Based Systems · doi:10.1016/j.knosys.2021.106775 · Cited by 1,899
Federated Learning for Healthcare Informatics
Xu, J., Glicksberg, B. S., Su, C., Walker, P., Bian, J., & Wang, F. (2019) · arXiv · doi:10.48550/arxiv.1911.06270 · Cited by 1,538
“Problems Paper Indices Statistical [110] [132] [89] [79] [129] [37] [27] [34] [52] [23] [45] Communication [64] [72] [92] [107] [87] [72] [16] [24] [3] [99] [15] [133] [48] [5] [105] [117] [126]”
BackgroundConvergence of Edge Computing and Deep Learning: A Comprehensive Survey
Wang, X., Han, Y., Leung, V. C. M., Niyato, D., Yan, X., & Chen, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2970550 · Cited by 1,498
“However, this synchronous updating mode potentially cannot scale well, and is inefficient and inflexible in view of two key properties of FL, specifically, 1) infrequent training tasks, since edge devices typically have weaker computing power and limited battery endurance and thus cannot afford intensive training task…”
BackgroundInfluentialA Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection
Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., Li, Y., Liu, X., & He, B. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124599 · Cited by 1,407
Metadata
- Authors
- Yang, K., Jiang, T., Shi, Y., & Ding, Z.
- Affiliations
- Chinese Academy of Sciences (CN)
- ShanghaiTech University (CN)
- University of California, Davis (US)
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2020-03
- Volume
- 19
- Issue
- 3
- Pages
- 2022-2035
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W2999074226
- Cited by
- 1,084
- References
- 62
- Citations by year
- 2026: 86 · 2025: 154 · 2024: 176 · 2023: 190 · 2022: 189 · 2021: 190 · 2020: 80
- FWCI
- 63.79
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Wireless Communications (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Natural Science Foundation of China (61601290)
- National Science Foundation (CNS-1702752, ECCS-1711823)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Technologies
- Keywords
- federated learning, over-the-air computation, edge machine learning, model aggregation, device selection, beamforming design, difference of convex functions, DC algorithm, non-IID data, data privacy
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.