Title
On the Applicability of Probabilistic Programming Languages for Causal Activity Recognition
Abstract
Recognizing causal activities of human protagonists, and jointly inferring context information like location of objects and agents from noisy sensor data is a challenging task. Causal models can be used, which describe the activity structure symbolically, e.g. by precondition-effect actions. Recently, probabilistic programming languages (PPLs) arose as an abstraction mechanism that allow to concisely define probabilistic models by a general-purpose programming language, and provide off-the-shelf, general-purpose inference algorithms. In this paper, we empirically investigate whether PPLs provide a feasible alternative for implementing causal models for human activity recognition, by comparing the performance of three different PPLs (Anglican, WebPPL and Figaro) on a multi-agent scenario. We find that PPLs allow to concisely express causal models, but general-purpose inference algorithms that are typically implemented in PPLs are outperformed by an application-specific inference algorithm by orders of magnitude. Still, PPLs can be a valuable tool for developing probabilistic models, due to their expressiveness and simple applicability.
Year
DOI
Venue
2019
10.1007/s13218-019-00580-7
KI - Künstliche Intelligenz
Keywords
Field
DocType
Bayesian filtering, Causal model, Probabilistic programming language, Anglican, WebPPL, Figaro, Particle filter
Programming language,Activity recognition,Abstraction,Computer science,Inference,Particle filter,Probabilistic programming language,Artificial intelligence,Probabilistic logic,Machine learning,Causal model,Expressivity
Journal
Volume
Issue
ISSN
33
4
0933-1875
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Stefan Lüdtke135.15
Maximilian Popko200.34
Thomas Kirste39318.37