A continuous-time approach to online optimization. - Joon Kwon; Panayotis Mertikopoulos (CoRR, 2014)

Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case. - Joon Kwon; Vianney Perchet (J. Mach. Learn. Res., 2016)

Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates. - Joon Kwon; Vianney Perchet (AISTATS, 2017)

Sparse Stochastic Bandits. - Joon Kwon; Vianney Perchet; Claire Vernade (COLT, 2017)

Refined approachability algorithms and application to regret minimization with global costs. - Joon Kwon (J. Mach. Learn. Res., 2021)

Blackwell's Approachability with Time-Dependent Outcome Functions and Dot Products. Application to the Big Match. - Joon Kwon; Bruno Ziliotto (CoRR, 2023)

Unifying mirror descent and dual averaging. - Anatoli B. Juditsky; Joon Kwon; Éric Moulines (Math. Program., 2023)

pyPLNmodels: A Python package to analyze multivariate high-dimensional count data. - Bastien Batardiere; Joon Kwon; Julien Chiquet (J. Open Source Softw., 2024)