Conditional Permutation Invariant Flows

We present a conditional generative probabilistic model of set-valued data with a tractable log density. This model is a continuous normalizing flow governed by permutation equivariant dynamics. These dynamics are driven by a learnable per-set-element term and pairwise interactions, both parametrized by deep neural networks. We illustrate the utility of this model via applications including (1) complex traffic scene generation conditioned on visually specified map information, and (2) object bounding box generation conditioned directly on images. We train our model by maximizing the expected likelihood of labeled conditional data under our flow, with the aid of a penalty that ensures the dynamics are smooth and hence efficiently solvable. Our method significantly outperforms non-permutation invariant baselines in terms of log likelihood and domain-specific metrics (offroad, collision, and combined infractions), yielding realistic samples that are difficult to distinguish from data.

Authors

• Berend Zwartsenberg InvertedAI
• Adam Scibior
• Matthew Niedoba
• Vasileios Lioutas
• Justice Sefas
• Yunpeng Liu
• Setareh Dabiri
• Jonathan Wilder Lavington
• Trevor Campbell
• Frank Wood University of British Columbia Amii InvertedAI

Keywords

No keywords are indexed for this paper.