Decision Trees with Differential Privacy
まだ誰も着手していません。
評価
- 難易度
- 5/5
- 見積もり時間
- 1週間以上
- 初心者へのやさしさ
- 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
- フォーク
- 142
- PR マージ指標
- 30日以内にマージされた PR はありません
環境構築
- Dockerfile または Docker Compose ファイルあり
- プルリクエストのテンプレートなし
- コントリビューションガイドを読む
はじめの一歩
- issue を最後まで読み、次にプロジェクトのコントリビューションガイドを読みます。
- 着手することを issue にコメントします — 二人が同じ作業をするのを防げます。
- リポジトリをフォークし、ブランチを切って変更します。
- 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
-
[Bug] @deck.gl/arcgis dist import resolves to unpublished @deck.gl/core source path (9.3.11, 9.4.0)オープン
難易度 2/5 1〜3時間 初心者へのやさしさ 72/100
メンテナーはふだん 1 日以内に返信
-
workflow: a tick's dispatch counts as 'only this step', and no review self-grants a round unattendedオープンworkflow
難易度 2/5 1〜3時間 初心者へのやさしさ 85/100
kristofdegrave/homeassistant-smart-charging#1505 ·
メンテナーはふだん 1 日以内に返信
-
metadata submission
難易度 2/5 1〜3時間 初心者へのやさしさ 82/100
-
bug
難易度 2/5 1〜3時間 初心者へのやさしさ 65/100
canonical/content-cache-operator#163 · コメント 1 件 ·
メンテナーはふだん 1 日以内に返信
-
[submission]オープンsubmission
難易度 1/5 1時間未満 初心者へのやさしさ 65/100
leanprover/lean-eval-submissions#1852 ·
メンテナーはふだん 1 日以内に返信