Blog: Stability of Learning Algorithms Part 2.
• Tutorials
Extending to Randomized Algorithms
Let be a set of random parameters.
Let’s assume that our algorithm has uniform stability , if it satisfies,
Applying McDiarmid’s inequality assuming is fixed, we get (Event 1),
Applying McDiarmid’s inequality, we get (Event 2),
Now, probability of holding both the events simultaneously is .
Replacing by , we get,