CayleyPy-4: AI-Holography. Towards analogs of holographic string dualities for AI tasks

TL;DR

This paper explores a novel discrete holographic duality for AI tasks on Cayley graphs, proposing that such dualities can lead to more efficient computational methods and new data embedding techniques.

Contribution

It introduces a new discrete holographic duality framework for Cayley graphs in AI, linking graph properties to string-like dual objects, and provides initial evidence and datasets for further validation.

Findings

Dual descriptions of Cayley graphs as discrete strings.

Vertices mapped to paths inside polygons with graph distances related to area.

Evidence of continuous CFTs and dual strings in large n limit.

Abstract

This is the fourth paper in the CayleyPy project, which applies AI methods to the exploration of large graphs. In this work, we suggest the existence of a new discrete version of holographic string dualities for this setup, and discuss their relevance to AI systems and mathematics. Many modern AI tasks -- such as those addressed by GPT-style language models or RL systems -- can be viewed as direct analogues of predicting particle trajectories on graphs. We investigate this problem for a large family of Cayley graphs, for which we show that surprisingly it admits a dual description in terms of discrete strings. We hypothesize that such dualities may extend to a range of AI systems where they can lead to more efficient computational approaches. In particular, string holographic images of states are proposed as natural candidates for data embeddings, motivated by the "complexity = volume" principle in AdS/CFT. For Cayley graphs of the symmetric group S_n, our results indicate that the corresponding dual objects are flat, planar polygons. The diameter of the graph is equal to the number of integer points inside the polygon scaled by n. Vertices of the graph can be mapped holographically to paths inside the polygon, and the usual graph distances correspond to the area under the paths, thus directly realising the "complexity = volume" paradigm. We also find evidence for continuous CFTs and dual strings in the large n limit. We confirm this picture and other aspects of the duality in a large initial set of examples. We also present new datasets (obtained by a combination of ML and conventional tools) which should be instrumental in establishing the duality for more general cases.