Skip to content
Sagan

Paper

Practical Anonymous Two-Party Gradient Boosting Decision Tree

Unreadunread

AI summary

arXiv:2605. 26903v1 Announce Type: new Abstract: Structured data is well handled by gradient-boosted decision trees (GBDT), which are usually trained on vertically partitioned features across mutually distrustful parties.