Fetching the paper…
Reading the bibliography…
Non-Independent and Identically Distributed (non- IID) data distribution among clients is considered as the key factor that degrades the performance of federated learning (FL).
R. Caruana, “Multitask learning,” Machine Learning , vol. 28, no. 1, p. 41–75, Jul. 1997
1997
Earlier work this paper cites.
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.
M. F. Duarte and Y. Hen Hu, “Vehicle classification in distributed sensor networks,” Journal of Parallel and Distributed Computing , vol. 64, no. 7, pp. 826–838, Jul. 2004
2004
Earlier work this paper cites.
R. K. Ando and T. Zhang, “A framework for learning predictive structures from multiple tasks and unlabeled data,” Journal of Machine Learning Research , vol. 6, p. 1817–1853, Dec. 2005
2005
Earlier work this paper cites.
A. Argyriou, T. Evgeniou, and M. Pontil, “Convex multi-task feature learning,” Machine Learning , vol. 73, no. 3, p. 243–272, Dec. 2008
2008
Earlier work this paper cites.
A. Krizhevsky, “Learning Multiple Layers of Features from Tiny Images,” p. 60, 2009
2009
Earlier work this paper cites.
Y. Zhang and D.-Y. Yeung, “A convex formulation for learning task relationships in multi-task learning,” 2010, p. 733–742
2010
Earlier work this paper cites.
A. Kumar and H. Daumé, “Learning task grouping and overlap in multi-task learning,” in Proceedings of the International Conference on Machine Learning , 2012
2012
Earlier work this paper cites.
D. Anguita, A. Ghio, L. Oneto, X. Parra, and J. L. Reyes-Ortiz, “A Public Domain Dataset for Human Activity Recognition Using Smartphones,” Computational Intelligence , p. 6, 2013
2013
Earlier work this paper cites.
D. Hallac, J. Leskovec, and S. Boyd, “Network lasso: Clustering and optimization in large graphs,” in Proceedings of the 21th ACM International Conference on Knowledge Discovery and Data Mining , 2015
2015
Earlier work this paper cites.
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-Efficient Learning of Deep Networks from Decentralized Data,” in Proceedings of the International Conference on Artificial Intelligence and Statistics , Apr. 2017
2017
Earlier work this paper cites.
V. Smith, C.-K. Chiang, M. Sanjabi, and A. Talwalkar, “Federated multi-task learning,” in Proceedings of the International Conference on Neural Information Processing Systems , 2017
2017
Earlier work this paper cites.
C. Finn, P. Abbeel, and S. Levine, “Model-agnostic meta-learning for fast adaptation of deep networks,” in Proceedings of the International Conference on Machine Learning , 2017
2017
Earlier work this paper cites.
P. Vanhaesebrouck, A. Bellet, and M. Tommasi, “Decentralized Collaborative Learning of Personalized Models over Networks,” in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics , Apr 2017, pp. 509–517
2017
Earlier work this paper cites.
T. S. Brisimi et al. , “Federated learning of predictive models from federated electronic health records,” International journal of medical informatics , vol. 112, pp. 59–67, 2018
2018
Earlier work this paper cites.
Y. Zhao et al. , “Federated Learning with Non-IID Data,” arXiv: 1806.00582 , Jun. 2018
2018
Earlier work this paper cites.
A. Nichol, J. Achiam, and J. Schulman, “On First-Order Meta-Learning Algorithms,” arXiv: 1803.02999 , Oct. 2018
2018
Earlier work this paper cites.
Y. Nesterov, Ed., Lectures on Convex Optimization . Springer International Publishing, 2018, vol. 137
2018
Earlier work this paper cites.
B. E. Woodworth, J. Wang, A. Smith, B. McMahan, and N. Srebro, “Graph oracle models, lower bounds, and gaps for parallel stochastic optimization,” in Proceedings of the International Conference on Neural Information Processing Systems , vol. 31, 2018
2018
Earlier work this paper cites.
F. Haddadpour and M. Mahdavi, “On the convergence of local descent methods in federated learning,” arXiv: 1910.14425 , 2019
2019
Earlier work this paper cites.
D. Li and J. Wang, “Fedmd: Heterogenous federated learning via model distillation,” arXiv: 1910.03581 , 2019
2019
Cited alongside, same era.
Y. Jiang, J. Konečný, K. Rush, and S. Kannan, “Improving Federated Learning Personalization via Model Agnostic Meta Learning,” arXiv: 1909.12488 , Sep. 2019
2019
Cited alongside, same era.
M. G. Arivazhagan, V. Aggarwal, A. K. Singh, and S. Choudhary, “Federated Learning with Personalization Layers,” arXiv: 1912.00818 , Dec. 2019
2019
Cited alongside, same era.
R. Li, F. Ma, W. Jiang, and J. Gao, “Online federated multitask learning,” in IEEE International Conference on Big Data , 2019
2019
Cited alongside, same era.
A. Jung and N. Tran, “Localized linear regression in networked data,” IEEE Signal Processing Letters , vol. 26, no. 7, pp. 1090–1094, 2019
2019
Cited alongside, same era.
X. Li, K. Huang, W. Yang, S. Wang, and Z. Zhang, “On the Convergence of FedAvg on Non-IID Data,” in Proceedings of International Conference on Learning Representations , Apr. 2020
2020
Later among the works it cites.
A. Khaled, K. Mishchenko, and P. Richtarik, “Tighter theory for local sgd on identical and heterogeneous data,” in Proceedings of the International Conference on Artificial Intelligence and Statistics , vol. 108, 26–28 Aug. 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
P. P. Liang et al. , “Think Locally, Act Globally: Federated Learning with Local and Global Representations,” arXiv: 2001.01523 , Jun. 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
H. Yu, S. Yang, and S. Zhu, “Parallel restarted sgd with faster convergence and less communication: Demystifying why model averaging works for deep learning,” vol. 33, no. 01, Jul. 2019
2019
Cited alongside, same era.
M. Mohri, G. Sivek, and A. T. Suresh, “Agnostic Federated Learning,” arXiv:1902.00146 , Jan. 2019
2019
Cited alongside, same era.
A. Paszke et al. , “PyTorch: An Imperative Style, High-Performance Deep Learning Library,” in Advances in Neural Information Processing Systems 32 , Vancouver, BC, Canada, 2019
2019
Cited alongside, same era.
S. Stich, “Unified optimal analysis of the (stochastic) gradient method,” arXiv: 1907.04232 , 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
F. Sattler, S. Wiedemann, K.-R. Müller, and W. Samek, “Robust and communication-efficient federated learning from non-i.i.d. data,” IEEE Trans. Neural Netw. Learn. Syst. , vol. 31, no. 9, pp. 3400–3413, 2020
2020
Cited alongside, same era.
N. Rieke et al. , “The future of digital health with federated learning,” NPJ Digital Medicine , vol. 3, 2020
2020
Cited alongside, same era.
F. Hanzely, S. Hanzely, S. Horváth, and P. Richtarik, “Lower Bounds and Optimal Algorithms for Personalized Federated Learning,” in Proceedings of Advances in Neural Information Processing Systems , 2020
2020
Later among the works it cites.
R. Nassif, S. Vlaski, C. Richard, and A. H. Sayed, “Learning over multitask graphs—part i: Stability analysis,” IEEE Open Journal of Signal Processing , vol. 1, pp. 28–45, 2020
2020
Later among the works it cites.
——, “Learning over multitask graphs—part II: Performance analysis,” IEEE Open Journal of Signal Processing , vol. 1, pp. 46–63, 2020
2020
Later among the works it cites.
Y. Arjevani, O. Shamir, and N. Srebro, “A tight convergence analysis for stochastic gradient descent with delayed updates,” in Proceedings of the International Conference on Algorithmic Learning Theory , vol. 117, Feb. 2020
2020
Later among the works it cites.
A. Kulunchakov and J. Mairal, “Estimate sequences for stochastic composite optimization: Variance reduction, acceleration, and robustness to noise,” Journal of Machine Learning Research , vol. 21, pp. 155:1–155:52, 2020
2020
Later among the works it cites.
J. Wang, Q. Liu, H. Liang, G. Joshi, and H. V. Poor, “Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimization,” in Advances in Neural Information Processing Systems , 2020
2020
Later among the works it cites.
P. Kairouz et al. , “Advances and open problems in federated learning,” Foundations and Trends in Machine Learning , vol. 14, no. 1, 2021
2021
Closest in time.
F. Sattler, K.-R. Müller, and W. Samek, “Clustered federated learning: Model-agnostic distributed multitask optimization under privacy constraints,” IEEE Trans. Neural Netw. Learn, Syst. , vol. 32, no. 8, pp. 3710–3722, 2021
2021
Closest in time.
Y. Sarcheshmehpour, Y. Tian, L. Zhang, and A. Jung, “Networked federated multi-task learning,” arXiv: 2105.12769 , 2021
2021
Closest in time.
T. Li, S. Hu, A. Beirami, and V. Smith, “Ditto: Fair and Robust Federated Learning Through Personalization,” in Proceedings of the 38th International Conference on Machine Learning , Jul. 2021
2021
Closest in time.
J. Shen, X. Zhen, M. Worring, and L. Shao, “Variational Multi-Task Learning with Gumbel-Softmax Priors,” in Proceedings of Advances in Neural Information Processing Systems , 2021
2021
Closest in time.
A. Jung and Y. SarcheshmehPour, “Local graph clustering with network lasso,” IEEE Signal Processing Letters , vol. 28, pp. 106–110, 2021
2021
Closest in time.
J. Tuck, S. Barratt, and S. Boyd, “A distributed method for fitting laplacian regularized stratified models,” Journal of Machine Learning Research , 2021
2021
Closest in time.
J. Tuck and S. Boyd, “Eigen-stratified models,” Optimization and Engineering , 2021
2021
Closest in time.
F. Hanzely, B. Zhao, and M. Kolar, “Personalized federated learning: A unified framework and universal optimization techniques,” in Proceedings of International Conference on Learning Representations , 2021
2021
Closest in time.
S. J. Reddi et al. , “ADAPTIVE FEDERATED OPTIMIZATION,” in International Conference on Learning Representations , 2021
2021
Closest in time.