Decision Trees with Differential Privacy
还没有人认领这个 Issue。
评估
- 难度
- 5/5
- 预计耗时
- 一周以上
- 新手友好度
- 20/100
- Issue 类型
- 功能
- 描述清晰度
- 需要澄清
- 活跃度
- 停滞
- 技术栈
- python
调研方向
The issue names no source files, tests, or entry points, and covers several decision-tree, privacy, distributed-data, bagging, and boosting capabilities. Start by reading the linked design document and cited papers, then split the broad request into a specific, testable sub-issue. Done should mean that one agreed capability has defined scope and acceptance criteria.
由索引模型根据 Issue 内容生成。
描述
Feature Description
This feature will eventually add Decision Trees into the PyDP library, along with the necessary control mechanism needed to use it as part of a pipeline.
Is your feature request related to a problem?
No, it is due to a lack of support.
What alternatives have you considered?
No alternatives currently exist.
Are you interested in working on this yourself?
Yes.
Additional Context
Given that scope of this issue is widespread, it will eventually be broken down into smaller issues. Here's an outline of the functionalities to be implemented:
-
Base Decision Tree Model
-
The base Decision Tree model: a vanilla ID3 based decision tree.
-
ID3 construction algorithm
-
Differentially Private algorithm: to construct and update the tree in a differentially private way.
-
References:
- Semi-Supervised Learning Approach to Differential Privacy by G. Jagannathan, C. Monteleoni, and K. Pillaipakkamnatt
- A Practical Differentially Private Random Decision Tree Classifier by Geetha Jagannathan, Krishnan Pillaipakkamnatt, and Rebecca N. Wright.
- Differentially Private Random Decision Forests using Smooth Sensitivity by Sam Fletcher, Md Zahidul Islam
-
Differentially Private Bagging
-
An algorithm to partition data multiple times in order to achieve differentially private subsample-and-aggregate.
-
References:
- Differentially Private Bagging: Improved utility and cheaper privacy than subsample-and-aggregate by James Jordon, Jinsung Yoon, Mihaela van der Schaar
-
Support for Horizontally and Vertically Partitioned Data
-
This will extend the functionality of the Private Decision Tree to be able to work with horizontally distributed data (by means of incremental learning) and vertically distributed data.
-
Vertically distributed data requires each stakeholder to construct a differentially private decision tree (assuming no overlap in the attributes) and makes a union.
-
References:
- A Practical Differentially Private Random Decision Tree Classifier by Geetha Jagannathan, Krishnan Pillaipakkamnatt, and Rebecca N. Wright.
-
Boosted Differential Private ensembles
-
Add boosting to differentially private decisions trees to enable ensemble formation.
-
References:
- Boosted and Differentially Private Ensembles of Decision Trees by Richard Nock, Wilko Henecka
More details can be found here as well as in the reference papers.
- 主要语言
- Python
- 星标
- 550
- 派生
- 143
- PR 合并指标
- 30 天内没有已合并 PR
环境准备
从这里开始
- 先读完整个 Issue，再读项目的贡献指南。
- 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
- Fork 仓库，在一个分支上完成修改。
- 提交 Pull Request，并在描述里引用这个 Issue 编号。
OpenMined/PyDP 的其他 Issue
-
Type: New Feature :heavy_plus_sign:
难度 4/5 3-5 天 新手友好度 45/100
-
Type: Question :grey_question:
难度 3/5 1-2 天 新手友好度 25/100
-
Type: Question :grey_question:
难度 4/5 3-5 天 新手友好度 32/100
-
Type: Improvement :chart_with_upwards_trend:
难度 3/5 1-2 天 新手友好度 35/100
-
Type: New Feature :heavy_plus_sign:
难度 3/5 1-2 天 新手友好度 38/100
相似的 Issue
-
docs pydanty:is-working
难度 2/5 1-3 小时 新手友好度 75/100
pydantic/pydantic-ai#8863 ·
维护者通常 1 天内回复
-
难度 2/5 1-3 小时 新手友好度 68/100
run-llama/llama_index#23278 ·
维护者通常 2 天内回复
-
documentation from-review-extraction github-actions priority: low severity:nit
难度 1/5 1 小时以内 新手友好度 92/100
LearningCircuit/local-deep-research#6946 ·
维护者通常 1 天内回复
-
难度 2/5 1-3 小时 新手友好度 82/100
oracle/langchain-oracle#323 ·
维护者通常 1 天内回复
-
难度 1/5 1 小时以内 新手友好度 88/100
tenstorrent/tt-metal#58057 · 1 条评论 ·
维护者通常 1 天内回复