Arvind gave a talk on min-max optimization.
The talk included preliminary ideas of optimization (convexity, etc.) and on min-max optimization (well-known algorithms, current research problems, applications)
A good resource to learn about online learning and how it fits into min-max optimization is Introduction to Online Convex Optimization by Elad Hazan
Previous: Crypto Problem Session
We had an interesting set of crypto problems! This session was run by Neil Thistlethwaite.
continue reading ❯