Gábor Bartók
Gábor Bartók
ETH Zurich
Verified email at ualberta.ca - Homepage
Title
Cited by
Cited by
Year
Incentivizing users for balancing bike sharing systems
A Singla, M Santoni, G Bartók, P Mukerji, M Meenen, A Krause
Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015
1802015
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
982014
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
982014
An efficient algorithm for learning with semi-bandit feedback
G Neu, G Bartók
International Conference on Algorithmic Learning Theory, 234-248, 2013
652013
TF-Agents: A library for reinforcement learning in tensorflow
S Guadarrama, A Korattikara, O Ramirez, P Castro, E Holly, S Fishman, ...
GitHub repository, 2018
482018
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
482011
An adaptive algorithm for finite stochastic partial monitoring
G Bartók, N Zolghadr, C Szepesvári
arXiv preprint arXiv:1206.6487, 2012
422012
Partial monitoring with side information
G Bartók, C Szepesvári
International Conference on Algorithmic Learning Theory, 305-319, 2012
282012
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
252013
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits
G Neu, B Gábor
Microtome Publishing, 2016
232016
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
A near-optimal algorithm for finite partial-monitoring games against adversarial opponents
G Bartók
Conference on Learning Theory, 696-710, 2013
202013
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
202010
Efficient Partial Monitoring with Prior Information.
HP Vanchinathan, G Bartók, A Krause
NIPS, 1691-1699, 2014
132014
The role of information in online learning
G Bartók
82012
Fast task-aware architecture inference
E Kokiopoulou, A Hauth, L Sbaiz, A Gesmundo, G Bartok, J Berent
arXiv preprint arXiv:1902.05781, 2019
62019
Gumbel-matrix routing for flexible multi-task learning
K Maziarz, E Kokiopoulou, A Gesmundo, L Sbaiz, G Bartok, J Berent
32019
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
Ranking architectures using meta-learning
A Dubatovka, E Kokiopoulou, L Sbaiz, A Gesmundo, G Bartok, J Berent
arXiv preprint arXiv:1911.11481, 2019
12019
Non-trivial two-armed partial-monitoring games are bandits
A Antos, G Bartók, C Szepesvári
arXiv preprint arXiv:1108.4961, 2011
12011
The system can't perform the operation now. Try again later.
Articles 1–20