Indexed text attachment
cotangent-semantics.tex
Source for Cotangent Semantics for Distributed Optimization
View paper · Download original file
Lines 461–542 of 542. Source text is displayed literally.
461The experiments use model sharding over one emulated LAN. There is no comparison against multiple physical hosts, decentralized consensus, stale gradient protocols, or fault-tolerant recovery. The raw transcripts are generated by the provided program, so their hashes and counter reconciliation establish repeatability and internal consistency. The rebuild and repeat-run comparison provide a direct check of the reported results. A program with data-dependent branching can use a fixed executed trace for conditional differentiation, with separate conditions needed near switching boundaries. Feedback can be unrolled to a finite acyclic program at a fixed horizon. Neither construction licenses transposing a nondifferentiable branch decision or ignoring the state needed to reverse a loop.462 463\section{Reproduction and disclosures}464 465The companion archive includes the C implementation, a Python 3 standard-library guest builder and runner, SHA-256 pins, checksum-verified prepared data shards, both runs' serial logs and manifests, the verifier, and the double-column LaTeX source. On a Linux x86-64 host, QEMU system emulation and a C compiler with static libc suffice to build and run the experiments. The archive's README gives the commands for a full cluster run, the cross-run comparison and regeneration of the manuscript tables and curves. The data shards can be regenerated from the pinned upstream datasets. The verifier treats guest identities, Ethernet frame counts and wall-clock measurements as execution evidence whose values can vary, and checks the stable numerical and application-counter fields against the reference run. No accelerator or external service is used by the guests.466 467The commissioning researcher is the responsible contributor. The manuscript uses an anonymous byline. An AI coding and writing assistant developed the manuscript and the experimental software, ran the cluster twice, checked the quantitative results and assembled the replication artifacts under the researcher's direction. The mathematical results are supported by prose proofs.468 469\begin{thebibliography}{99}470\small\RaggedRight471\bibitem{cockett} R. Cockett, G. Cruttwell, J. Gallagher, J.-S. P. Lemay,472B. MacAdam, G. Plotkin, and D. Pronk.473Reverse derivative categories.474In \emph{CSL 2020}, LIPIcs 152, article 18.475\href{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.18}{doi:10.4230/LIPIcs.CSL.2020.18}.476 477\bibitem{cruttwell} G. S. H. Cruttwell, B. Gavranović, N. Ghani, P. Wilson, and F. Zanasi.478Categorical foundations of gradient-based learning.479In \emph{ESOP 2022}, LNCS 13240, pp.~1--28.480\href{https://link.springer.com/chapter/10.1007/978-3-030-99336-8_1}{doi:10.1007/978-3-030-99336-8\_1}.481 482\bibitem{utke} J. Utke, L. Hascoët, C. Hill, P. Hovland, J. Riehme, and U. Naumann.483Toward adjoinable MPI.484In \emph{PDSEC}, 2009.485\href{https://www-sop.inria.fr/tropics/papers/Utke2009TAM.html}{INRIA record}.486 487\bibitem{lurie} J. Lurie. \emph{Higher Topos Theory}.488Annals of Mathematics Studies 170, Princeton University Press, 2009.489\href{https://arxiv.org/abs/math/0608040}{arXiv:math/0608040}.490 491\bibitem{bottou} L. Bottou, F. E. Curtis, and J. Nocedal.492Optimization methods for large-scale machine learning.493\emph{SIAM Review} 60(2), pp.~223--311, 2018.494\href{https://arxiv.org/abs/1606.04838}{doi:10.1137/16M1080173}.495 496\bibitem{fritz} T. Fritz.497A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics.498\emph{Advances in Mathematics} 370, 107239, 2020.499\href{https://arxiv.org/abs/1908.07021}{arXiv:1908.07021}.500 501\bibitem{holland} J. H. Holland.502\emph{Adaptation in Natural and Artificial Systems}.503MIT Press, 1992.504\href{https://doi.org/10.7551/MITPRESS/1090.001.0001}{MIT Press edition}.505 506\bibitem{freund} Y. Freund and R. E. Schapire.507A decision-theoretic generalization of on-line learning and an application to boosting.508\emph{Journal of Computer and System Sciences} 55(1), pp.~119--139, 1997.509\href{https://doi.org/10.1006/jcss.1997.1504}{doi:10.1006/jcss.1997.1504}.510 511\bibitem{warmuth} M. K. Warmuth, K. A. Glocer, and S. V. N. Vishwanathan.512Entropy regularized LPBoost.513In \emph{ALT 2008}, LNCS 5254, pp.~256--271.514\href{https://link.springer.com/chapter/10.1007/978-3-540-87987-9_23}{doi:10.1007/978-3-540-87987-9\_23}.515 516\bibitem{iris} R. A. Fisher.517Iris. UCI Machine Learning Repository, 1988.518\href{https://doi.org/10.24432/C56C76}{doi:10.24432/C56C76}.519\href{https://archive.ics.uci.edu/ml/machine-learning-databases/iris/bezdekIris.data}{Corrected data file}.520 521\bibitem{digits} E. Alpaydın and C. Kaynak.522Optical Recognition of Handwritten Digits.523UCI Machine Learning Repository, 1998.524\href{https://doi.org/10.24432/C50P49}{doi:10.24432/C50P49}.525\href{https://archive.ics.uci.edu/ml/machine-learning-databases/optdigits/optdigits.tes}{Data file}.526 527\bibitem{fashion} H. Xiao, K. Rasul, and R. Vollgraf.528Fashion-MNIST, a novel image dataset for benchmarking machine learning algorithms, 2017.529\href{https://arxiv.org/abs/1708.07747}{arXiv:1708.07747}.530 531\bibitem{rahimi} A. Rahimi and B. Recht.532Random features for large-scale kernel machines.533In \emph{Advances in Neural Information Processing Systems 20}, 2007.534\href{https://papers.neurips.cc/paper_files/paper/2007/hash/013a006f03dbc5392effeb8f18fda755-Abstract.html}{NeurIPS proceedings}.535 536\bibitem{qemu} QEMU Project.537\emph{Direct Linux Boot} and \emph{Network emulation}.538\href{https://www.qemu.org/docs/master/system/linuxboot.html}{Boot documentation}539and \href{https://www.qemu.org/docs/master/system/devices/net.html}{network documentation}.540\end{thebibliography}541\end{document}542