-
Also known as Differential Privacy or Data Privacy, this course (unit) was originally designed for various groups of research students in some top Asia Pacific universities, including Hunan University, University of Chinese Academy of Sciences etc. (since 2018).
-
Materials in this course include resources collected from various open-source online repositories. You are free to use, change and distribute this package.
-
If you found any issue/bug for this site, please submit an issue at tulip-lab/privacy-aware-data-science:
-
Point of Contact π : Prof. Gang Li
Prepared by TULIP Lab
This course (aka unit) offers a focused study of Differential Privacy
, tailored for data science and computer science professionals. It starts with an overview of data privacy concerns, leading into the core concepts of differential privacy, including Ξ΅-differential privacy, Ξ΄-approximations, and noise addition mechanisms like the Laplace and Exponential methods.
Key components include applying differential privacy to statistical analysis and machine learning, adapting conventional techniques to uphold privacy standards. Advanced topics cover federated learning and decentralized systems, emphasizing the field's evolving nature. Discussions on ethical and legal aspects of data privacy are included, preparing students to implement privacy-preserving solutions in various professional settings. The course aims to equip participants with essential skills in designing and managing privacy-conscious data analysis projects.
Students will have access to a comprehensive range of subject materials, comprising slides handouts, assessment documents, and relevant readings. It is recommended that students commence their engagement with each session by thoroughly reviewing the pertinent slides handouts and readings to obtain a comprehensive understanding of the content.
Additionally, students are encouraged to supplement their knowledge by conducting independent research, utilizing online resources or referring to textbooks that cover relevant information related to the topics under study.
The proposed unit is structured to encompass a total of 100 class hours. This allocation includes 80 hours dedicated to instruction and teaching, complemented by 20 hours set aside for student presentations and discussions.
For optimal integration into university curricula, it is suggested that this unit be divided into two distinct segments (or two consecutive units). This approach is more aligned with typical academic scheduling and facilitates a more manageable and effective learning experience.
The unit plan is as below:
π¬ Session |
π·οΈ Category |
π Topic |
π― ULOs |
π¨βπ« Activity |
---|---|---|---|---|
0οΈβ£ | Preliminary | π Induction | ULO1 | |
1οΈβ£ | Preliminary | π Theoretical Foundations | ULO1 | |
2οΈβ£ | Core | π Data Privacy | ULO1 | |
3οΈβ£ | Core | π Privacy Attacks | ULO1 ULO2 | |
4οΈβ£ | Core | π Differential Privacy | ULO1 ULO2 | |
5οΈβ£ | Core | π Composition of Differential Privacy | ULO1 ULO2 | |
6οΈβ£ | Core | π Sparse Vector Technique | ULO1 ULO2 | |
7οΈβ£ | Core | π Query Release and The Net Mechanism | ULO1 ULO2 | |
Student Work | π Selected Topics in DP | ULO3 | ||
8οΈβ£ | Core | π DUA: Database Update Algorithm | ULO1 ULO2 | |
9οΈβ£ | Core | π PTR Mechanism and S&A Mechanism | ULO1 ULO2 ULO3 | |
π | Core | π Fundamental Law of Information Reconstruction | ULO1 ULO2 ULO3 | |
Student Work | π Selected Topics in DP | ULO3 |
The unit plan is as below:
π¬ Session |
π·οΈ Category |
π Topic |
π― ULOs |
π¨βπ« Activity |
---|---|---|---|---|
1οΈβ£ | Advanced | π PATE | ULO1 | |
2οΈβ£ | Advanced | π M-DP and Local-DP | ULO1 | |
3οΈβ£ | Advanced | π DP Learning | ULO1 ULO2 | |
4οΈβ£ | Advanced | π DP SGD | ULO1 ULO2 | |
5οΈβ£ | Advanced | π DP Clustering | ULO1 ULO2 | |
6οΈβ£ | Advanced | π Renyi-DP and zCDP | ULO1 ULO2 | |
7οΈβ£ | Advanced | π Privacy Amplification | ULO1 ULO2 | |
Student Work | π Selected Topics in Advanced DP | ULO3 | ||
8οΈβ£ | Advanced | π TBA | ULO1 ULO2 | |
9οΈβ£ | Advanced | π TBA | ULO1 ULO2 ULO3 | |
π | Advanced | π TBA | ULO1 ULO2 ULO3 | |
Student Work | π Selected Topics in Advanced DP | ULO3 | ||
π | Advanced | π [Invited Talk and Discussions] | ULO1 ULO2 |
Every cohort might be assessed differently, depending on the specific requirements of your universities.
The assessment of the unit is mainly aimed at assessing the students' achievement of the unit learning outcomes (ULOs
, a.k.a. objectives), and checking the students' mastery of those theorey and methods covered in the unit.
The detailed assessment specification and marking rubrics can be found at: S00D-Assessment. The relationship between each assessment task and the ULOs are shown as follows:
π¬ Task |
π¨βπ« Category |
π― ULO1 |
π― ULO2 |
π― ULO3 |
Percentage |
---|---|---|---|---|---|
1οΈβ£ | Presentation | 50% | 25% | 25% | 25% |
2οΈβ£ | Project | 30% | 70% | 50% | |
2οΈβ£ | Report Presentation |
20% | 40% | 40% | 25% |
- SRM 2024 - The final assessment files submissions due date is ποΈ
Saturday, 18/05/2024
(tentative), group of one member only (individual work) for all tasks.
It is expected that you will submit each assessment component on time. You will not be allowed to start everything at the last moment, because we will provide you with feedback that you will be expected to use in future assessments.
γοΈ
If you find that you are having trouble meeting your deadlines, contact the Unit Chair.
This course uses several key references or textbooks, together with relevant publications from TULIP Lab:
- The Algorithmic Foundations of Differential Privacy, by Cynthia Dwork and Aaron Roth
- Research Publications, various resources and readings
Thanks goes to these wonderful people π·
Made with contributors-img.