mlsanityData to 14 Oct 2026

HawkEye: Statically and Accurately Profiling the Communication Cost of Models in Multi-party Learning

arXiv 2502.11029 ↗First posted 16 Feb 2025cs.CRcited by 1

Not on the map. Why?

Abstract (arXiv)

Multi-party computation (MPC) based machine learning, referred to as multi-party learning (MPL), has become an important technology for utilizing data from multiple parties with privacy preservation. In recent years, in order to apply MPL in more practical scenarios, various MPC-friendly models have been proposedto reduce the extraordinary communication overhead of MPL. Within the optimization of MPC-friendly models, a critical element to tackle the challenge is profiling the communication cost of models. However, the current solutions mainly depend on manually establishing the profiles to identify communication bottlenecks of models, often involving burdensome human efforts in a monotonous procedure. In this paper, we propose HawkEye, a static model communication cost profiling framework, which enables model designers to get the accurate communication cost of models in MPL frameworks without dynamically running the secure model training or inference processes on a specific MPL framework. Firstly, to profile the communication cost of models with complex structures, we propose a static communication cost profiling method based on a prefix structure that records the function calling chain during the static analysis. Secondly, HawkEye employs an automatic differentiation library to assist model designers in profiling the communication cost of models in PyTorch. Finally, we compare the static profiling results of HawkEye against the profiling results obtained through dynamically running secure model training and inference processes on five popular MPL frameworks, CryptFlow2, CrypTen, Delphi, Cheetah, and SecretFlow-SEMI2K. The experimental results show that HawkEye can accurately profile the model communication cost without dynamic profiling.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 16 Feb 2025.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2022SafeNet: The Unreasonable Effectiveness of Ensembles in Private Collaborative Learning
  2. 2023Breaking the Trilemma of Privacy, Utility, Efficiency via Controllable Machine Unlearning
  3. 2024Privacy Challenges in Meta-Learning: An Investigation on Model-Agnostic Meta-Learning
  4. 2025Privacy Auditing of Large Language Models
  5. 2024Scalability of memorization-based machine unlearning
  6. 2024Machine unlearning through fine-grained model parameters perturbation
  7. 2026MPU: Towards Secure and Privacy-Preserving Knowledge Unlearning for Large Language Models
  8. 2024EM-MIAs: Enhancing Membership Inference Attacks in Large Language Models through Ensemble Modeling