Independent scholarship · Open accessThe monthly digest

Indexed text attachment

differential-topology-of-parametrized-neural-networks.tex

Source for Differential Topology of Parametrized Neural Networks

View paper · Download original file

Lines 734–833 of 1074. Source text is displayed literally.

734has one copy of $[-1,\infty)$ and $k-1$ copies of $[-1,1)$.735Degree one has one copy of $[1,\infty)$. These statements736follow because inclusions before $1$ preserve the components,737while the inclusion into the circle sends all component738classes to the same class. Each $p$ has the same barcodes.739 740The total sublevels741$\mathcal F(t)=\{(p,z):s(p,z)\leq t\}\to P$, with their742inclusions for increasing $t$, define a diagram of spaces743over $P$. A local lift $\alpha(p)^k=p$ simultaneously744trivializes the diagram by $z=\alpha(p)u$, since the score745becomes $\operatorname{Im}(u^k)$. The transitions rotate746$u$ by elements of $\mu_k$, and transport around the base747permutes the $k$ components for every $-1\le t<1$. Fiberwise748$H_0$ is therefore a local system with permutation module749$\mathbb K[\mu_k]$ in that range. At $t=1$ the structure map750is the augmentation $\mathbb K[\mu_k]\to\mathbb K$, where751$\mathbb K$ carries trivial transport. Its kernel gives752the local system of reduced degree-zero classes that die.753If the characteristic divides $k$, this augmentation has754no equivariant section. An invariant element is a multiple of755the sum of the $k$ basis vectors, whose augmentation is zero.756This extension is invisible in the barcode of each fiber,757where the augmentation is a surjective map of vector spaces.758Over $\mathbb C$, let $\omega=e^{2\pi i/k}$, with $e_j$ the759component basis of $H_0$. The character vector760$\sum_j\omega^{-\ell j}e_j$ acquires the factor761$\omega^\ell$ under monodromy. The trivial character survives762the merge at $1$ and each nontrivial character dies there.763The $k-1$ numerically equal finite bars consequently carry764distinct transport characters.765 766For parameters $p,q$, the chord distance $\delta=|p-q|$767bounds the uniform score change, since768\[769 |s(p,z)-s(q,z)|770 \leq |\overline p-\overline q|\,|z^k|=\delta.771\]772Thus $F_p(t)\subseteq F_q(t+\delta)$ and773$F_q(t)\subseteq F_p(t+\delta)$. The successive inclusion774maps are exactly the shift by $2\delta$, giving a775$\delta$-interleaving both before and after taking homology.776The same proof applies to any uniform score perturbation.777For q-tame persistent homology the stability theorems bound778the bottleneck distance by that uniform change779\cite{chazal-persistence,cohen-steiner-stability}.780In this rotation family the distance between fiber barcodes781is zero. The sublevel diagram over $P$ additionally records782which components are identified by going around a loop.783For example, the constant family of scores784$s_0(p,z)=\operatorname{Im}(z^k)$ has the same barcode at785every parameter. Its component local system is trivial,786whereas the generator of the parameter loop acts on the787components for $s$ by the nonidentity permutation.788The two filtered diagrams therefore cannot be equivalent789over $P$. For two general scores on the same parameter790and input spaces, a uniform bound on their difference791also gives the shifted inclusions of the \emph{total}792sublevels over $P$. This makes the sublevel diagram over793the parameter space a stable comparison object while794still retaining the representation.795\par796\section{Reconstruction through a Euclidean latent space}797\label{sec:reconstruction}798 799Let \(X\) be a nonempty compact smooth manifold without boundary,800and fix an embedding \(i:X\hookrightarrow\mathbb R^D\).801An encoder \(e:X\to\mathbb R^m\) and ambient decoder802\(d:\mathbb R^m\to\mathbb R^D\) realize the reconstruction803\(x\mapsto d(e(x))\). Here the latent width \(m\) is the dimension804of the intermediate Euclidean space. The encoder and decoder may be805evaluation maps of neural architectures at selected parameters.806We first allow arbitrary smooth maps to isolate the topological807constraints on any such architecture. This applies the tube and808factorization constructions of \cite[Chs.~8, 24, 27]{higher-hirsch}.809For related effects of data topology on autoencoding, see810\cite{batson-autoencoders}.811 812\subsection{Exact recovery and smooth families}813 814\begin{theorem}[Smooth ambient reconstruction]815\label{thm:ambient-reconstruction}816A smooth encoder \(e:X\to\mathbb R^m\) admits a smooth817ambient decoder on all of \(\mathbb R^m\) satisfying818\(d\circ e=i\) if and only if \(e\) is a smooth embedding.819Moreover \(e\) extends to a smooth encoder on all of820\(\mathbb R^D\) agreeing with it along \(i(X)\).821\end{theorem}822 823\begin{proof}824If \(d\circ e=i\), injectivity of \(i\) forces injectivity of \(e\).825Differentiating gives \(D_x i=D_{e(x)}d\,D_x e\), so \(D_xe\)826is injective. The compact-to-Hausdorff criterion makes \(e\) a827homeomorphism onto its image. That and immersion give an embedding.828 829Conversely let \(U\subset\mathbb R^m\) be a tubular neighborhood830of \(e(X)\) with smooth retraction \(\pi:U\to e(X)\). On \(U\) the831map \(d_0=i\circ e^{-1}\circ\pi\) satisfies \(d_0\circ e=i\).832Choose a smooth bump \(\chi\) equal to one near \(e(X)\) and with833compact support in \(U\). Set \(d=\chi d_0\) on \(U\) and \(d=0\)