Nicht lieferbar
Algorithmic Learning in a Random World (eBook, PDF) - Vovk, Vladimir; Gammerman, Alex; Shafer, Glenn
Schade – dieser Artikel ist leider ausverkauft. Sobald wir wissen, ob und wann der Artikel wieder verfügbar ist, informieren wir Sie an dieser Stelle.
  • Format: PDF

Algorithmic Learning in a Random World describes recent theoretical and experimental developments in building computable approximations to Kolmogorov's algorithmic notion of randomness. Based on these approximations, a new set of machine learning algorithms have been developed that can be used to make predictions and to estimate their confidence and credibility in high-dimensional spaces under the usual assumption that the data are independent and identically distributed (assumption of randomness). Another aim of this unique monograph is to outline some limits of predictions: The approach…mehr

Produktbeschreibung
Algorithmic Learning in a Random World describes recent theoretical and experimental developments in building computable approximations to Kolmogorov's algorithmic notion of randomness. Based on these approximations, a new set of machine learning algorithms have been developed that can be used to make predictions and to estimate their confidence and credibility in high-dimensional spaces under the usual assumption that the data are independent and identically distributed (assumption of randomness). Another aim of this unique monograph is to outline some limits of predictions: The approach based on algorithmic theory of randomness allows for the proof of impossibility of prediction in certain situations. The book describes how several important machine learning problems, such as density estimation in high-dimensional spaces, cannot be solved if the only assumption is randomness.
Autorenporträt
Vladimir Vovk is Professor of Computer Science at Royal Holloway, University of London. His research interests include machine learning and the foundations of probability and statistics. He was one of the founders of prediction with expert advice, an area of machine learning avoiding making any statistical assumptions about the data. Together with Glenn Shafer and with original inspiration from Philip Dawid, he developed game-theoretic foundations for probability and statistics. Alexander Gammerman is Professor of Computer Science and co-Director of the Centre for Reliable Machine Learning at Royal Holloway, University of London. His research interests lie in machine learning and pattern recognition, where the majority of his research books, papers, and grants can be found. He is a Fellow of the Royal Statistical Society and has held visiting and honorary professorships from several universities in Europe and the USA. Glenn Shafer is Professor and former Dean of the Rutgers Business School - Newark and New Brunswick. He is best known for his work in the 1970s and 1980s on the Dempster-Shafer theory, an alternative theory of probability that has been applied widely in engineering and artificial intelligence. Glenn is also known for his initiation, with Vladimir Vovk, of the game-theoretic framework for probability. Their first book on the topic was Probability and Finance: It's Only a Game! A new book on the topic, Game-Theoretic Foundations for Probability and Finance, published in 2019 (Wiley).