Papers
Topics
Authors
Recent
Search
2000 character limit reached

FedAuxHMTL: Federated Auxiliary Hard-Parameter Sharing Multi-Task Learning for Network Edge Traffic Classification

Published 11 Apr 2024 in cs.LG and cs.DC | (2404.08028v1)

Abstract: Federated Learning (FL) has garnered significant interest recently due to its potential as an effective solution for tackling many challenges in diverse application scenarios, for example, data privacy in network edge traffic classification. Despite its recognized advantages, FL encounters obstacles linked to statistical data heterogeneity and labeled data scarcity during the training of single-task models for machine learning-based traffic classification, leading to hindered learning performance. In response to these challenges, adopting a hard-parameter sharing multi-task learning model with auxiliary tasks proves to be a suitable approach. Such a model has the capability to reduce communication and computation costs, navigate statistical complexities inherent in FL contexts, and overcome labeled data scarcity by leveraging knowledge derived from interconnected auxiliary tasks. This paper introduces a new framework for federated auxiliary hard-parameter sharing multi-task learning, namely, FedAuxHMTL. The introduced framework incorporates model parameter exchanges between edge server and base stations, enabling base stations from distributed areas to participate in the FedAuxHMTL process and enhance the learning performance of the main task-network edge traffic classification. Empirical experiments are conducted to validate and demonstrate the FedAuxHMTL's effectiveness in terms of accuracy, total global loss, communication costs, computing time, and energy consumption compared to its counterparts.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)
  1. W. Y. B. Lim, N. C. Luong, D. T. Hoang, Y. Jiao, Y.-C. Liang, Q. Yang, D. Niyato, and C. Miao, “Federated learning in mobile edge networks: A comprehensive survey,” IEEE Communications Surveys and Tutorials, vol. 22, no. 3, pp. 2031–2063, 2020.
  2. S.-C. Lin, C.-H. Lin, and M. Lee, “Privacy-preserving serverless edge learning with decentralized small data,” IEEE Network, pp. 1–8, 2023.
  3. H. Zhang, M. Tao, Y. Shi, X. Bi, and K. B. Letaief, “Federated multi-task learning with non-stationary and heterogeneous data in wireless networks,” IEEE Transactions on Wireless Communications, pp. 1–1, 2023.
  4. P. Wang, S.-C. Lin, and M. Luo, “A framework for qos-aware traffic classification using semi-supervised machine learning in sdns,” in 2016 IEEE International Conference on Services Computing (SCC), 2016, pp. 760–765.
  5. Y. Guo and D. Wang, “Feat: A federated approach for privacy-preserving network traffic classification in heterogeneous environments,” IEEE Internet of Things Journal, vol. 10, no. 2, pp. 1274–1285, 2023.
  6. S. Rezaei and X. Liu, “Multitask learning for network traffic classification,” in 29th International Conference on Computer Communications and Networks (ICCCN), 2020.
  7. L. Liebel and M. Körner, “Auxiliary tasks in multi-task learning,” arXiv preprint arXiv: 1805.06334, 2018.
  8. B. Lin, F. Ye, and Y. Zhang, “A closer look at loss weighting in multi-task learning,” CoRR, vol. abs/2111.10603, 2021.
  9. S. Rezaei and X. Liu, “How to achieve high classification accuracy with just a few labels: A semi-supervised approach using sampled packets,” ArXiv, vol. abs/1812.09761, 2018.
  10. H. Daga, J. Shin, D. Garg, A. Gavrilovska, M. Lee, and R. R. Kompella, “Flame: Simplifying topology extension in federated learning,” in Proceedings of the 2023 ACM Symposium on Cloud Computing, ser. SoCC ’23.   New York, NY, USA: Association for Computing Machinery, 2023, p. 341–357.
  11. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Artificial intelligence and statistics.   PMLR, 2017, pp. 1273–1282.
  12. G. Aceto, D. Ciuonzo, A. Montieri, and A. Pescapé, “Distiller: Encrypted traffic classification via multimodal multitask deep learning,” Journal of Network and Computer Applications, vol. 183, p. 102985, 2021.
  13. U.-J. Baek, B. Kim, J.-T. Park, J.-W. Choi, and M.-S. Kim, “A multi-task classification method for application traffic classification using task relationships,” Electronics, vol. 12, no. 17, 2023.
  14. Y. Zhao, J. Chen, D. Wu, J. Teng, and S. Yu, “Multi-task network anomaly detection using federated learning,” in Proceedings of the 10th international symposium on information and communication technology, 2019, pp. 273–279.
  15. X. Guan, R. Du, X. Wang, and H. Qu, “A personalized federated multi-task learning scheme for encrypted traffic classification,” in Artificial Neural Networks and Machine Learning – ICANN 2023.   Cham: Springer Nature Switzerland, 2023, pp. 258–270.
  16. Z. Zhang, P. Luo, C. C. Loy, and X. Tang, “Facial landmark detection by deep multi-task learning,” in Computer Vision – ECCV 2014, D. Fleet, T. Pajdla, B. Schiele, and T. Tuytelaars, Eds.   Cham: Springer International Publishing, 2014, pp. 94–108.
  17. J. Feng, L. Liu, Q. Pei, and K. Li, “Min-max cost optimization for efficient hierarchical federated learning in wireless edge networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 33, no. 11, pp. 2687–2700, 2022.
  18. T. D. Burd and R. W. Brodersen, “Processor design for portable systems,” Journal of VLSI signal processing systems for signal, image and video technology, vol. 13, pp. 203–221, 1996.
  19. S. Liu, J. Yu, X. Deng, and S. Wan, “Fedcpf: An efficient-communication federated learning approach for vehicular edge computing in 6g communication networks,” IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 2, pp. 1616–1629, 2022.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.