Embedded Graph Flows for Categorical Graph Generation
Researchers propose Embedded Graph Flows, a generative model with learned categorical embeddings that beats DiGress and GruM on molecular graph benchmarks.
1 stories, newest first · one card per story
Researchers propose Embedded Graph Flows, a generative model with learned categorical embeddings that beats DiGress and GruM on molecular graph benchmarks.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views