Inductive Graph Layout with Implicit Neural Fields

2026-08-09

AI Summary

This work proposes a novel approach to graph layout by introducing implicit neural fields, departing from traditional methods that rely on explicit coordinate optimization and suffer from high computational complexity and poor generalization to unseen nodes. The method models the mapping from node features to coordinates as a learnable function, enabling efficient fitting of layout energy using only a small set of anchor points. It supports inductive inference, stochastic stress variants, and multi-objective aesthetic optimization, while leveraging a lightweight neural network and low-rank approximation for fast inference. Experiments demonstrate superior performance over PivotMDS, landmark MDS, and kernel ridge regression in layout energy approximation, with the ability to generalize to the entire graph in a single forward pass, substantially reducing computational overhead.

Abstract

A graph layout is normally a table of $N$ free coordinates. We optimise a function with a fixed number of parameters instead. This gives a drawing a sample complexity and an extensible domain. Force-directed algorithms remain the standard tools for graph drawing. The most accurate among them minimise stress in the Kamada-Kawai formulation by directly optimising the node coordinates, at a full objective cost of $O(N^2)$ in time and space. Here, we propose Fling (Field Layout via Implicit Neural Geometry), a small neural network mapping the distances of each node to a set of landmarks, positioning it in the plane by training on the layout energy. The full spring system then becomes tractable without its distance matrix, as rest lengths follow from a landmark bound in constant time per pair while a second network learns the majorisation sums from exact anchor rows, at $O(|\mathcal{A}|N)$ per step for $|\mathcal{A}|\ll N$ anchors. Unlike neural drawers that read the graph by message passing, we represent the drawing as a function of node features. An unseen node costs one forward pass, where sparse and low-rank majorisation remain transductive. As the unknowns are weights rather than coordinates, the energy only requires a small fraction of the nodes, and a field fitted that way outperforms PivotMDS, landmark MDS, and a kernel ridge trained on the same energy and features, when the task is fitting the energy of a graph from a sample of its nodes. In addition, the same parameterisation enables a stochastic pivot stress variant, an aesthetics-optimised variant carrying a neighbour-embedding energy with node-edge clearance and crossing terms on the same field, and conditioning on the weight between two energies gives a whole layout family from one run.

Problem

• graph layout
• inductive representation
• scalability
• out-of-sample generalization
• layout energy

Innovation

• implicit neural fields
• inductive graph layout
• landmark-based embedding
• stress minimization
• neural graph drawing