244 citations · 296 across the 5 of their papers we have counts for
5 papers
SnapBoost: A Heterogeneous Boosting Machine
Thomas Parnell, Andreea Anghel, Malgorzata Lazuka +5
Modern gradient boosting software frameworks, such as XGBoost and LightGBM, implement Newton descent in a functional space. At each boosting iteration, their goal is to find the ba…
Differentially Private Stochastic Coordinate Descent
Georgios Damaskinos, Celestine Mendler-Dünner, Rachid Guerraoui +2
In this paper we tackle the challenge of making the stochastic coordinate descent algorithm differentially private. Compared to the classical gradient descent algorithm where updat…
Breadth-first, Depth-next Training of Random Forests
Andreea Anghel, Nikolas Ioannou, Thomas Parnell +3
In this paper we analyze, evaluate, and improve the performance of training Random Forest (RF) models on modern CPU architectures. An exact, state-of-the-art binary decision tree b…
Benchmarking and Optimization of Gradient Boosting Decision Tree Algorithms
Andreea Anghel, Nikolaos Papandreou, Thomas Parnell +2
Gradient boosting decision trees (GBDTs) have seen widespread adoption in academia, industry and competitive data science due to their state-of-the-art performance in many machine…
Temporal correlation detection using computational phase-change memory
Abu Sebastian, Tomas Tuma, Nikolaos Papandreou +4
For decades, conventional computers based on the von Neumann architecture have performed computation by repeatedly transferring data between their processing and their memory units…