2026-09-19T01:49:04Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/1516062023-08-01T04:16:03Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Jegelka, Stefanie Lim, Derek Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2023-07-31T19:52:12Z 2023-07-31T19:52:12Z 2023-06 2023-07-13T14:22:43.462Z https://hdl.handle.net/1721.1/151606 The need to process eigenvectors derived from data arises across numerous domains in computing and the sciences. However, eigenvectors differ from other types of data, as they have particular symmetries; for any eigenvector of a matrix, the negation of that vector is also an eigenvector of the same eigenvalue, so there are sign symmetries. There are also more general continuous basis symmetries in higher dimensional eigenspaces. In this thesis, we present the first neural networks that process eigenvector input while respecting these symmetries. We build neural networks that are invariant to sign and basis symmetries as well as neural networks that are equivariant to sign symmetries. Under certain conditions, these networks are provably universal — they can approximate any continuous functions with the desired invariances. When used with Laplacian eigenvectors, our invariant neural networks are provably powerful for graph representation learning, as they can approximate several classes of important functions on graphs. Our networks empirically improve machine learning models with eigenvectors, in tasks including molecular graph regression, learning expressive graph representations, and learning neural fields on triangle meshes. S.M. Massachusetts Institute of Technology In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/ Neural Networks on Eigenvector Data Thesis application/pdf Master Master of Science in Electrical Engineering and Computer Science Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="1c3fa8f9-7fb5-4346-b8b2-c376e4c75fde"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Title>Neural Networks on Eigenvector Data</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2023-06</PublicationDate> <Authors> <Author> <DisplayName>Lim, Derek</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>https://rightsstatements.org/page/InC-EDU/1.0/</License> <Abstract>The need to process eigenvectors derived from data arises across numerous domains in computing and the sciences. However, eigenvectors differ from other types of data, as they have particular symmetries; for any eigenvector of a matrix, the negation of that vector is also an eigenvector of the same eigenvalue, so there are sign symmetries. There are also more general continuous basis symmetries in higher dimensional eigenspaces. In this thesis, we present the first neural networks that process eigenvector input while respecting these symmetries. We build neural networks that are invariant to sign and basis symmetries as well as neural networks that are equivariant to sign symmetries. Under certain conditions, these networks are provably universal — they can approximate any continuous functions with the desired invariances. When used with Laplacian eigenvectors, our invariant neural networks are provably powerful for graph representation learning, as they can approximate several classes of important functions on graphs. Our networks empirically improve machine learning models with eigenvectors, in tasks including molecular graph regression, learning expressive graph representations, and learning neural fields on triangle meshes.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>