6 citations · 6 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LG2024
Self-Directed Learning of Convex Labelings on Graphs
Georgy Sokolov, Maximilian Thiessen, Margarita Akhmejanova +2
We study the problem of classifying the nodes of a given graph in the self-directed learning setup. This learning setting is a variant of online learning, where rather than an adve…
cs.LG2024
An Equivalence Between Static and Dynamic Regret Minimization
Andrew Jacobsen, Francesco Orabona
We study the problem of dynamic regret minimization in online convex optimization, in which the objective is to minimize the difference between the cumulative loss of an algorithm…