Math 2.0

Resources / preprint

Tracking a Small Set of Experts in Online Convex Optimization P603M3M91A

URIm2://res/P603M3M91A
Kindpreprint
CreatorsAngelos Assos, Anand Brahmbhatt, Elad Hazan
Date2026-10-14
Subjectsarxiv cs.LG, arxiv math.OC, arxiv stat.ML
Scopeborder

Expressions

e1: version, preprint

Date2026-10-14
IdsarXiv 2610.20416

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Comparator pathsdefinitiondefinition 3.3arxiv
$r$-HPCconjectureconjecture 5.1arxiv
3FY369R5F2statementtheorem 4.4arxiv
5WTPSZSHPCstatementcorollary 4.2arxiv
Computational lower bound under $4$-HPCstatementtheorem 5.3arxiv
85M0T1ZWWRstatementlemma 5.6arxiv
A9C8QEDKKJstatementtheorem 4.1arxiv
Exp-concavitydefinitiondefinition 3.1arxiv
Computational lower bound under $r$-HPCstatementtheorem 5.2arxiv
Strong convexitydefinitiondefinition 3.2arxiv
Adaptive regretdefinitiondefinition 3.5arxiv
RNXR6ZM3TVstatementtheorem 4.3arxiv
SY53XBJMTEstatementlemma 5.4arxiv
Tracking regretdefinitiondefinition 3.4arxiv
TWRENAVXVGdefinitiondefinitionarxiv
VTXYAMS08Bstatementlemma 5.5arxiv
WP14MH4M85statementlemma A.1arxiv

Catalogue records