2 citations · 3 across the 8 of their papers we have counts for
Showing cs.LGShow all
3 papers · 1 filter
cs.LG2020
Refined approachability algorithms and application to regret minimization with global costs
Joon Kwon
Blackwell's approachability is a framework where two players, the Decision Maker and the Environment, play a repeated game with vector-valued payoffs. The goal of the Decision Make…
cs.LG2017★ 2 cited
Sparse Stochastic Bandits
Joon Kwon, Vianney Perchet, Claire Vernade
In the classical multi-armed bandit problem, d arms are available to the decision maker who pulls them sequentially in order to maximize his cumulative reward. Guarantees can be ob…
cs.LG2015★ 1 cited
Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case
Joon Kwon, Vianney Perchet
We demonstrate that, in the classical non-stochastic regret minimization problem with decisions, gains and losses to be respectively maximized or minimized are fundamentally di…