Securely Training Decision Trees Efficiently
Divyanshu Bhardwaj, Sandhya Saravanan, Nishanth Chandran, Divya Gupta
2024年份
2被引次数
1顶会引用
摘要
Decision trees are an important class of supervised learning algorithms. When multiple entities contribute data to train a decision tree (e.g. for fraud detection in the financial sector), data privacy concerns necessitate the use of a privacy-enhancing technology such as secure multi-party computation (MPC) in order to secure the underlying training data. Prior state-of-the-art (Hamada et al.[18]) construct an MPC protocol for decision tree training with a communication of O(hmN log N), when building a decision tree of height h for a training dataset of N samples, each having m attributes.
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper,每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Ents: An Efficient Three-party Training Framework for Decision Trees by Communication OptimizationGuopeng Lin, Weili Han, Wenqiang Ruan, Ruisheng Zhou 等CCS 2024 · 被引用 3 次
- Federated Boosted Decision Trees with Differential PrivacySamuel Maddock, Graham Cormode, Tianhao Wang, Carsten Maple 等CCS 2022 · 被引用 31 次
- Gibbon: Faster Secure Two-party Training of Gradient Boosting Decision TreeLichun Li, Zecheng Wu, Yuan Zhao, Zhihao Li 等CCS 2025
- The Influence of Dimensions on the Complexity of Computing Decision TreesStephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk 等AAAI 2023 · 被引用 14 次
- The Value of Collaboration in Convex Machine Learning with Differential PrivacyNan Wu, Farhad Farokhi, David B. Smith, Mohamed Ali KâafarS&P 2020 · 被引用 112 次
