paper-with-me

Papers

Ents: An Efficient Three-party Training Framework for Decision Trees by Communication Optimization

2024-06-12 · Guopeng Lin, Weili Han, Wenqiang Ruan, Ruisheng Zhou, Lushan Song, Bingshuai Li, Yunfeng Shao

Multi-party training frameworks for decision trees based on secure multi-party computation enable multiple parties to train high-performance models on distributed private data with privacy preservation. The training process essentially involves frequent dataset splitting according to the splitting criterion (e.g. Gini impurity). However, existing multi-party training frameworks for decision trees demonstrate communication inefficiency due to the following issues: (1) They suffer from huge communication overhead in securely splitting a dataset with continuous attributes. (2) They suffer from huge communication overhead due to performing almost all the computations on a large ring to accommodate the secure computations for the splitting criterion. In this paper, we are motivated to present an efficient three-party training framework, namely Ents, for decision trees by communication optimization. For the first issue, we present a series of training protocols based on the secure radix sort protocols to efficiently and securely split a dataset with continuous attributes. For the second issue, we propose an efficient share conversion protocol to convert shares between a small ring and a large ring to reduce the communication overhead incurred by performing almost all the computations on a large ring. Experimental results from eight widely used datasets show that Ents outperforms state-of-the-art frameworks by $5.5\times \sim 9.3\times$ in communication sizes and $3.9\times \sim 5.3\times$ in communication rounds. In terms of training time, Ents yields an improvement of $3.5\times \sim 6.7\times$. To demonstrate its practicality, Ents requires less than three hours to securely train a decision tree on a widely used real-world dataset (Skin Segmentation) with more than 245,000 samples in the WAN setting.

📄 PDF Abstract BibTeX arXiv:2406.07948

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Diagnosing Korean-Language LLM Political Bias via Census-Grounded Agent Simulation

2026-05-18 · Sungwoo Kang arxiv

Large language models (LLMs) exhibit systematic political biases in voter simulations, but their underlying mechanisms and cross-lingual generalizations remain poorly understood. We introduce Dynamo-K, a census-grounded …

Practical Federated Gradient Boosting Decision Trees

2019-11-11 · Qinbin Li, Zeyi Wen, Bingsheng He

Gradient Boosting Decision Trees (GBDTs) have become very successful in recent years, with many awards in machine learning and data mining competitions. There have been several recent studies on how to train GBDTs in the…

Federated Learning

Understanding LLM Intervention Explanations in Multi-Party Human-Robot Interaction

2026-06-28 · Micol Spitale, Massimiliano Nigro, Emily Cross arxiv

Large Language Models (LLMs) are increasingly embedded in social robots to support natural group interactions, yet their role in complex multi-party settings remains underexplored. In particular, it is unclear how LLM-dr…

Evolutionary Biparty Multiobjective UAV Path Planning: Problems and Empirical Comparisons

2026-03-23 · Kesheng Chen, Wenjian Luo, Xin Lin, Zhen Song 외 arxiv

Unmanned aerial vehicles (UAVs) have been widely used in urban missions, and proper planning of UAV paths can improve mission efficiency while reducing the risk of potential third-party impact. Existing work has consider…

Multi-Party Supervised Fine-tuning of Language Models for Multi-Party Dialogue Generation

2024-12-06 · Xiaoyu Wang, Ningyuan Xi, Teng Chen, Qingqing Gu 외

Large Language Models (LLM) are usually fine-tuned to participate in dyadic or two-party dialogues, which can not adapt well to multi-party dialogues (MPD), which hinders their applications in such scenarios including mu…

Dialogue Generation