431 citations · 433 across the 2 of their papers we have counts for
3 papers
cs.LG2020★ 2 cited
Boosted and Differentially Private Ensembles of Decision Trees
Richard Nock, Wilko Henecka
Boosted ensemble of decision tree (DT) classifiers are extremely popular in international competitions, yet to our knowledge nothing is formally known on how to make them \textit{a…
cs.DB2018
Entity Resolution and Federated Learning get a Federated Resolution
Richard Nock, Stephen Hardy, Wilko Henecka +4
Consider two data providers, each maintaining records of different feature sets about common entities. They aim to learn a linear model over the whole set of features. This problem…
cs.LG2017★ 431 cited
Private federated learning on vertically partitioned data via entity resolution and additively homomorphic encryption
Stephen Hardy, Wilko Henecka, Hamish Ivey-Law +4
Consider two data providers, each maintaining private records of different feature sets about common entities. They aim to learn a linear model jointly in a federated setting, name…