most citedParameter-free Regret in High Probability with Heavy Tails

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.LG2025

Unconstrained Robust Online Convex Optimization

Jiujia Zhang, Ashok Cutkosky

This paper addresses online learning with ``corrupted'' feedback. Our learner is provided with potentially corrupted gradients instead of the ``true'' gradients .…

stat.ML2022★ 1 cited

Parameter-free Regret in High Probability with Heavy Tails

Jiujia Zhang, Ashok Cutkosky

We present new algorithms for online convex optimization over unbounded domains that obtain parameter-free regret in high-probability given access only to potentially heavy-tailed…