Difference between revisions of "István Szita"
GerdIsenberg (talk | contribs) (Created page with "'''Home * People * István Szita''' '''István Szita''',<br/> a Hungarian computer scientist and software engineer at Google Zurich. He holds a Ph.D. fr...") |
GerdIsenberg (talk | contribs) |
||
| Line 2: | Line 2: | ||
'''István Szita''',<br/> | '''István Szita''',<br/> | ||
| − | a Hungarian computer scientist and software engineer at [[Google]] Zurich. He holds a Ph.D. from [https://en.wikipedia.org/wiki/E%C3%B6tv%C3%B6s_Lor%C3%A1nd_University Eötvös Loránd University] on [[Reinforcement Learning|reinforcement learning]] (RL) <ref>[[István Szita]] ('''2007'''). ''Rewarding Excursions: Extending Reinforcement Learning to Complex Domains''. Ph.D. thesis, supervisor | + | a Hungarian computer scientist and software engineer at [[Google]] Zurich. He holds a Ph.D. from [https://en.wikipedia.org/wiki/E%C3%B6tv%C3%B6s_Lor%C3%A1nd_University Eötvös Loránd University] on [[Reinforcement Learning|reinforcement learning]] (RL) <ref>[[István Szita]] ('''2007'''). ''Rewarding Excursions: Extending Reinforcement Learning to Complex Domains''. Ph.D. thesis, supervisor András Lőrincz, [https://en.wikipedia.org/wiki/E%C3%B6tv%C3%B6s_Lor%C3%A1nd_University Eötvös Loránd University]</ref>, and was postdoctoral researcher at [[Maastricht University]], [https://en.wikipedia.org/wiki/Rutgers_University Rutgers University], and the [[University of Alberta]]. Beside RL, his research interests include [[Games|games]], and [https://en.wikipedia.org/wiki/Recurrent_neural_network recurrent neural nets]. |
| − | and was postdoctoral researcher at [[Maastricht University]], | ||
| − | Beside RL, his research interests include [[Games|games]], and [https://en.wikipedia.org/wiki/Recurrent_neural_network recurrent neural nets]. | ||
=Selected Publications= | =Selected Publications= | ||
| − | + | <ref>[https://dblp.uni-trier.de/pers/hd/s/Szita:Istv=aacute=n dblp: István Szita]</ref> | |
==2006 ...== | ==2006 ...== | ||
| − | * [[István Szita]], [http://people.inf.elte.hu/lorincz/ András Lőrincz] ('''2006'''). ''Learning Tetris Using the Noisy Cross-Entropy Method''. Neural Computation 18 | + | * [[István Szita]], [http://people.inf.elte.hu/lorincz/ András Lőrincz] ('''2006'''). ''Learning Tetris Using the Noisy Cross-Entropy Method''. Neural Computation 18 <ref>[https://en.wikipedia.org/wiki/Tetris Tetris from Wikipedia]</ref> |
| − | * [[István Szita]] ('''2007'''). ''Rewarding Excursions: Extending Reinforcement Learning to Complex Domains''. Ph.D. thesis, supervisor | + | * [[István Szita]] ('''2007'''). ''Rewarding Excursions: Extending Reinforcement Learning to Complex Domains''. Ph.D. thesis, supervisor András Lőrincz, [https://en.wikipedia.org/wiki/E%C3%B6tv%C3%B6s_Lor%C3%A1nd_University Eötvös Loránd University] |
* [[Guillaume Chaslot]], [[Sander Bakkes]], [[István Szita]], [[Pieter Spronck]] ('''2008'''). ''Monte-Carlo Tree Search: A New Framework for Game AI''. [http://sander.landofsand.com/publications/AIIDE08_Chaslot.pdf pdf] | * [[Guillaume Chaslot]], [[Sander Bakkes]], [[István Szita]], [[Pieter Spronck]] ('''2008'''). ''Monte-Carlo Tree Search: A New Framework for Game AI''. [http://sander.landofsand.com/publications/AIIDE08_Chaslot.pdf pdf] | ||
| − | * [[Guillaume Chaslot]], [[Mark Winands]], [[István Szita]], [[Jaap van den Herik]]. ('''2008'''). ''Cross-entropy for Monte-Carlo Tree Search''. [[ICGA Journal#31_3|ICGA Journal, Vol. 31, No. 3] | + | * [[Guillaume Chaslot]], [[Mark Winands]], [[István Szita]], [[Jaap van den Herik]]. ('''2008'''). ''Cross-entropy for Monte-Carlo Tree Search''. [[ICGA Journal#31_3|ICGA Journal, Vol. 31, No. 3]] |
| − | * [[István Szita]], [[Marc Ponsen]], [[Pieter Spronck]] ('''2008'''). ''Keeping Adaptive Game AI interesting''. [http://www.cgamesusa.com/08/ CGames 2008 | + | * [[István Szita]], [[Marc Ponsen]], [[Pieter Spronck]] ('''2008'''). ''Keeping Adaptive Game AI interesting''. [http://www.cgamesusa.com/08/ CGames 2008] |
| − | * [[István Szita]], [http://people.inf.elte.hu/lorincz/ András Lőrincz] ('''2008'''). ''The Many Faces of Optimism: a Unifying Approach''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2008.html#SzitaL08 ICML 2008 | + | * [[István Szita]], [http://people.inf.elte.hu/lorincz/ András Lőrincz] ('''2008'''). ''The Many Faces of Optimism: a Unifying Approach''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2008.html#SzitaL08 ICML 2008] <ref>[http://videolectures.net/icml08_szita_mfo/ The Many Faces of Optimism: a Unifying Approach - videolectures.net]</ref> |
| − | * [[István Szita]], [[Guillaume Chaslot]], [[Pieter Spronck]] ('''2009'''). ''Monte-Carlo Tree Search in Settlers of Catan''. [[Advances in Computer Games 12] | + | * [[István Szita]], [[Guillaume Chaslot]], [[Pieter Spronck]] ('''2009'''). ''Monte-Carlo Tree Search in Settlers of Catan''. [[Advances in Computer Games 12]] <ref>[https://en.wikipedia.org/wiki/The_Settlers_of_Catan The Settlers of Catan from Wikipedia]</ref> |
==2010 ...== | ==2010 ...== | ||
* [[István Szita]], [[Csaba Szepesvári]] ('''2010'''). ''Model-based reinforcement learning with nearly tight exploration complexity bounds''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2010.html#SzitaS10 ICML 2010] | * [[István Szita]], [[Csaba Szepesvári]] ('''2010'''). ''Model-based reinforcement learning with nearly tight exploration complexity bounds''. [http://www.informatik.uni-trier.de/~ley/db/conf/icml/icml2010.html#SzitaS10 ICML 2010] | ||
Latest revision as of 14:34, 23 October 2018
István Szita,
a Hungarian computer scientist and software engineer at Google Zurich. He holds a Ph.D. from Eötvös Loránd University on reinforcement learning (RL) [1], and was postdoctoral researcher at Maastricht University, Rutgers University, and the University of Alberta. Beside RL, his research interests include games, and recurrent neural nets.
Selected Publications
2006 ...
- István Szita, András Lőrincz (2006). Learning Tetris Using the Noisy Cross-Entropy Method. Neural Computation 18 [3]
- István Szita (2007). Rewarding Excursions: Extending Reinforcement Learning to Complex Domains. Ph.D. thesis, supervisor András Lőrincz, Eötvös Loránd University
- Guillaume Chaslot, Sander Bakkes, István Szita, Pieter Spronck (2008). Monte-Carlo Tree Search: A New Framework for Game AI. pdf
- Guillaume Chaslot, Mark Winands, István Szita, Jaap van den Herik. (2008). Cross-entropy for Monte-Carlo Tree Search. ICGA Journal, Vol. 31, No. 3
- István Szita, Marc Ponsen, Pieter Spronck (2008). Keeping Adaptive Game AI interesting. CGames 2008
- István Szita, András Lőrincz (2008). The Many Faces of Optimism: a Unifying Approach. ICML 2008 [4]
- István Szita, Guillaume Chaslot, Pieter Spronck (2009). Monte-Carlo Tree Search in Settlers of Catan. Advances in Computer Games 12 [5]
2010 ...
- István Szita, Csaba Szepesvári (2010). Model-based reinforcement learning with nearly tight exploration complexity bounds. ICML 2010
- István Szita, Csaba Szepesvári (2011). Agnostic KWIK learning and efficient approximate reinforcement learning. Journal of Machine Learning Research - Proceedings Track 19
- István Szita (2012). Reinforcement Learning in Games. in Marco Wiering, Martijn Van Otterlo (2012). Reinforcement learning: State-of-the-art. Adaptation, Learning, and Optimization, Vol. 12, Springer
- Thomas J. Walsh, István Szita, Carlos Diuk, Michael L. Littman (2012). Exploring compact reinforcement-learning representations with linear regression. arXiv:1205.2606
External Links
References
- ↑ István Szita (2007). Rewarding Excursions: Extending Reinforcement Learning to Complex Domains. Ph.D. thesis, supervisor András Lőrincz, Eötvös Loránd University
- ↑ dblp: István Szita
- ↑ Tetris from Wikipedia
- ↑ The Many Faces of Optimism: a Unifying Approach - videolectures.net
- ↑ The Settlers of Catan from Wikipedia
