Tanya Braun

ε-commutativity allows for scalable probabilistic inference without sacrificing accuracy, even when learned parameters deviate from exact commutativity.

Counting policies instead of agents transforms DecPOMDPs from intractable to efficiently solvable, paving the way for scalable multi-agent systems.

Representing probability distributions with first-order logic formulas can drastically reduce their size, offering a path to more efficient probabilistic reasoning.