Speaker: Alexandre Bouchard-Côté, Assistant Professor at University of British Colombia, Vancouver, Ont., Canada

Many modern statistical questions involve constructing models over trees, orders, networks, and other combinatorial structures. Efficient inference over these models is often hindered by difficult expectations over discrete structures. In this talk, I will describe two methods we have been developing for attacking this problem.

Click to watch the video