HypeDelta
DigestTopicsClaimsPredictionsReliabilityResearchers
Admin
DigestTopicsClaimsPredictionsReliabilityResearchers

HypeDelta - AI Research Intelligence

Claimsother
other
fact
neutral

For general OCO over a d-dimensional compact convex set, the worst-case minimax alternating regret is Θ(d log(1 + T/d))

We further extend our results to general OCO over a $d$-dimensional compact convex set and prove that the worst-case minimax alternating regret is $Θ\left(d\log \left(1+\frac{T}{d}\right)\right)$
Machine Learning (Statistics)29 Aug 2026

http://arxiv.org/abs/2608.25182v1