[DP#2] Database anonymization – differential privacy
I explain the mathematical foundations and Laplacian noise of differential privacy.
I explain the mathematical foundations and Laplacian noise of differential privacy.
I expand on the concept of k-anonymity and l-diversity with a further improvement called t-closeness.
There is no excerpt because this is a protected post.
This is a compilation of a series of videos in which Prof. Patterson describes the Hidden Markov Model, starting with the Markov Model and proceeding to the three key questions for HMMs. A Hidden Markov Model is a machine learning model for predicting sequences of states from indirect observations.
Learn about the first application of signaling, job-market signaling by Michael Spence.
Learn how to refine the various PBEs in a signaling game using forward induction.
Describe how to find a PBE in a signaling game.
Introduce signaling games and explain how PBEs are defined in these games.
Define a perfect Bayesian equilibrium (PBE), explain its existence, how it relates to existing equilibria (NE/SPE), and finally how this relationship can be used to find a PBE.
We explain how to define sequential rationality in dynamic Bayesian games and why traditional equilibria (SPE or NE) do not satisfy sequential rationality.