Reparameterized LLM Training via Orthogonal Equivalence Transformation

Zeju Qiu (Max-Planck-Institute for Intelligent Systems, Max-Planck Institute) · Simon Buchholz (Max Planck Institute for Intelligent Systems) · Tim Xiao (University of Tübingen & Max Planck Institute for Intelligent Systems) · Maximilian Dax (MPI for Intelligent Systems, Tübingen) · Bernhard Schölkopf (MPI for Intelligent Systems, Tübingen) · Weiyang Liu (CUHK & Max Planck Institute for Intelligent Systems)
efficient approximationsfixed random weight matrixflexiblegeneralizationlearnable orthogonal matricesobjective functionoptimize neuronsorthogonal equivalence transformationreparameterized trainingscalabilityscalablespectral propertiestraining large-scale neural networks

While large language models (LLMs) are driving the rapid advancement of artificial intelligence, effectively and reliably training these large models remains one of the field's most significant challenges. To address this challenge, we propose POET, a novel reParameterized training algorithm that uses Orthogonal Equivalence Transformation to optimize neurons. Specifically, POET reparameterizes each neuron with two learnable orthogonal matrices and a fixed random weight matrix. Because of its provable preservation of spectral properties of weight matrices, POET can stably optimize the objective function with improved generalization. We further develop efficient approximations that make POET flexible and scalable for training large-scale neural networks. Extensive experiments validate the effectiveness and scalability of POET in training LLMs.