Graph Conditional Variational Models: Too Complex for Multiagent Trajectories?
Research output: Journal contributions › Conference article in journal › Research › peer-review
Authors
Recent advances in modeling multiagent trajectories combine graph architectures such as graph neural networks (GNNs) with conditional variational models (CVMs) such as variational RNNs (VRNNs). Originally, CVMs have been proposed to facilitate learning with multi-modal and structured data and thus seem to perfectly match the requirements of multi-modal multiagent trajectories with their structured output spaces. Empirical results of VRNNs on trajectory data support this assumption. In this paper, we revisit experiments and proposed architectures with additional rigour, ablation runs and baselines. In contrast to common belief, we show that prior results with CVMs on trajectory data might be misleading. Given a neural network with a graph architecture and/or structured output function, variational autoencoding does not seem to contribute statistically significantly to empirical performance. Instead, we show that well-known emission functions do contribute, while coming with less complexity, engineering and computation time.
Original language | English |
---|---|
Journal | Proceedings of Machine Learning Research |
Volume | 137 |
Pages (from-to) | 136-147 |
Number of pages | 12 |
ISSN | 2640-3498 |
Publication status | Published - 2020 |
Event | 34rd Conference on Neural Information Processing Systems - NeurIPS 2020: Neural Information Processing Systems Online Conference 2020 - digital Duration: 06.12.2020 → 12.12.2020 Conference number: 34 https://neurips.cc/virtual/2020/public/index.html https://proceedings.mlr.press/v137/ |
Bibliographical note
Publisher Copyright:
© Proceedings of Machine Learning Research 2020.
- Informatics
- Business informatics