The motivation comes from a well-known blind spot in graph neural networks. These architectures, along with classical spectral embedding methods, build their representations by aggregating local neighborhood information, layer by layer or eigenvector by eigenvector. That strategy works well when the properties that matter are themselves local, such as the content similarity of connected documents. But it systematically misses global metric properties: how quickly the volume of a space grows with distance, whether the space is hyperbolic in the sense of Gromov, and what the boundary at infinity looks like. Those coarse-geometric signatures are precisely what distinguish a grid from a tree, or a flat lattice from a negatively curved hierarchical network, even when the two graphs are indistinguishable at the level of small neighborhoods.

Enakoutsa’s framework formalizes this intuition with three mathematical guarantees. First, the learned representations are stable under quasi-isometries: if two metric spaces are coarsely equivalent, meaning one can be mapped onto the other with bounded distortion, their distance-based feature representations remain correspondingly close. This is the property that makes the features genuinely geometric rather than artifacts of a particular graph labeling. Second, the framework satisfies a universal approximation property for the distance-generated algebra on compact metric spaces, meaning that with enough anchors and appropriate nonlinearities, the model can approximate any continuous function in that algebra arbitrarily well. Third, the method extends naturally to the boundary at infinity of Gromov-hyperbolic spaces, the idealized boundary points that encode how geodesics diverge, which is where the hierarchical structure of many real networks actually lives.

The parametric model works as follows. A set of anchor points is chosen in the metric space, and each data point is described not by its adjacency relations but by the vector of its distances to those anchors. These distances are then passed through nonlinear activations with learnable scales, so that the entire feature map is differentiable and the anchors themselves can be trained by gradient descent. The result is what the author calls a nonlinear feature algebra: a family of functions generated by distance measurements, closed under the nonlinear transformations the network applies. Because distance to an anchor is a global quantity, every feature already carries information about the position of a point relative to the whole space, not just its immediate surroundings.

The experimental test was designed to isolate exactly the capability that local methods lack. Enakoutsa constructed pairs of graphs that share low-order local structure but differ in their coarse geometry, such as grid graphs and tree graphs. Locally, both look like ordinary networks; globally, a grid is flat and grows quadratically while a tree is hyperbolic and grows exponentially. A tanh-activated distance representation achieved a mean accuracy of 77.8 percent, with a standard deviation of 5.8 percent, in separating grid from tree topology across ten runs. The local and spectral baselines managed only 48.7 plus or minus 5.9 percent and 45.5 plus or minus 5.1 percent respectively, essentially chance performance, and the difference was highly significant with a paired t-test yielding p less than ten to the minus five.

The activation function turned out to matter enormously. When the saturating tanh nonlinearity was replaced with a non-saturating ReLU, performance on the same grid-versus-tree task jumped to 99.9 plus or minus 0.4 percent, near-perfect separation. The same ReLU-activated representation also achieved 96.2 plus or minus 2.4 percent accuracy in distinguishing a grid from a Barabási-Albert scale-free graph, another pair whose members differ dramatically in growth rate and curvature. The contrast between the two activations suggests that the saturating behavior of tanh compresses exactly the long-range distance information the method depends on, while the unbounded ReLU preserves the dynamic range needed to encode global geometry.

On real-world networks, however, the picture became more nuanced, and the author is careful to report this scope dependence rather than overclaim. The distance-based representation outperformed spectral embedding on the Zachary karate club network and on the Les Misérables co-occurrence network, both small graphs whose structure is strongly shaped by community and hierarchy. But on the Cora and PubMed citation networks, which reach up to roughly 20,000 nodes, spectral embedding won. The reason, according to the paper, is that the labels in those citation datasets track content homophily, the tendency of papers to cite similar papers, rather than coarse geometry. When the signal in the data is local and content-driven, local aggregation remains the right tool; when the signal is global and metric, the distance-based approach dominates.

This honest boundary of applicability may prove as informative as the headline results. The work does not claim that distance features should replace message passing everywhere. Instead, it identifies a class of problems, those governed by growth rate, hyperbolicity, and boundary structure, where local methods are provably and empirically inadequate, and supplies a principled alternative with mathematical guarantees. The connection to coarse geometry also gives the field a vocabulary it has lacked: quasi-isometry invariance is a much weaker and more robust equivalence than graph isomorphism, and methods that respect it should generalize across graphs that look different locally but share the same large-scale shape.

The implications reach into several active areas of machine learning. Hyperbolic embeddings have become popular for hierarchical data such as knowledge graphs, taxonomies, and biological phylogenies, precisely because negatively curved spaces can embed tree-like structure with low distortion. The new framework offers a way to detect and exploit that hyperbolicity directly from distances, rather than committing to a particular embedding space in advance. It also connects to geometric deep learning, the broad research program aiming to build neural architectures whose inductive biases respect the symmetries and structure of the underlying data domain, and to the theory of neural and nonlocal operators, both listed among the paper’s keywords.

Published open access under a Creative Commons Attribution 4.0 license and released as a citable version of record with a permanent DOI, the paper arrives from an unexpected direction: a mathematics department rather than a computer science lab, and without external funding. That provenance is fitting for a contribution whose main strength is conceptual. By grounding representation learning in the mathematics of large-scale metric structure, the work suggests that the next advance in how machines understand networks may come not from deeper stacks of local message passing, but from teaching them to measure distances and read the shape of the whole space at once. Whether the approach can be scaled efficiently to graphs with millions of nodes, and whether hybrid architectures can combine local content signals with global geometric ones, are the natural next questions for this emerging line of research.

Subject of Research: Distance-based representation learning for graphs using nonlinear functions of distances to learnable anchor points, grounded in coarse geometry

Article Title: Distance-Based Representation Learning with Nonlinear Feature Algebras

Article References: Enakoutsa, K. (2026). Distance-Based Representation Learning with Nonlinear Feature Algebras. Neural Processing Letters. https://doi.org/10.1007/s11063-026-11882-x

Image Credits: AI Generated

DOI: 10.1007/s11063-026-11882-x

Keywords: geometric deep learning, coarse geometry, representation learning, graph neural networks, hyperbolic geometry, universal approximation, spectral embedding, metric spaces, quasi-isometry, networks, machine learning, Gromov-hyperbolic spaces