Boosted and Differentially Private Ensembles of Decision Trees
From Google TechTalks · 20:31
Show by Google TechTalks
A Google TechTalk, 2020/7/29, presented by Richard Nock, Data61 and The Australian National UniversityABSTRACT: Ensembles of decision tree (DT) classifiers are hugely popular inboth the private and non-private settings, and display a very singularpicture: while boosting and offsprings top international competitionsin the non-private setting, random forests reign supremewhen differential privacy (DP) is at stake. There is no middle groundthat would combine the rates of boosting with the randomness that DPcommands. In this talk, we summarise (i) the existence of a privacy vs boosting dilemma for top-down induction of DTs in the context of statistical decision theory, (ii) an algorithm to navigate this dilemma with the introduction of a new specifically designed proper loss and a way to tune it at training time to make the most of boosting under DP constraints, (iii) formal boosting convergence results under DP constraints and (iv) experiments comparing our approach to differentially private random forests.Uploaded 04-06-21
More episodes of Google TechTalks
More episodes
- Hyperproductive Distributed Scrum Teams
- 360 Video
- Multi-Party Computation: From Theory to Practice
- The Extended Mind: Recent Experimental Evidence
- DSD: A Hybrid Analysis Tool for Bug Finding
- Chasing the Constants and its Implications in Differential Privacy
- Making Great Decisions
- Streaming Private Continual Counting via Binning
- Distributed Testing with SmartFrog
- Differentially Private Synthetic Data without Training
PodSearch is a free, independent podcast search engine. Read about PodSearch, the privacy policy or contact us.