arXiv:2607. 28856v1 Announce Type: new Abstract: Swap-agnostic learning strengthens classical agnostic learning by allowing the comparator to select a different hypothesis on each level set of the learner's predictions.
By Princewill Okoroafor
arXiv:2608. 25182v1 Announce Type: cross Abstract: In this paper, we study alternating regret in online convex optimization (OCO), motivated by the success of alternating learning dynamics in two-player games.
By Mengxiao Zhang
arXiv:2608.24731v1 Announce Type: new
Abstract: We settle the minimax-optimal alternating regret, a regret notion motivated by alternating learning dynamics in games, for both online linear optimizat...
By Yixin Tao, Weiqiang Zheng
arXiv:2610. 12153v1 Announce Type: new Abstract: We study episodic constrained Markov decision processes with adversarial losses under stochastic hard constraints.
By Qian Zuo, Francesco Emanuele Stradi
arXiv:2609.38375v1 Announce Type: new
Abstract: Can a constant number of linear minimizations per round improve on the $T^{3/4}$ regret rate of online Frank-Wolfe on general convex sets? Weibel et al...
By Mohit Sinha
arXiv:2603. 25029v4 Announce Type: replace Abstract: We study online convex optimization (OCO) with two-point bandit feedback against a non-anticipating adaptive adversary.
By Haishan Ye