Picture for Nicholas J. A. Harvey

Nicholas J. A. Harvey

Continuous Prediction with Experts' Advice

Add code
Jun 01, 2022
Figure 1 for Continuous Prediction with Experts' Advice
Viaarxiv icon

Efficient and Optimal Fixed-Time Regret with Two Experts

Add code
Mar 15, 2022
Viaarxiv icon

Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses

Add code
Oct 22, 2020
Viaarxiv icon

Online mirror descent and dual averaging: keeping pace in the dynamic case

Add code
Jun 03, 2020
Figure 1 for Online mirror descent and dual averaging: keeping pace in the dynamic case
Viaarxiv icon

Optimal anytime regret with two experts

Add code
Feb 20, 2020
Figure 1 for Optimal anytime regret with two experts
Viaarxiv icon

Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent

Add code
Sep 02, 2019
Figure 1 for Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent
Figure 2 for Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent
Viaarxiv icon

Tight Analyses for Non-Smooth Stochastic Gradient Descent

Add code
Dec 13, 2018
Viaarxiv icon

Submodular Functions: Learnability, Structure, and Optimization

Add code
Aug 22, 2012
Figure 1 for Submodular Functions: Learnability, Structure, and Optimization
Viaarxiv icon