Suivre
Gábor Bartók
Gábor Bartók
ETH Zurich
Adresse e-mail validée de ualberta.ca - Page d'accueil
Titre
Citée par
Citée par
Année
Incentivizing users for balancing bike sharing systems
A Singla, M Santoni, G Bartók, P Mukerji, M Meenen, A Krause
Twenty-Ninth AAAI conference on artificial intelligence, 2015
2302015
Near-optimally teaching the crowd to classify
A Singla, I Bogunovic, G Bartók, A Karbasi, A Krause
International Conference on Machine Learning, 154-162, 2014
1192014
Partial monitoring—classification, regret bounds, and algorithms
G Bartók, DP Foster, D Pál, A Rakhlin, C Szepesvári
Mathematics of Operations Research 39 (4), 967-997, 2014
1122014
TF-Agents: A library for reinforcement learning in tensorflow
S Guadarrama, A Korattikara, O Ramirez, P Castro, E Holly, S Fishman, ...
GitHub repository, 2018
1082018
An efficient algorithm for learning with semi-bandit feedback
G Neu, G Bartók
International Conference on Algorithmic Learning Theory, 234-248, 2013
782013
Minimax regret of finite partial-monitoring games in stochastic environments
G Bartók, D Pál, C Szepesvári
Proceedings of the 24th Annual Conference on Learning Theory, 133-154, 2011
492011
An adaptive algorithm for finite stochastic partial monitoring
G Bartók, N Zolghadr, C Szepesvári
arXiv preprint arXiv:1206.6487, 2012
402012
Partial monitoring with side information
G Bartók, C Szepesvári
International Conference on Algorithmic Learning Theory, 305-319, 2012
312012
Toward a classification of finite partial-monitoring games
A Antos, G Bartók, D Pál, C Szepesvári
Theoretical Computer Science 473, 77-99, 2013
302013
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits
G Neu, B Gábor
Microtome Publishing, 2016
282016
On actively teaching the crowd to classify
A Singla, I Bogunovic, G Bartók, A Karbasi, A Krause
NIPS Workshop on Data Driven Education, 2013
222013
Toward a classification of finite partial-monitoring games
G Bartók, D Pál, C Szepesvári
International Conference on Algorithmic Learning Theory, 224-238, 2010
212010
A near-optimal algorithm for finite partial-monitoring games against adversarial opponents
G Bartók
Conference on Learning Theory, 696-710, 2013
202013
Efficient partial monitoring with prior information
HP Vanchinathan, G Bartók, A Krause
Advances in Neural Information Processing Systems 27, 2014
132014
Gumbel-matrix routing for flexible multi-task learning
K Maziarz, E Kokiopoulou, A Gesmundo, L Sbaiz, G Bartok, J Berent
122019
Fast task-aware architecture inference
E Kokiopoulou, A Hauth, L Sbaiz, A Gesmundo, G Bartok, J Berent
arXiv preprint arXiv:1902.05781, 2019
122019
TF-Agents: A library for reinforcement learning in tensorflow (2018)
S Guadarrama, A Korattikara, O Ramirez, P Castro, E Holly, S Fishman, ...
URL https://github. com/tensorflow/agents, 0
12
The role of information in online learning
G Bartók
72012
Models of active learning in group-structured state spaces
G Bartók, C Szepesvári, S Zilles
Information and Computation 208 (4), 364-384, 2010
32010
Task-aware Performance Prediction for Efficient Architecture Search
E Kokiopoulou, A Hauth, L Sbaiz, A Gesmundo, G Bartók, J Berent
ECAI 2020, 1238-1245, 2020
22020
Le systčme ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20