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?
(more…)
October 8, 2015
Immanuel Kant and Probability
Comments Off
June 10, 2015
Maximum a Posteriori Estimation by Search in Probabilistic Programs
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
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…)
Comments Off
May 6, 2015
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…)
Comments Off
October 8, 2013
July 24, 2012
May 25, 2010
Keeping simple is a robust optimization
A good design is approximately optimal. When a reasonable probabilistic model is available, the design can be optimized in expectation: flight delays should be rare, e-mails should arrive within seconds, and buildings should protect from elements and provide comfort on most days of the year. But a single disaster can cause big trouble.