liveBook · Manning

Virtual edge

As explained in Sutskever's List

A virtual edge is an artificial graph connection that links otherwise unconnected nodes to provide a learned long-range communication path.

When a graph is sparse, information between distant nodes may take many message-passing rounds to travel. A virtual edge adds an artificial connection between otherwise unconnected nodes, creating a long-range route for messages without treating it as a true physical edge. section 7.3.2

A shortcut between atoms

In a molecule, two atoms that are not bonded can still exchange messages through a specialized virtual channel. Like hallways between distant rooms, these connections provide shortcuts across nodes; residual connections instead provide shortcuts across network layers. The model can learn whether to use or ignore virtual edges. section 7.3.2

How Sutskever's List covers it

How deep it goes
Defines artificial connections and explains their message-passing benefit, but gives no implementation details.
Examples
Uses nonbonded atoms in a molecule and contrasts shortcuts across nodes with shortcuts across layers.
What you can do after
Understand how artificial graph connections enable long-range message passing in fewer steps.
How it connects
Connects message passing neural networks with skip connections and master nodes.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.