<mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-7.xsd"><mods:titleInfo><mods:title>The Deep Linear Network – Dynamics, Riemannian Geometry and Overparametrization</mods:title></mods:titleInfo><mods:typeOfResource authority="primo">dissertations</mods:typeOfResource><mods:name type="personal"><mods:namePart>Veraszto, Zsolt</mods:namePart><mods:role><mods:roleTerm type="text">creator</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart>Menon, Govind</mods:namePart><mods:role><mods:roleTerm type="text">Advisor</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart>Cohen, Nadav</mods:namePart><mods:role><mods:roleTerm type="text">Reader</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart>Darbon, Jerome</mods:namePart><mods:role><mods:roleTerm type="text">Reader</mods:roleTerm></mods:role></mods:name><mods:name type="corporate"><mods:namePart>Brown University. Department of Applied Mathematics</mods:namePart><mods:role><mods:roleTerm type="text">sponsor</mods:roleTerm></mods:role></mods:name><mods:originInfo><mods:copyrightDate>2023</mods:copyrightDate></mods:originInfo><mods:physicalDescription><mods:extent>ix, 76 p.</mods:extent><mods:digitalOrigin>born digital</mods:digitalOrigin></mods:physicalDescription><mods:note type="thesis">Thesis (Ph. D.)--Brown University, 2023</mods:note><mods:genre authority="aat">theses</mods:genre><mods:abstract>The deep linear network (DLN) is a model for implicit regularization in gradient based optimization of overparametrized learning architectures. Training the DLN corresponds to a Riemannian gradient flow, where the Riemannian metric is defined by the architecture of the network and the loss function is defined by the learning task.  We extend this geometric framework, obtaining  explicit expressions for the volume form, including the case when the network has infinite depth. We investigate the link between the Riemannian geometry and the training asymptotics for matrix completion with rigorous analysis and numerics. We develop a stochastic model for training and report our numerical findings. We propose that under small initialization, implicit regularization is a result of bias towards high state space volume.</mods:abstract><mods:subject><mods:topic>generalizability</mods:topic></mods:subject><mods:subject><mods:topic>gradient flows</mods:topic></mods:subject><mods:subject><mods:topic>implicit regularization</mods:topic></mods:subject><mods:subject><mods:topic>rieamannian geometry</mods:topic></mods:subject><mods:subject><mods:topic>matrix completion</mods:topic></mods:subject><mods:subject><mods:topic>deep linear network</mods:topic></mods:subject><mods:language><mods:languageTerm authority="iso639-2b">English</mods:languageTerm></mods:language><mods:recordInfo><mods:recordContentSource authority="marcorg">RPB</mods:recordContentSource><mods:recordCreationDate encoding="iso8601">20230602</mods:recordCreationDate></mods:recordInfo></mods:mods>