Difference between revisions of "Kristian Kersting"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 32: Line 32:
 
* [https://scholar.google.com/citations?user=f9iP-80AAAAJ&hl=en Christian Bauckhage], [[Kristian Kersting]] ('''2013'''). ''Efficient Information Theoretic Clustering on Discrete Lattices''. [https://arxiv.org/abs/1310.7114 arXiv:1310.7114]
 
* [https://scholar.google.com/citations?user=f9iP-80AAAAJ&hl=en Christian Bauckhage], [[Kristian Kersting]] ('''2013'''). ''Efficient Information Theoretic Clustering on Discrete Lattices''. [https://arxiv.org/abs/1310.7114 arXiv:1310.7114]
 
* [https://scholar.google.com/citations?user=f9iP-80AAAAJ&hl=en Christian Bauckhage], [[Kristian Kersting]], [https://scholar.google.de/citations?user=WDHoQtYAAAAJ&hl=en Christian Thurau] ('''2014'''). ''[http://publica.fraunhofer.de/dokumente/N-351724.html Künstliche Intelligenz für Computerspiele - Historische Entwicklung und aktuelle Trends]''. [https://de.wikipedia.org/wiki/Informatik_Spektrum Informatik Spektrum], Vol. 37, No. 6 (German)
 
* [https://scholar.google.com/citations?user=f9iP-80AAAAJ&hl=en Christian Bauckhage], [[Kristian Kersting]], [https://scholar.google.de/citations?user=WDHoQtYAAAAJ&hl=en Christian Thurau] ('''2014'''). ''[http://publica.fraunhofer.de/dokumente/N-351724.html Künstliche Intelligenz für Computerspiele - Historische Entwicklung und aktuelle Trends]''. [https://de.wikipedia.org/wiki/Informatik_Spektrum Informatik Spektrum], Vol. 37, No. 6 (German)
 +
* [[Mathematician#LDRaedt|Luc De Raedt]], [[Kristian Kersting]], [[Mathematician#SNatarajan|Sriraam Natarajan]], [[Mathematician#DPoole|David Poole]] ('''2016'''). ''[https://www.morganclaypool.com/doi/10.2200/S00692ED1V01Y201601AIM032 Statistical Relational Artificial Intelligence: Logic, Probability, and Computation]''.  Synthesis Lectures on Artificial Intelligence and Machine Learning, [https://www.morganclaypool.com/ Morgan & Claypool Publishers]
 
* [[Kristian Kersting]] ('''2018'''). ''[https://link.springer.com/article/10.1007/s13218-018-0562-8 Making AI Smarter]''. [https://www.springer.com/journal/13218 Künstliche Intelligenz], Vol. 32, No. 4
 
* [[Kristian Kersting]] ('''2018'''). ''[https://link.springer.com/article/10.1007/s13218-018-0562-8 Making AI Smarter]''. [https://www.springer.com/journal/13218 Künstliche Intelligenz], Vol. 32, No. 4
 
* [[Kristian Kersting]] ('''2018'''). ''[https://www.frontiersin.org/articles/10.3389/fdata.2018.00006/full Machine Learning and Artificial Intelligence: Two Fellow Travelers on the Quest for Intelligent Behavior in Machines]''. [https://www.frontiersin.org/journals/big-data# Frontiers in Big Data]
 
* [[Kristian Kersting]] ('''2018'''). ''[https://www.frontiersin.org/articles/10.3389/fdata.2018.00006/full Machine Learning and Artificial Intelligence: Two Fellow Travelers on the Quest for Intelligent Behavior in Machines]''. [https://www.frontiersin.org/journals/big-data# Frontiers in Big Data]

Latest revision as of 22:35, 23 May 2021

Home * People * Kristian Kersting

Kristian Kersting [1]

Kristian Kersting,
a German computer scientist and professor at Computer Science Department, TU Darmstadt and head of its Artificial Intelligence and Machine Learning (AIML) lab [1]. He received his Ph.D. from University of Freiburg on inductive logic programming in 2006 under advisor Luc De Raedt, and had appointments at MIT, Fraunhofer IAIS, University of Bonn, and TU Dortmund. His main research interests are in statistical relational learning and artificial intelligence, and deep learning.

CrazyAra

Along with Johannes Fürnkranz at TU Darmstadt, Kristian Kersting led the Deep Learning: Methods and Architectures course in 2018, and supported his students Johannes Czech, Moritz Willig and Alena Beyer in developing the deep learning chess variant engine CrazyAra, which won a five game Crazyhouse online-match versus Justin Tan aka JannLee with 4-1 [2] [3]. Subsequently, he worked with his students Johannes Czech and Patrick Korus on an improvement of AlphaZero's MCTS / PUCT algorithm considering transpositions, optionally applied in CrazyAra. The proposed Monte-Carlo Graph Search uses a directed acyclic graph (DAG) rather than a tree structure [4].

Selected Publications

[5] [6]

2000 ...

2010 ...

2020 ...

External Links

References

Up one level