Poster
Group and Shuffle: Efficient Structured Orthogonal Parametrization
Mikhail Gorbunov · Nikolay Yudin · Vera Soboleva · Aibek Alanov · Alexey Naumov · Maxim Rakhuba
East Exhibit Hall A-C #1705
The increasing size of neural networks has led to a growing demand for methods of efficient finetuning. Recently, an orthogonal finetuning paradigm was introduced that uses orthogonal matrices for adapting the weights of a pretrained model. In this paper, we introduce a new class of structured matrices, which unifies and generalizes structured classes from previous works. We examine properties of this class and build a structured orthogonal parametrization upon it. We then use this parametrization to modify the orthogonal finetuning framework, improving parameter efficiency. We empirically validate our method on different domains, including adapting of text-to-image diffusion models and downstream task finetuning in language modeling. Additionally, we adapt our construction for orthogonal convolutions and conduct experiments with 1-Lipschitz neural networks.
Live content is unavailable. Log in and register to view live content