106 citations · 525 across the 44 of their papers we have counts for
4 papers · 1 filter
Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice
Francesco Orabona, David Pal
We prove non-asymptotic lower bounds on the expectation of the maximum of independent Gaussian variables and the expectation of the maximum of independent symmetric random…
The ABACOC Algorithm: a Novel Approach for Nonparametric Classification of Data Streams
Rocco De Rosa, Francesco Orabona, Nicolò Cesa-Bianchi
Stream mining poses unique challenges to machine learning: predictive models are required to be scalable, incrementally trainable, must remain bounded in size (even when the data s…
A Simple Expression for Mill's Ratio of the Student's -Distribution
Francesco Orabona
I show a simple expression of the Mill's ratio of the Student's t-Distribution. I use it to prove Conjecture 1 in P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-time analysis of…
Scale-Free Algorithms for Online Linear Optimization
Francesco Orabona, David Pal
We design algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors. We…