Подписаться
Michal Valko
Michal Valko
Google DeepMind Paris & Inria France & ENS MVA
Подтвержден адрес электронной почты в домене deepmind.com - Главная страница
Название
Процитировано
Процитировано
Год
Bootstrap your own latent: A new approach to self-supervised learning
JB Grill, F Strub, F Altché, C Tallec, PH Richemond, E Buchatskaya, ...
Neural Information Processing Systems, 2020
49362020
Large-scale representation learning on graphs via bootstrapping
S Thakoor, C Tallec, MG Azar, R Munos, P Veličković, M Valko
International Conference on Learning Representations, 2022
248*2022
Finite-time analysis of kernelised contextual bandits
M Valko, N Korda, R Munos, I Flaounas, N Cristianini
Uncertainty in Artificial Intelligence, 2013
2422013
Outlier detection for patient monitoring and alerting
M Hauskrecht, I Batal, M Valko, S Visweswaran, GF Cooper, G Clermont
Journal of Biomedical Informatics, 2013
1622013
Online influence maximization under independent cascade model with semi-bandit feedback
Z Wen, B Kveton, M Valko, S Vaswani
Neural Information Processing Systems, 2017
134*2017
Stochastic simultaneous optimistic optimization
M Valko, A Carpentier, R Munos
International Conference on Machine Learning, 2013
1322013
Efficient learning by implicit exploration in bandit problems with side observations
T Kocák, G Neu, M Valko, R Munos
Neural Information Processing Systems, 2014
1192014
Spectral bandits for smooth graph functions
M Valko, R Munos, B Kveton, T Kocák
International Conference on Machine Learning, 2014
1182014
Broaden your views for self-supervised video learning
A Recasens, P Luc, JB Alayrac, L Wang, F Strub, C Tallec, M Malinowski, ...
International Conference on Computer Vision, 2021
1082021
Black-box optimization of noisy functions with unknown smoothness
JB Grill, M Valko, R Munos
Neural Information Processing Systems, 2015
1062015
Episodic reinforcement learning in finite MDPs: Minimax lower bounds revisited
O Darwiche Domingues, P Ménard, E Kaufmann, M Valko
Algorithmic Learning Theory, 2021
1022021
Simple regret for infinitely many armed bandits
A Carpentier, M Valko
International Conference on Machine Learning, 2015
942015
Adaptive reward-free exploration
E Kaufmann, P Ménard, OD Domingues, A Jonsson, E Leurent, M Valko
Algorithmic Learning Theory, 2021
762021
Gaussian process optimization with adaptive sketching: Scalable and no regret
D Calandriello, L Carratino, A Lazaric, M Valko, L Rosasco
Conference on Learning Theory, 2019
762019
BYOL works even without batch statistics
PH Richemond, JB Grill, F Altché, C Tallec, F Strub, A Brock, S Smith, ...
NeurIPS 2020 Workshop: Self-Supervised Learning - Theory and Practice, 2020
752020
Game Plan: What AI can do for Football, and What Football can do for AI
K Tuyls, S Omidshafiei, P Muller, Z Wang, J Connor, D Hennes, I Graham, ...
Journal of Artificial Intelligence Research 71, 41-88, 2021
722021
Gamification of pure exploration for linear bandits
R Degenne, P Ménard, X Shang, M Valko
International Conference on Machine Learning, 2020
692020
Conditional outlier detection for clinical alerting
M Hauskrecht, M Valko, I Batal, G Clermont, S Visweswaran, GF Cooper
AMIA annual symposium proceedings 2010, 286, 2010
632010
Fast active learning for pure exploration in reinforcement learning
P Ménard, OD Domingues, A Jonsson, E Kaufmann, E Leurent, M Valko
International Conference on Machine Learning, 2021
622021
Monte-Carlo tree search as regularized policy optimization
JB Grill, F Altché, Y Tang, T Hubert, M Valko, I Antonoglou, R Munos
International Conference on Machine Learning, 2020
622020
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20