Indexed text attachment
differential-topology-of-parametrized-neural-networks.tex
Source for Differential Topology of Parametrized Neural Networks
View paper · Download original file
Lines 641–740 of 1074. Source text is displayed literally.
641 642For $g\in S^1$, act on inputs by $z\mapsto gz$ and on643parameters by $p\mapsto g^kp$. The feature $z^k$ transforms644by the character $g\mapsto g^k$, with its real two-dimensional645form in the network. The final expression pairs that feature646with a parameter of the same character, giving647$s(g^kp,gz)=s(p,z)$. At a fixed $p$ the rotations stabilizing648the parameter are the $k$th roots of unity, denoted $\mu_k$.649They act on the entire zero fiber of the classifier.650 651\subsection{Oriented sheets and their transport}652 653Orient the input circle by increasing angle. In the654coordinates $p=e^{i\theta}$ and $z=e^{i\varphi}$, the score655is $\sin(k\varphi-\theta)$, with input derivative656$k\cos(k\varphi-\theta)$. A boundary point is therefore657regular and has positive or negative derivative according658as $z^k=p$ or $z^k=-p$. Write659\[660 B^\pm=\{(p,z):z^k=\pm p\},\qquad661 B=B^+\amalg B^-,662\]663with projection $\pi:B\to P=S^1$.664 665\begin{proposition}[Permutation of boundary points]666\label{prop:circle-boundary-transport}667Each of $B^+$ and $B^-$ is a connected $k$-sheeted668covering of $P$. The positive generator of $\pi_1(P)$669acts on each signed fiber by a $k$-cycle. Neither covering670admits a continuous section.671\end{proposition}672 673\begin{proof}674Projection onto $z$ identifies each component with a circle.675The projection onto $p$ is then $z\mapsto z^k$ on the positive676component and $z\mapsto -z^k$ on the negative one. Over an677angular interval the roots can be written as678\[679 z_j^\pm(\theta)680 =\exp\!\left(i\,\frac{\theta+c_\pm+2\pi j}{k}\right),681 \qquad c_+=0,\quad c_-=\pi,682\]683for $j$ reduced modulo $k$. Increasing $\theta$ by $2\pi$684sends label $j$ to $j+1$. A continuous section would select685a point fixed by this permutation. Equivalently, its map686into the input circle would have a degree which, when687multiplied by $k$, gives $1$, contradicting integral degree.688\end{proof}689 690Pullback along the parameter cover $r(\alpha)=\alpha^k$691trivializes the positive component.692\[693\begin{tikzcd}[column sep=2.1em,row sep=1.7em]694 S^1\times\mu_k \arrow[r,"h"] \arrow[d,"\operatorname{pr}_1"'] &695 B^+ \arrow[d,"\pi"]\\696 S^1 \arrow[r,"r"'] & P697\end{tikzcd}698\]699Here $h(\alpha,\zeta)=(\alpha^k,\alpha\zeta)$. Choosing a700fixed $k$th root of $-1$ gives the corresponding701trivialization for $B^-$. More generally, pullback along702$\alpha\mapsto\alpha^r$ for a positive integer $r$ replaces703the permutation by $j\mapsto j+r$. Its cycles have length704$k/\gcd(k,r)$, and there are $\gcd(k,r)$ of them. Thus the705cover with $r=k$ is the least positive winding cover that706permits a global labeling of all the sheets. In each fiber707the signed count is $k-k=0$. The transport still gives two copies of the cyclic708permutation representation. This persists on a range of709perturbed networks. Suppose a smooth perturbed score710$\widetilde s$ satisfies, for some $0<\eta<1$,711\[712 \|\widetilde s-s\|_\infty<\eta,\qquad713 \|\partial_\varphi(\widetilde s-s)\|_\infty714 < k\sqrt{1-\eta^2}.715\]716At a zero of any linear interpolation between the scores717we have $|s|<\eta$, hence718$|\partial_\varphi s|\geq k\sqrt{1-\eta^2}$.719Thus zero remains regular in the input direction and its720derivative sign is preserved at the interpolated zeros.721The relative zero set is a proper local diffeomorphism722over the cylinder of interpolation times and parameters.723Path lifting along the interpolation identifies the two724signed covers at the ends of the cylinder.725 726\subsection{Persistence over the parameter space}727 728Use the closed sublevels729$F_p(t)=\{z:s(p,z)\leq t\}$. At $t<-1$ the fiber is empty.730At $t=-1$ it consists of the $k$ minima. For $-1<t<1$731it is a disjoint union of $k$ closed arcs, each containing732one minimum. At $t=1$ it becomes the whole circle.733Over a field $\mathbb K$, the degree-zero barcode therefore734has 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 sublevels