Seguir
Martin Schmid
Martin Schmid
Google DeepMind
Email confirmado em kam.mff.cuni.cz - Página inicial
Título
Citado por
Citado por
Ano
Deepstack: Expert-level artificial intelligence in heads-up no-limit poker
M Moravčík, M Schmid, N Burch, V Lisý, D Morrill, N Bard, T Davis, ...
Science 356 (6337), 508-513, 2017
7642017
Text understanding with the attention sum reader network
R Kadlec, M Schmid, O Bajgar, J Kleindienst
arXiv preprint arXiv:1603.01547, 2016
3032016
Improved deep learning baselines for ubuntu corpus dialogs
R Kadlec, M Schmid, J Kleindienst
arXiv preprint arXiv:1510.03753, 2015
1142015
Variance reduction in monte carlo counterfactual regret minimization (VR-MCCFR) for extensive form games using baselines
M Schmid, N Burch, M Lanctot, M Moravcik, R Kadlec, M Bowling
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 2157-2164, 2019
452019
Rethinking formal models of partially observable multiagent decision making
V Kovařík, M Schmid, N Burch, M Bowling, V Lisý
Artificial Intelligence, 103645, 2022
352022
Refining subgames in large imperfect information games
M Moravcik, M Schmid, K Ha, M Hladik, S Gaukrodger
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
312016
Revisiting CFR+ and alternating updates
N Burch, M Moravcik, M Schmid
Journal of Artificial Intelligence Research 64, 429-443, 2019
302019
Automatic question generation from natural text
A Kantor, J Kleindienst, M Schmid
US Patent 9,904,675, 2018
232018
Aivat: A new variance reduction technique for agent evaluation in imperfect information games
N Burch, M Schmid, M Moravcik, D Morill, M Bowling
Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018
142018
Bounding the support size in extensive form games with imperfect information
M Schmid, M Moravcik, M Hladik
Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
132014
Low-variance and zero-variance baselines for extensive-form games
T Davis, M Schmid, M Bowling
International Conference on Machine Learning, 2392-2401, 2020
92020
The advantage regret-matching actor-critic
A Gruslys, M Lanctot, R Munos, F Timbers, M Schmid, J Perolat, D Morrill, ...
arXiv preprint arXiv:2008.12234, 2020
82020
Solving common-payoff games with approximate policy iteration
S Sokota, E Lockhart, F Timbers, E Davoodi, R D’Orazio, N Burch, ...
Proceedings of the AAAI Conference on Artificial Intelligence 35 (11), 9695-9703, 2021
72021
Approximate exploitability: Learning a best response in large games
F Timbers, E Lockhart, M Lanctot, M Schmid, J Schrittwieser, T Hubert, ...
arXiv preprint arXiv:2004.09677, 2020
62020
Sound search in imperfect information games
M Sustr, M Schmid, M Moravcik, N Burch, M Lanctot, M Bowling
5*2020
Player of games
M Schmid, M Moravcik, N Burch, R Kadlec, J Davidson, K Waugh, N Bard, ...
arXiv preprint arXiv:2112.03178, 2021
42021
Multiple-point cognitive identity challenge system
DS Anderson, OCW Blodgett, T Durniak, MR Moore, M Schmid
US Patent 10,210,317, 2019
32019
Neural Text Understanding with Attention Sum Reader
R Kadlec, M Schmid, O Bajgar, J Kleindienst
32016
Automatic public state space abstraction in imperfect information games
M Schmid, M Moravcik, M Hladik, SJ Gaukroder
Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015
32015
Game theory and poker
M Schmid
Univerzita Karlova, Matematicko-fyzikální fakulta, 2013
32013
O sistema não pode efectuar a operação agora. Tente novamente mais tarde.
Artigos 1–20