Imagine: a web app that sits on a collection of ebooks, shows the user a paragraph from a book, and asks the user whether they want
- get (buy) the whole book to read;
- read another paragraph from this book;
- read a paragraph from a similar book;
- read a paragraph from a different book.
The app can remember user’s past history to adjust suggestions. How paragraphs, similar, and different books are chosen is an interesting question.
For testing/development, free text repositories are available, for example, Project Gutenberg, but also many others.
Comments Off
Paper, slides, and poster as presented at SOCS 2015.
We introduce an approximate search algorithm for fast maximum a posteriori probability estimation in probabilistic programs, which we call Bayesian ascent Monte Carlo (BaMC). (more…)
Comments Off
An early workshop paper, superseded by current research but still relevant, slides, and a poster.
Abstract
We introduce a new approach to solving path-finding problems under uncertainty by representing them as probabilistic models and applying domain-independent inference algorithms to the models. (more…)
Comments Off
Anglican is a probabilistic programming language, or better yet, a concept, living in symbiosis with Clojure. Anglican stands for Church of England (because we are here in Oxford). To create your Turing-complete probabilistic models, clone anglican-user and hack away. Or, look at cool examples.
Read more…
Comments Off
Found my own slides from a talk I gave a year ago, about rational meta-reasoning. Do they seem interesting to me because I have degraded during this year?
Comments Off
We introduce a new algorithm for multi-agent path finding, derived from the idea of meta-agent conflict-based search (MA-CBS). (more…)
Comments Off
My Tea Talk slides, on October 1st, 2014.
Comments Off
A poster for the paper VOI-aware MCTS to appear at ECAI 2012. The paper is a short version of the second part of Selecting Computations: Theory and Application (UAI 2012).
Abstract
(more…)
Comments Off