From Online Learning to PAC-Bayes

This is the second post in my series of From Online Learning to X . Last time, we saw how to derive Rademacher complexity bounds using the existence of online learning algorithms. This time, we will see how to go from online learning to PAC-Bayes bounds, using the existence of parameter-free algorithms for the learning with [ ]