Joon Kwon
Joon Kwon
INRA & AgroParisTech
Verified email at ens-lyon.org - Homepage
Title
Cited by
Cited by
Year
A continuous-time approach to online optimization
J Kwon, P Mertikopoulos
Journal of Dynamics and Games 4 (2), 125–148, 2017
402017
Gains and losses are fundamentally different in regret minimization: The sparse case
J Kwon, V Perchet
The Journal of Machine Learning Research 17 (1), 8106-8137, 2016
122016
Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates
J Kwon, V Perchet
Proceedings of Machine Learning Research (AISTATS 2017) 54, 604-613, 2017
62017
Sparse Stochastic Bandits
J Kwon, V Perchet, C Vernade
Proceedings of Machine Learning Research (COLT 2017) 65, 1269–1270, 2017
52017
Unifying mirror descent and dual averaging
A Juditsky, J Kwon, É Moulines
arXiv preprint arXiv:1910.13742, 2019
22019
A universal bound on the variations of bounded convex functions
J Kwon
Journal of Convex Analysis 24 (1), 67--73, 2017
22017
Mirror descent strategies for regret minimization and approachability
J Kwon
Université Pierre-et-Marie-Curie, 2016
22016
Median of means principle as a divide-and-conquer procedure for robustness, sub-sampling and hyper-parameters tuning
J Kwon, G Lecué, M Lerasle
arXiv preprint arXiv:1812.02435, 2018
12018
Refined approachability algorithms and application to regret minimization with global costs
J Kwon
arXiv preprint arXiv:2009.03831, 2020
2020
Unifying mirror descent and dual averaging
J Kwon, A Juditsky
arXiv, 2019
2019
A MOM-based ensemble method for robustness, subsampling and hyperparameter tuning
J Kwon, G Lecué, M Lerasle
arXiv preprint arXiv:1812.02435, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–11