Fetching the paper…
Reading the bibliography…
Federated learning (FL) encounters scalability challenges when implemented over fog networks.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE , vol. 86, no. 11, pp. 2278–2324, 1998
1998
Earlier work this paper cites.
S. Boyd, S.-J. Kim, L. Vandenberghe, and A. Hassibi, “A tutorial on geometric programming,” Optimization and engineering , vol. 8, pp. 67–127, 2007
2007
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro, “Robust stochastic approximation approach to stochastic programming,” SIAM Journal on optimization , vol. 19, no. 4, pp. 1574–1609, 2009
2009
Earlier work this paper cites.
S.-Y. Tu and A. H. Sayed, “Diffusion strategies outperform consensus strategies for distributed estimation over adaptive networks,” IEEE Transactions on Signal Processing , vol. 60, no. 12, pp. 6217–6234, 2012
2012
Earlier work this paper cites.
P. Di Lorenzo and G. Scutari, “Next: In-network nonconvex optimization,” IEEE Transactions on Signal and Information Processing over Networks , vol. 2, no. 2, pp. 120–136, 2016
2016
Earlier work this paper cites.
Y. Sun, G. Scutari, and D. Palomar, “Distributed nonconvex multiagent optimization over time-varying networks,” in 2016 50th Asilomar Conference on Signals, Systems and Computers . IEEE, 2016, pp. 788–794
2016
Earlier work this paper cites.
X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, “Can decentralized algorithms outperform centralized algorithms? a case study for decentralized parallel stochastic gradient descent,” Neural Information Processing Systems , vol. 30, 2017
2017
Earlier work this paper cites.
A. Nedic, A. Olshevsky, and W. Shi, “Achieving geometric convergence for distributed optimization over time-varying graphs,” SIAM Journal on Optimization , vol. 27, no. 4, pp. 2597–2633, 2017
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
Y. Tian, Y. Sun, and G. Scutari, “Asy-sonata: Achieving linear convergence in distributed asynchronous multiagent optimization,” in 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . IEEE, 2018, pp. 543–551
2018
Earlier work this paper cites.
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
T. Li, A. K. Sahu, A. Talwalkar, and V. Smith, “Federated learning: Challenges, methods, and future directions,” IEEE Signal Processing Magazine , vol. 37, no. 3, pp. 50–60, 2020
2020
Earlier work this paper cites.
2020
Earlier work this paper cites.
S. P. Karimireddy, S. Kale, M. Mohri, S. Reddi, S. Stich, and A. T. Suresh, “Scaffold: Stochastic controlled averaging for federated learning,” in International Conference on Machine Learning . PMLR, 2020, pp. 5132–5143
2020
Cited alongside, same era.
S. Hosseinalipour, C. G. Brinton, V. Aggarwal, H. Dai, and M. Chiang, “From federated to fog learning: Distributed machine learning over heterogeneous wireless networks,” IEEE Communications Magazine , vol. 58, no. 12, pp. 41–47, 2020
2020
Cited alongside, same era.
Y. Tu, Y. Ruan, S. Wagle, C. G. Brinton, and C. Joe-Wong, “Network-aware optimization of distributed learning for fog computing,” in IEEE INFOCOM 2020 . IEEE, 2020, pp. 2509–2518
2020
Cited alongside, same era.
L. Liu, J. Zhang, S. Song, and K. B. Letaief, “Client-edge-cloud hierarchical federated learning,” in IEEE ICC . IEEE, 2020, pp. 1–6
2020
Cited alongside, same era.
S. Zehtabi, S. Hosseinalipour, and C. G. Brinton, “Decentralized event-triggered federated learning with heterogeneous communication thresholds,” in IEEE CDC , 2022, pp. 4680–4687
2022
Later among the works it cites.
V.-D. Nguyen, S. Chatzinotas, B. Ottersten, and T. Q. Duong, “Fedfog: Network-aware optimization of federated learning over wireless fog-cloud systems,” IEEE Transactions on Wireless Communications , vol. 21, no. 10, pp. 8581–8599, 2022
2022
Later among the works it cites.
S. Hosseinalipour, S. S. Azam, C. G. Brinton, N. Michelusi, V. Aggarwal, D. J. Love, and H. Dai, “Multi-stage hybrid federated learning over large-scale d2d-enabled fog networks,” IEEE/ACM Transactions on Networking , vol. 30, no. 4, pp. 1569–1584, 2022
2022
Later among the works it cites.
M. Yemini, R. Saha, E. Ozfatura, D. Gündüz, and A. J. Goldsmith, “Semi-decentralized federated learning with collaborative relaying,” in 2022 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2022, pp. 1471–1476
2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Koloskova, N. Loizou, S. Boreiri, M. Jaggi, and S. Stich, “A unified theory of decentralized SGD with changing topology and local updates,” in International Conference on Machine Learning . PMLR, 2020, pp. 5381–5393
2020
Cited alongside, same era.
P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. Bonawitz, Z. Charles, G. Cormode, R. Cummings et al. , “Advances and open problems in federated learning,” Foundations and Trends® in Machine Learning , vol. 14, no. 1–2, pp. 1–210, 2021
2021
Cited alongside, same era.
L. Li, D. Shi, R. Hou, H. Li, M. Pan, and Z. Han, “To talk or to work: Flexible communication compression for energy efficient federated learning over heterogeneous mobile edge devices,” in IEEE INFOCOM 2021 . IEEE, 2021, pp. 1–10
2021
Cited alongside, same era.
S. Wang, M. Lee, S. Hosseinalipour, R. Morabito, M. Chiang, and C. G. Brinton, “Device sampling for heterogeneous federated learning: Theory, algorithms, and implementation,” in IEEE INFOCOM 2021 . IEEE, 2021, pp. 1–10
2021
Cited alongside, same era.
F. P.-C. Lin, S. Hosseinalipour, S. S. Azam, C. G. Brinton, and N. Michelusi, “Semi-decentralized federated learning with cooperative d2d local model aggregations,” IEEE Journal on Selected Areas in Communications , vol. 39, no. 12, pp. 3851–3869, 2021
2021
Cited alongside, same era.
C. Suraci, S. Pizzi, D. Garompolo, G. Araniti, A. Molinaro, and A. Iera, “Trusted and secured d2d-aided communications in 5g networks,” Ad Hoc Networks , vol. 114, p. 102403, 2021
2021
Cited alongside, same era.
Z. Wang, H. Xu, J. Liu, H. Huang, C. Qiao, and Y. Zhao, “Resource-efficient federated learning with hierarchical aggregation in edge computing,” in IEEE INFOCOM 2021 . IEEE, 2021, pp. 1–10
2021
Cited alongside, same era.
A. Koloskova, T. Lin, and S. U. Stich, “An improved analysis of gradient tracking for decentralized machine learning,” Neural Information Processing Systems , vol. 34, pp. 11 422–11 435, 2021
2021
Cited alongside, same era.
Later among the works it cites.
X. Wang, Y. Zhao, C. Qiu, Z. Liu, J. Nie, and V. C. Leung, “Infedge: A blockchain-based incentive mechanism in hierarchical federated learning for end-edge-cloud communications,” IEEE Journal on Selected Areas in Communications , vol. 40, no. 12, pp. 3325–3342, 2022
2022
Later among the works it cites.
Y. Sun, G. Scutari, and A. Daneshmand, “Distributed optimization based on gradient tracking revisited: Enhancing convergence rate via surrogation,” SIAM Journal on Optimization , vol. 32, no. 2, pp. 354–385, 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
S. Wang, J. Perazzone, M. Ji, and K. S. Chan, “Federated learning with flexible control,” in IEEE INFOCOM . IEEE, 2023, pp. 1–10
2023
Closest in time.
2023
Closest in time.
X. Zhou, X. Ye, I. Kevin, K. Wang, W. Liang, N. K. C. Nair, S. Shimizu, Z. Yan, and Q. Jin, “Hierarchical federated learning with social context clustering-based participant selection for internet of medical things applications,” IEEE Transactions on Computational Social Systems , 2023
2023
Closest in time.
R. Parasnis, S. Hosseinalipour, Y.-W. Chu, C. G. Brinton, and M. Chiang, “Connectivity-aware semi-decentralized federated learning over time-varying d2d networks,” International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc) , 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.