Autoregressive graph generation is powerful but slow. Our recent work reduces its complexity from O(V^2) to O((E+V) log V), with sublinear mem cost and training parallelism.
Paper: arxiv.org/abs/2006.15502
Code: github.com/google-researc…
w/ @Azade_na @liyuajia @daibond_alpha Dale
GIF














