The Multi-Armed Bandit Problem

written by Theory Club

published October 22, 2018

We had our first faculty talk by Dr. Jacob Abernethy today!

Dr. Abernethy recently joined GT as part of the theoretical CS department. He currently teaches CS 4540 (Advanced Algorithms) and Graduate ML Theory. His talk was on the multi-armed bandit problem and more generally, solving zero-sum games without the iid requirements that are prevalent in much of ML theory today. Click here to learn more about Dr. Abernethy (and his juggling skills).

If you are interested in an REU, there is a Google doc here with helpful information for applying.