Changes

Jump to: navigation, search

Marcus Hutter

464 bytes added, 17:12, 17 January 2019
no edit summary
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''Asymptotically Optimal Agents''. [http://www.informatik.uni-trier.de/~ley/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''Time Consistent Discounting''. [http://www.informatik.uni-trier.de/~ley/db/conf/alt/alt2011.html Algorithmic Learning Theory], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 6925, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2011'''). ''No Free Lunch versus Occam's Razor in Supervised Learning''. [https://en.wikipedia.org/wiki/Ray_Solomonoff Solomonoff] Memorial, [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 7070, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer-Verlag Springer], [https://arxiv.org/abs/1111.3846 arXiv:1111.3846]<ref>[https://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization No free lunch in search and optimization - Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Occam%27s_razor Occam's razor from Wikipedia]</ref>
* [[Joel Veness]], [[Kee Siong Ng]], [[Marcus Hutter]], [[William Uther]] , [[David Silver]] ('''2011'''). ''A Monte-Carlo AIXI Approximation''. [https://en.wikipedia.org/wiki/Journal_of_Artificial_Intelligence_Research JAIR], Vol. 40, [http://www.aaai.org/Papers/JAIR/Vol40/JAIR-4004.pdf pdf]
* [[Tor Lattimore]], [[Marcus Hutter]] ('''2012'''). ''PAC Bounds for Discounted MDPs''. [http://www.informatik.uni-trier.de/~ley/db/conf/alt/alt2012.htm Algorithmic Learning Theory], [https://arxiv.org/abs/1202.3890 arXiv:1202.3890] <ref>[https://en.wikipedia.org/wiki/Markov_decision_process Markov decision process from Wikipedia]</ref>
* [[Tom Everitt]], [[Marcus Hutter]] ('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search''. Australasian Conference on Artificial Intelligence, [https://pdfs.semanticscholar.org/1b4b/c878b2d068214e39b258ee250e5b8889e84c.pdf pdf]
* [[Tom Everitt]], [[Marcus Hutter]] ('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search''. Australasian Conference on Artificial Intelligence
* [[Tom Everitt]], [[Tor Lattimore]], [[Marcus Hutter]] ('''2016'''). ''Free Lunch for Optimisation under the Universal Distribution''. [https://arxiv.org/abs/1608.04544 arXiv:1608.04544]
* [[Marcus Hutter]] ('''2017'''). ''Universal Learning Theory''. [https://link.springer.com/referencework/10.1007%2F978-1-4899-7687-1 Encyclopedia of Machine Learning and Data Mining 2017], [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [https://en.wikipedia.org/wiki/Marcus_Hutter Marcus Hutter from Wikipedia]
* [http://www.hutter1.net/ HomePage of Marcus Hutter]
* [http://prize.hutter1.net/ Hutter Prize]
=References=
<references />
 
'''[[People|Up one level]]'''
[[Category:Researcher|Hutter]]

Navigation menu