Fetching the paper…
Reading the bibliography…
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.
K. Fan, “Maximum properties and inequalities for the eigenvalues of completely continuous operators,” Proc. Nat. Academy Sci
1951
Earlier work this paper cites.
G. A. Watson, “Characterization of the subdifferential of some matrix norms,” Linear Algebra Appl
1992
Earlier work this paper cites.
P. D. Tao and L. T. H. An, “Convex analysis approach to DC programming: Theory, algorithms and applications,” Acta Math. Vietnamica
1997
Earlier work this paper cites.
Cambridge Univ. Press, 2004
S. Boyd and L. Vandenberghe, Convex optimization · 2004
Earlier work this paper cites.
N. D. Sidiropoulos, T. N. Davidson, and Z.-Q. Luo, “Transmit beamforming for physical-layer multicasting,” IEEE Trans. Signal Process
2006
Earlier work this paper cites.
B. Nazer and M. Gastpar, “Computation over multiple-access channels,” IEEE Trans. Inf. Theory
2007
Earlier work this paper cites.
Z.-Q. Luo, N. D. Sidiropoulos, P. Tseng, and S. Zhang, “Approximation bounds for quadratic optimization with homogeneous quadratic constraints,” SIAM J. Optim
2007
Earlier work this paper cites.
R. Chartrand and W. Yin, “Iteratively reweighted algorithms for compressive sensing,” in Proc. IEEE Int. Conf. Acoustics Speech Signal Process. (ICASSP)
2008
Earlier work this paper cites.
A. Krizhevsky and G. Hinton, “Learning multiple layers of features from tiny images,” tech. rep., University of Toronto, 2009
2009
Earlier work this paper cites.
J. A. Tropp and S. J. Wright, “Computational methods for sparse solution of linear inverse problems,” Proc. IEEE
2010
Earlier work this paper cites.
P. Bouboulis, K. Slavakis, and S. Theodoridis, “Adaptive learning in complex reproducing kernel Hilbert spaces employing Wirtinger’s subgradients,” IEEE Trans. Neural Netw. Learn. Syst
2012
Earlier work this paper cites.
M. Goldenbaum, H. Boche, and S. Stańczak, “Harnessing interference for analog function computation in wireless sensor networks,” IEEE Trans. Signal Process
2013
Earlier work this paper cites.
Y. Shi, J. Zhang, and K. B. Letaief, “Group sparse beamforming for green Cloud-RAN,” IEEE Trans. Wireless Commun
2014
Earlier work this paper cites.
Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,” nature
2015
Earlier work this paper cites.
Princeton university press, 2015
R. T. Rockafellar, Convex analysis · 2015
Earlier work this paper cites.
S. Han, H. Mao, and W. J. Dally, “Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding,” Proc. Int. Conf. Learn. Representations (ICLR)
2016
Earlier work this paper cites.
Y. Shi, J. Cheng, J. Zhang, B. Bai, W. Chen, and K. B. Letaief, “Smoothed L p {L}_{p} -minimization for green Cloud-RAN with user admission control,” IEEE J. Sel. Areas Commun
2016
Cited alongside, same era.
M. A. Davenport and J. Romberg, “An overview of low-rank matrix recovery from incomplete observations,” IEEE J. Sel. Topics Signal Process
2016
Cited alongside, same era.
Y. Shi, J. Zhang, and K. B. Letaief, “Low-rank matrix completion for topological interference management by Riemannian pursuit,” IEEE Trans. Wireless Commun
2016
Cited alongside, same era.
2017
Cited alongside, same era.
C. Karakus, Y. Sun, S. Diggavi, and W. Yin, “Straggler mitigation in distributed optimization through data encoding,” in Proc. Neural Inf. Process. Syst. (NeurIPS)
Y. Lin, S. Han, H. Mao, Y. Wang, and W. J. Dally, “Deep gradient compression: Reducing the communication bandwidth for distributed training,” Proc. Int. Conf. Learn. Representations (ICLR)
2018
Closest in time.
S. Wang, T. Tuor, T. Salonidis, K. K. Leung, C. Makaya, T. He, and K. Chan, “When edge meets learning: Adaptive control for resource-constrained distributed machine learning,” in Proc. IEEE Conf. Computer Commun. (INFOCOM)
2018
Closest in time.
2018
Closest in time.
S. Wang, F. Roosta-Khorasani, P. Xu, and M. W. Mahoney, “GIANT: Globally improved approximate newton method for distributed optimization,” Proc. Neural Inf. Process. Syst. (NeurIPS)
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Proc. Int. Conf. Artificial Intell. Stat. (AISTATS)
2017
Cited alongside, same era.
V. Smith, C.-K. Chiang, M. Sanjabi, and A. S. Talwalkar, “Federated multi-task learning,” in Proc. Neural Inf. Process. Syst. (NeurIPS)
2017
Cited alongside, same era.
P. Blanchard, R. Guerraoui, J. Stainer, et al
2017
Cited alongside, same era.
Y. Chen, L. Su, and J. Xu, “Distributed statistical machine learning in adversarial settings: Byzantine gradient descent,” Proc. ACM Meas. Anal. Comput. Syst
2017
Cited alongside, same era.
N. S. Keskar, D. Mudigere, J. Nocedal, M. Smelyanskiy, and P. T. P. Tang, “On large-batch training for deep learning: Generalization gap and sharp minima,” in Proc. Int. Conf. Learn. Representations (ICLR)
2017
Cited alongside, same era.
E. Chen and M. Tao, “ADMM-based fast algorithm for multi-group multicast beamforming in large-scale wireless systems,” IEEE Trans. Commun
2017
Cited alongside, same era.
C. Lu and Y.-F. Liu, “An efficient global algorithm for single-group multicast beamforming,” IEEE Trans. Signal Process
2017
Cited alongside, same era.
S. Li, S. M. M. Kalan, A. S. Avestimehr, and M. Soltanolkotabi, “Near-optimal straggler mitigation for distributed gradient methods,” in Proc. IEEE Int. Parallel Distrib. Process. Symp. Workshops
2018
Closest in time.
G. Zhu and K. Huang, “MIMO over-the-air computation for high-mobility multi-modal sensing,” IEEE Internet Things J
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
L. Chen, X. Qin, and G. Wei, “A uniform-forcing transceiver design for over-the-air function computation,” IEEE Wireless Commun. Lett
2018
Closest in time.
J.-y. Gotoh, A. Takeda, and K. Tono, “DC formulations and algorithms for sparse optimization problems,” Math. Program
2018
Closest in time.
Y. Shi, J. Zhang, W. Chen, and K. B. Letaief, “Generalized sparse and low-rank optimization for ultra-dense networks,” IEEE Commun. Mag
2018
Closest in time.
2019
Closest in time.
Q. Yang, Y. Liu, T. Chen, and Y. Tong, “Federated machine learning: Concept and applications,” ACM Trans. Intell. Syst. Technol
2019
Closest in time.
N. H. Tran, W. Bao, A. Zomaya, M. N. Nguyen, and C. S. Hong, “Federated learning over wireless networks: Optimization model design and analysis,” Proc. IEEE Conf. Comput. Commun. (INFOCOM)
2019
Closest in time.