Independent scholarship · Open accessThe monthly digest

Indexed text attachment

topos-actions-in-machine-learning-and-ai.tex

Source for Topos Actions in Machine Learning and Artificial Intelligence

View paper · Download original file

Lines 307–406 of 1207. Source text is displayed literally.

307is the category of discrete sets with continuous action of the308permutation group of countably many names, equipped with309the topology of pointwise convergence. Continuity of an orbit310map means that an element has a finite support: its stabilizer311contains the subgroup fixing some finite set of names312pointwise. The set of name pairs, for example, has two orbits,313equal and unequal pairs. Such orbit-finite structure permits314a finite orbit description even for machines with infinitely315many individually named inputs. Iwaniack316\cite{iwaniack-automata-toposes} uses the nominal topos as317an instance of topos-enriched automata and derives318Myhill--Nerode results there.319 320Moerman and collaborators \cite{moerman-nominal-learning}321adapt Angluin's query algorithm to nominal automata, including322preliminary experiments with a Haskell implementation.323The teacher answers queries about acceptance and proposes324counterexamples to incorrect hypotheses. Equivariance lets325sets of examples and hypotheses be handled by their orbit326structure. Barb\'e \cite[Thm.~4.26]{barbe-topos-automata}327generalizes this formulation in a research report.328Over an atomic topos with countable coproducts, an329alphabet and target state object each having finitely330many atom components, and an appropriate teacher,331\(\mathrm{TopL}^{*}\) terminates with a minimal automaton.332This conclusion concerns exact learning in the stated333query model. An effective implementation still depends on334the ability to manipulate the orbit or atom presentations335and to supply the teacher. These are meaningful operational336assumptions when trying to infer a structured protocol model337whose states depend on relationships among names.338\par339\section{Sheaf learning and local equivariance}340\label{sec:sheaves}341 342Two established lines of work supply concrete models for343applying topos-action ideas. Spectral sheaf learning builds344features that satisfy incidence constraints. Equivariant345network design builds maps that commute with transports.346Their intersection can be described exactly for invertible347transports on a graph.348 349\subsection{From sheaf Laplacians to learned incidence maps}350 351Hansen and Ghrist develop the spectral theory of cellular352sheaves, including Hodge Laplacians and their relation to353sheaf cohomology \cite{hansen-ghrist-sheaves}. Hansen and354Gebhart use the sheaf Laplacian in graph neural layers355\cite{hansen-gebhart-snn}. Bodnar et al.\ learn the356incidence maps from data, study how sheaf geometry changes357diffusion and oversmoothing, and compare their models on358graphs where adjacent vertices can have different labels \cite{bodnar-nsd}. An earlier direction359in graph learning uses edge-conditioned filters360\cite{simonovsky-ecc}. Edge attributes there determine361message weights. In a sheaf layer, maps from the two362endpoints into a common stalk determine which local363features agree and how disagreement contributes to the364diffusion.365 366For a finite loopless graph $\Gamma$, write $V_v$ for a vertex367stalk and $V_e$ for an edge stalk, with maps368$r_{ev}:V_v\to V_e$ at each incidence. Give the finite369dimensional stalks inner products and orient each edge370$e:u\to v$ for purposes of signs. Set371\[372  (\delta x)_e=r_{ev}x_v-r_{eu}x_u,\qquad373  L=\delta^*\delta .374\]375The Laplacian satisfies376$\langle x,Lx\rangle=\|\delta x\|^2$.377Thus $\ker L=\ker\delta$ is the vector space of global378sections, and $e^{-tL}$ converges to orthogonal projection379onto that space as $t\to\infty$. This last statement is380for the fixed unnormalized operator on a finite graph.381It follows by diagonalizing the positive semidefinite382operator and does not describe an arbitrary learned383nonlinear diffusion trajectory.384 385Suppose each incidence map is invertible. Then the edge386transport from $u$ to $v$ is387$T_e=r_{ev}^{-1}r_{eu}$, and the reverse edge transports388by $T_e^{-1}$. These maps extend to a representation of389the fundamental groupoid of the graph, regarded as a390one-dimensional complex. Indeed, the incidence category has391the vertices and edges as objects and arrows from a vertex to392its incident edges. Localizing by those arrows gives the393fundamental groupoid of the barycentric subdivision. By the394universal property of localization, precisely the diagrams with395invertible incidence maps extend. Restricting to the original396vertices gives the edge transports $T_e$. Global sections correspond to397parallel families $x_v=T_e x_u$. On each connected398component choose a base vertex $b$. Transport of $x_b$399determines the whole family, and it is independent of400the chosen paths precisely when $x_b$ is fixed by every401based loop transport. Hence the global sections on a402connected graph identify with the holonomy-invariant403subspace of $V_b$. The assertion concerns graph paths.404If two-cells are added and their boundary loops are405imposed as relations, their transports must satisfy the406additional flatness conditions.