Indexed text attachment
representation-theory-of-parametrized-neural-models-on-spaces.tex
Source for Representation Theory of Parametrized Neural Models on Spaces
View paper · Download original file
Lines 43–142 of 1343. Source text is displayed literally.
43\titleformat{\subsection}{\normalsize\bfseries\raggedright}44 {\color{paperaccent}\thesubsection}{.55em}{}45\titlespacing*{\subsection}{0pt}{10pt plus 2pt minus 1pt}{4pt}46\captionsetup{font=small,labelfont={bf,color=paperaccent}}47 48\pagestyle{fancy}49\fancyhf{}50\fancyhead[L]{\footnotesize\sffamily\color{papermuted}Parametrized neural models on spaces}51\fancyfoot[R]{\footnotesize\sffamily\color{papermuted}\thepage}52\renewcommand{\headrulewidth}{0pt}53\fancypagestyle{plain}{%54 \fancyhf{}%55 \fancyfoot[R]{\footnotesize\sffamily\color{papermuted}\thepage}%56 \renewcommand{\headrulewidth}{0pt}%57}58 59\theoremstyle{plain}60\newtheorem{theorem}{Theorem}[section]61\newtheorem{proposition}[theorem]{Proposition}62\newtheorem{lemma}[theorem]{Lemma}63\newtheorem{corollary}[theorem]{Corollary}64\theoremstyle{definition}65\newtheorem{definition}[theorem]{Definition}66\newtheorem{example}[theorem]{Example}67\theoremstyle{remark}68\newtheorem{remark}[theorem]{Remark}69\DeclareMathOperator{\Map}{Map}70\DeclareMathOperator{\Tot}{Tot}71\DeclareMathOperator{\Fun}{Fun}72\DeclareMathOperator{\Hom}{Hom}73\DeclareMathOperator{\grad}{grad}74\DeclareMathOperator{\Ext}{Ext}75\DeclareMathOperator{\Res}{Res}76\DeclareMathOperator{\Kl}{Kl}77\DeclareMathOperator{\id}{id}78\DeclareMathOperator{\rank}{rank}79\newcommand{\E}{\mathcal E}80\newcommand{\Spc}{\mathcal S}81\newcommand{\R}{\mathbb R}82\newcommand{\C}{\mathbb C}83\newcommand{\Z}{\mathbb Z}84\newcommand{\overB}{\E_{/B}}85\tikzcdset{every label/.append style={font=\small}}86\begin{document}87\twocolumn[88\begin{@twocolumnfalse}89\noindent\textcolor{paperaccent}{\rule{\textwidth}{1pt}}\par90\vspace{11pt}91{\noindent\fontsize{25}{30}\selectfont\bfseries92Representation Theory of Parametrized\\93Neural Models on Spaces\par}94\vspace{8pt}95{\noindent\large\color{papermuted}96Statistical families, equivariant layers, and homotopy-coherent models\par}97\vspace{10pt}98{\noindent\small November 2026\par}99\vspace{9pt}100\noindent\begin{minipage}{\textwidth}\small101\textbf{Abstract.}102A parametrized network over a space is a family of evaluation maps.103We represent its realizations and reparametrizations by a slice over an104internal mapping object, prove base change and descent, and extend the105construction to stochastic outputs for a strong probability monad.106On smooth charts this gives deterministic manifold networks and107conditional statistical models, together with pullback Fisher geometry.108For compact symmetries we classify bounded layers linear in a moving109parameter by multiplicity-space intertwiners. The classification exhibits110frequency shifts that cannot occur for a fixed equivariant layer.111For parameters with local symmetries we retain stabilizers and transition112data in a quotient stack. A neural decoder on a twisted real line illustrates why113global probability laws can lack a global smooth weight. Mapping spectra114supply a stable version of equivariance with higher intertwiners.115\par\medskip116\noindent\textbf{Keywords.}\enspace117Parametrized networks, representation theory, equivariance, Fisher information,118descent, quotient stacks.119\end{minipage}120\vspace{17pt}121\end{@twocolumnfalse}122]123\thispagestyle{plain}124 125\section{From statistical families to representations}126 127A supervised model commonly starts with a parameter manifold $P$, a128feature space $X$, and a map $f(p,x)$ valued in labels, predictions, or129probability distributions. A convolutional network has additional130structure. Features may live in bundles on an observation space, and a131symmetry can transport both features and weights. Two local weights can132also present the same model via a change of frame. These cases require133tracking evaluation, transport, and equivalences of presentations.134 135\emph{Representation Theory in Higher Categories} develops ordinary136and coherent group actions,137induced feature spaces, and equivariant convolutions138\cite[Chs.~17, 20, 27--28]{reprbook}. We start with its idea of encoding139actions by functors and relate evaluation, symmetry, and descent.140Evaluation records what a parameter computes. Representation theory141controls how evaluations transform. Descent determines when local142evaluations and parameter presentations assemble across a base.