v1v2 (latest)

Online learning for min-max discrete problems

12 July 2019

Papers citing "Online learning for min-max discrete problems"

2 / 2 papers shown

Title
$No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting$ No-Regret M ${}^{\natural}$ -Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting Taihei Oki Shinsaku Sakaue 101 0 0 21 May 2024
Gradient and Projection Free Distributed Online Min-Max Resource Optimization Jingrong Wang Ben Liang 101 3 0 07 Dec 2021