25,161
edits
Changes
Created page with "'''Home * People * Levente Kocsis''' FILE:kocsisl.jpg|border|right|thumb|240px|link=https://dms.sztaki.hu/en/people/levente-kocsis|Levente Kocsis <ref>[ht..."
'''[[Main Page|Home]] * [[People]] * Levente Kocsis'''
[[FILE:kocsisl.jpg|border|right|thumb|240px|link=https://dms.sztaki.hu/en/people/levente-kocsis|Levente Kocsis <ref>[https://dms.sztaki.hu/en/people/levente-kocsis Levente Kocsis | Data Mining and Search Group]</ref> ]]
'''Levente Kocsis''',<br/>
a Hungarian computer scientiest and researcher in Machine [[Learning]] with interests in [[Reinforcement Learning]], [[Games]] like [[Chess]], [[Go]], [[Poker]] and [[Lines of Action]], [[Search]] Control, [[Neural Networks]] and optimization algorithms for combinatorial problems. He defended his Ph.D thesis ''Learning Search Decisions'' <ref>[[Levente Kocsis]] ('''2003'''). ''Learning Search Decisions''. Ph.D thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Kocsis_thesis.pdf pdf]</ref> in 2003 at [[Maastricht University]].
Levente Kocsis is member of the ''Machine Learning Research Group'' of the [https://en.wikipedia.org/wiki/Hungarian_Academy_of_Sciences Hungarian Academy of Sciences].
=UCT=
In 2006, along with [[Csaba Szepesvári]], Levente Kocsis introduced [[UCT]] (Upper Confidence bounds applied to Trees), a new algorithm that applies [https://en.wikipedia.org/wiki/Multi-armed_bandit bandit] ideas to guide [[Monte-Carlo Tree Search|Monte-Carlo planning]] <ref>[[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]''</ref>. UCT accelerated the Monte-Carlo revolution in computer [[Go]] <ref>[[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]</ref> and other domains.
=Photos=
[[FILE:magog_team_smaller.jpg|none|border|text-bottom|640px|link=http://erikvanderwerf.tengen.nl/magog.html]]
The [https://www.game-ai-forum.org/icga-tournaments/program.php?id=137 Magog] team at the [[7th Computer Olympiad#Go9x9|7th Computer Olympiad 2002]]. [[Mark Winands]], [[Levente Kocsis]], [[Erik van der Werf]] <ref>[http://erikvanderwerf.tengen.nl/magog.html MAGOG]</ref>
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database](pdf)</ref>
==2000 ...==
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-45579-5_11 Learning Time Allocation using Neural Networks]''. [[CG 2000]]
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2001'''). ''Search-independent Forward Pruning''. BNAIC 2001
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2001'''). ''Move Ordering using Neural Networks''. IEA/AIE 2001, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 2070
* [[Mark Winands]], [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2002'''). ''Learning in Lines of Action''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]] <ref>[https://dke.maastrichtuniversity.nl/m.winands/publications.html Publications - Maastricht University]</ref>
* [[Mark Winands]], [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2002'''). ''Temporal difference learning and the Neural MoveMap heuristic in the game of Lines of Action''. GAME-ON 2002
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Eric Postma]], [[Jaap van den Herik]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_11 The Neural MoveMap Heuristic in Chess]''. [[CG 2002]]
* [[Levente Kocsis]], [[Jaap van den Herik]], [[Jos Uiterwijk]] ('''2003'''). ''Two Learning Algorithms for Forward Pruning''. [[ICGA Journal#26_3|ICGA Journal, Vol 26, No. 3]]
* [[Levente Kocsis]] ('''2003'''). ''Learning Search Decisions''. Ph.D thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Kocsis_thesis.pdf pdf]
==2005 ...==
* [[Levente Kocsis]], [[Csaba Szepesvári]], [[Mark Winands]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_4 RSPSA: Enhanced Parameter Optimization in Games]''. [[Advances in Computer Games 11]], [http://www.sztaki.hu/~szcsaba/papers/rspsa_acg.pdf pdf]
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://link.springer.com/article/10.1007/s10994-006-6888-8 Universal Parameter Optimisation in Games Based on SPSA]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Special Issue on Machine Learning and Games, Vol. 63, No. 3
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]
* [[Levente Kocsis]], [[Csaba Szepesvári]], [[Jan Willemson]] ('''2006'''). ''Improved Monte-Carlo Search''. [http://www.sztaki.hu/~szcsaba/papers/cg06-ext.pdf pdf]
* [http://www.szit.bme.hu/%7Egya/ András György], [[Levente Kocsis]], I. Szabó, [[Csaba Szepesvári]] ('''2007'''). ''Continuous Time Associative Bandit Problems'' IJCAI-07, 830-835. [http://www.sztaki.hu/%7Eszcsaba/papers/cbandit-ijcai07.pdf pdf]
* [http://en.scientificcommons.org/james_h_brodeur James H. Brodeur], [http://en.scientificcommons.org/benjamin_e_childs Benjamin E. Childs], [[Levente Kocsis]] ('''2008'''). ''Transpositions and Move Groups in Monte Carlo Tree Search.'' [http://eprints.pascal-network.org/archive/00004571/01/8057.pdf pdf]
==2010 ...==
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
=External Links=
* [http://videolectures.net/levente_kocsis/ Levente Kocsis - Computer and Automation research institute, Hungarian Academy of Science - videolectures.net]
* [https://scholar.google.com/citations?user=HQPecC8AAAAJ&hl=en Kocsis Levente - Google Scholar Citations]
* [http://www.computer-go.info/db/operson.php?a=Kocsis%2C+Levente Kocsis, Levente] from [http://www.computer-go.info/ computer-go.info]
* [http://www.chessgames.com/perl/chessplayer?pid=39041 The chess games of Levente Kocsis] from [http://www.chessgames.com/index.html chessgames.com]
=References=
<references />
'''[[People|Up one level]]'''
[[FILE:kocsisl.jpg|border|right|thumb|240px|link=https://dms.sztaki.hu/en/people/levente-kocsis|Levente Kocsis <ref>[https://dms.sztaki.hu/en/people/levente-kocsis Levente Kocsis | Data Mining and Search Group]</ref> ]]
'''Levente Kocsis''',<br/>
a Hungarian computer scientiest and researcher in Machine [[Learning]] with interests in [[Reinforcement Learning]], [[Games]] like [[Chess]], [[Go]], [[Poker]] and [[Lines of Action]], [[Search]] Control, [[Neural Networks]] and optimization algorithms for combinatorial problems. He defended his Ph.D thesis ''Learning Search Decisions'' <ref>[[Levente Kocsis]] ('''2003'''). ''Learning Search Decisions''. Ph.D thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Kocsis_thesis.pdf pdf]</ref> in 2003 at [[Maastricht University]].
Levente Kocsis is member of the ''Machine Learning Research Group'' of the [https://en.wikipedia.org/wiki/Hungarian_Academy_of_Sciences Hungarian Academy of Sciences].
=UCT=
In 2006, along with [[Csaba Szepesvári]], Levente Kocsis introduced [[UCT]] (Upper Confidence bounds applied to Trees), a new algorithm that applies [https://en.wikipedia.org/wiki/Multi-armed_bandit bandit] ideas to guide [[Monte-Carlo Tree Search|Monte-Carlo planning]] <ref>[[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]''</ref>. UCT accelerated the Monte-Carlo revolution in computer [[Go]] <ref>[[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]</ref> and other domains.
=Photos=
[[FILE:magog_team_smaller.jpg|none|border|text-bottom|640px|link=http://erikvanderwerf.tengen.nl/magog.html]]
The [https://www.game-ai-forum.org/icga-tournaments/program.php?id=137 Magog] team at the [[7th Computer Olympiad#Go9x9|7th Computer Olympiad 2002]]. [[Mark Winands]], [[Levente Kocsis]], [[Erik van der Werf]] <ref>[http://erikvanderwerf.tengen.nl/magog.html MAGOG]</ref>
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database](pdf)</ref>
==2000 ...==
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2000'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-45579-5_11 Learning Time Allocation using Neural Networks]''. [[CG 2000]]
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2001'''). ''Search-independent Forward Pruning''. BNAIC 2001
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2001'''). ''Move Ordering using Neural Networks''. IEA/AIE 2001, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science LNCS] 2070
* [[Mark Winands]], [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2002'''). ''Learning in Lines of Action''. [[7th Computer Olympiad#Workshop|7th Computer Olympiad Workshop]] <ref>[https://dke.maastrichtuniversity.nl/m.winands/publications.html Publications - Maastricht University]</ref>
* [[Mark Winands]], [[Levente Kocsis]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''2002'''). ''Temporal difference learning and the Neural MoveMap heuristic in the game of Lines of Action''. GAME-ON 2002
* [[Levente Kocsis]], [[Jos Uiterwijk]], [[Eric Postma]], [[Jaap van den Herik]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_11 The Neural MoveMap Heuristic in Chess]''. [[CG 2002]]
* [[Levente Kocsis]], [[Jaap van den Herik]], [[Jos Uiterwijk]] ('''2003'''). ''Two Learning Algorithms for Forward Pruning''. [[ICGA Journal#26_3|ICGA Journal, Vol 26, No. 3]]
* [[Levente Kocsis]] ('''2003'''). ''Learning Search Decisions''. Ph.D thesis, [[Maastricht University]], [https://project.dke.maastrichtuniversity.nl/games/files/phd/Kocsis_thesis.pdf pdf]
==2005 ...==
* [[Levente Kocsis]], [[Csaba Szepesvári]], [[Mark Winands]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007/11922155_4 RSPSA: Enhanced Parameter Optimization in Games]''. [[Advances in Computer Games 11]], [http://www.sztaki.hu/~szcsaba/papers/rspsa_acg.pdf pdf]
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://link.springer.com/article/10.1007/s10994-006-6888-8 Universal Parameter Optimisation in Games Based on SPSA]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Special Issue on Machine Learning and Games, Vol. 63, No. 3
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]
* [[Levente Kocsis]], [[Csaba Szepesvári]], [[Jan Willemson]] ('''2006'''). ''Improved Monte-Carlo Search''. [http://www.sztaki.hu/~szcsaba/papers/cg06-ext.pdf pdf]
* [http://www.szit.bme.hu/%7Egya/ András György], [[Levente Kocsis]], I. Szabó, [[Csaba Szepesvári]] ('''2007'''). ''Continuous Time Associative Bandit Problems'' IJCAI-07, 830-835. [http://www.sztaki.hu/%7Eszcsaba/papers/cbandit-ijcai07.pdf pdf]
* [http://en.scientificcommons.org/james_h_brodeur James H. Brodeur], [http://en.scientificcommons.org/benjamin_e_childs Benjamin E. Childs], [[Levente Kocsis]] ('''2008'''). ''Transpositions and Move Groups in Monte Carlo Tree Search.'' [http://eprints.pascal-network.org/archive/00004571/01/8057.pdf pdf]
==2010 ...==
* [[Sylvain Gelly]], [[Marc Schoenauer]], [[Michèle Sebag]], [[Olivier Teytaud]], [[Levente Kocsis]], [[David Silver]], [[Csaba Szepesvári]] ('''2012'''). ''[http://dl.acm.org/citation.cfm?id=2093548.2093574 The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions]''. [[ACM#Communications|Communications of the ACM]], Vol. 55, No. 3, [http://www0.cs.ucl.ac.uk/staff/D.Silver/web/Applications_files/grand-challenge.pdf pdf preprint]
=External Links=
* [http://videolectures.net/levente_kocsis/ Levente Kocsis - Computer and Automation research institute, Hungarian Academy of Science - videolectures.net]
* [https://scholar.google.com/citations?user=HQPecC8AAAAJ&hl=en Kocsis Levente - Google Scholar Citations]
* [http://www.computer-go.info/db/operson.php?a=Kocsis%2C+Levente Kocsis, Levente] from [http://www.computer-go.info/ computer-go.info]
* [http://www.chessgames.com/perl/chessplayer?pid=39041 The chess games of Levente Kocsis] from [http://www.chessgames.com/index.html chessgames.com]
=References=
<references />
'''[[People|Up one level]]'''
