http://anglican.ml/, the proper domain for the **Anglican** way of **m**achine **l**earning. Also http://probprog.ml/.

## October 7, 2016

### anglican.ml

## October 8, 2015

### Immanuel Kant and Probability

Kant said: there are two *a priori* intuitions — space and time. There are also categories, and “the number of the categories in each class is always the same, namely, three”, like unity-plurality-modality, or possibility-existence-necessity. It would be fun to have three *a priori* intuitions, but only two exist, sigh. Really though?

Kant probably did not realize: there is a third one — probability, to wit, certainty of our experience. Just like space, probability precedes any experience. Every object is uncertain as much as it is extended.

The three *a priori* intuitions are related — infinite and undirected space, infinite and directed time, finite and undirected probability. Physics knows of *uncertainty principle*, we are uncertain about relation of time and space: both time and space cannot be intuited with certainty. Probability is as basic and fundamental as time and space for our cognition.

Just like geometry deals with *a priori* intuition of space, and mathematical analysis — with intuition of time, theory of probability deals with intuition of probability. There is philosophical justification for studying uncertainty, probability, and bayesian inference.

## June 10, 2015

### Maximum a Posteriori Estimation by Search in Probabilistic Programs

## June 8, 2015

### Path Finding under Uncertainty through Probabilistic Inference

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…)

## May 6, 2015

### Anglican the Probabilistic Programming Concept

## December 10, 2014

### Output-Sensitive Adaptive MH for Probabilistic Programs

A poster for the 3rd NIPS Workshop on Probabilistic Programming; also available as A0 PDF. Slides for a 15-minute talk.

#### Abstract

## November 19, 2014

### Merge-and-Restart Meta-Agent Conflict-Based Search

for Multi-agent Path Finding

We introduce a new algorithm for multi-agent path finding, derived from the idea of meta-agent conflict-based search (MA-CBS). (more…)