Header logo is


Thumb xl img02
Probabilistic Duality for Parallel Gibbs Sampling without Graph Coloring

Mescheder, L., Nowozin, S., Geiger, A.

Arxiv, 2016 (article)

We present a new notion of probabilistic duality for random variables involving mixture distributions. Using this notion, we show how to implement a highly-parallelizable Gibbs sampler for weakly coupled discrete pairwise graphical models with strictly positive factors that requires almost no preprocessing and is easy to implement. Moreover, we show how our method can be combined with blocking to improve mixing. Even though our method leads to inferior mixing times compared to a sequential Gibbs sampler, we argue that our method is still very useful for large dynamic networks, where factors are added and removed on a continuous basis, as it is hard to maintain a graph coloring in this setup. Similarly, our method is useful for parallelizing Gibbs sampling in graphical models that do not allow for graph colorings with a small number of colors such as densely connected graphs.


pdf [BibTex]

no image
One for all?! Simultaneous examination of load-inducing factors for advancing media-related instructional research

Wirzberger, M., Beege, M., Schneider, S., Nebel, S., Rey, G. D.

Computers {\&} Education, 100, pages: 18-31, Elsevier BV, 2016 (article)

In multimedia learning settings, limitations in learners' mental resource capacities need to be considered to avoid impairing effects on learning performance. Based on the prominent and often quoted Cognitive Load Theory, this study investigates the potential of a single experimental approach to provide simultaneous and separate measures for the postulated load-inducing factors. Applying a basal letter-learning task related to the process of working memory updating, intrinsic cognitive load (by varying task complexity), extraneous cognitive load (via inducing split-attention demands) and germane cognitive load (by varying the presence of schemata) were manipulated within a 3 × 2 × 2-factorial full repeated-measures design. The performance of a student sample (N = 96) was inspected regarding reaction times and errors in updating and recall steps. Approaching the results with linear mixed models, the effect of complexity gained substantial strength, whereas the other factors received at least partial significant support. Additionally, interactions between two or all load-inducing factors occurred. Despite various open questions, the study comprises a promising step for the empirical investigation of existing construction yards in cognitive load research.


DOI [BibTex]

DOI [BibTex]

Thumb xl pami
Map-Based Probabilistic Visual Self-Localization

Brubaker, M. A., Geiger, A., Urtasun, R.

IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI), 2016 (article)

Accurate and efficient self-localization is a critical problem for autonomous systems. This paper describes an affordable solution to vehicle self-localization which uses odometry computed from two video cameras and road maps as the sole inputs. The core of the method is a probabilistic model for which an efficient approximate inference algorithm is derived. The inference algorithm is able to utilize distributed computation in order to meet the real-time requirements of autonomous systems in some instances. Because of the probabilistic nature of the model the method is capable of coping with various sources of uncertainty including noise in the visual odometry and inherent ambiguities in the map (e.g., in a Manhattan world). By exploiting freely available, community developed maps and visual odometry measurements, the proposed method is able to localize a vehicle to 4m on average after 52 seconds of driving on maps which contain more than 2,150km of drivable roads.

avg ps

pdf Project Page [BibTex]

pdf Project Page [BibTex]