68 citations · 68 across the 1 of their papers we have counts for
2 papers
cs.LG2026★ 68 cited
Online Learning: A Modern Introduction Using Convex Optimization
Francesco Orabona
In this book, I introduce the concepts of online learning through a modern view based on convex optimization. Here, online learning refers to the framework of regret minimization u…
cs.LG2025
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
Ashok Cutkosky, Harsh Mehta, Francesco Orabona
We present new algorithms for optimizing non-smooth, non-convex stochastic objectives based on a novel analysis technique. This improves the current best-known complexity for findi…