Poster
The Pareto Regret Frontier
Wouter M Koolen

Sun Dec 8th 02:00 -- 06:00 PM @ Harrah's Special Events Center, 2nd Floor #None

Performance guarantees for online learning algorithms typically take the form of regret bounds, which express that the cumulative loss overhead compared to the best expert in hindsight is small. In the common case of large but structured expert sets we typically wish to keep the regret especially small compared to simple experts, at the cost of modest additional overhead compared to more complex others. We study which such regret trade-offs can be achieved, and how. We analyse regret w.r.t. each individual expert as a multi-objective criterion in the simple but fundamental case of absolute loss. We characterise the achievable and Pareto optimal trade-offs, and the corresponding optimal strategies for each sample size both exactly for each finite horizon and asymptotically.

Author Information

Wouter M Koolen (Centrum Wiskunde & Informatica)

More from the Same Authors