Riemannian Structure and Optimization for a Class of Low-Parametric Orthogonal Matrices

2026-09-23

AI Summary

本文研究了一类低参数正交矩阵的黎曼结构，并提出有效算法解决其在深度学习中的计算问题。

Abstract

In this paper, we are concerned with matrices formed by block-diagonal factors interleaved with fixed permutations -- a flexible family of structured matrices. This class has recently drawn interest in deep learning architectures for its balanced expressivity-efficiency trade-off, yet efficient computational strategies for working with it remain to be found. We approach this problem through Riemannian geometry and examine under what conditions this class admits a smooth manifold structure. For the practically important case of orthogonal two-factor matrices, we derive the essential Riemannian tools and propose efficient algorithms for their implementation. The algorithms leverage automatic differentiation, support parameter sharing within each factor, and avoid explicit dense matrix construction. We test them within the Riemannian optimization framework on the best matrix approximation problem and for parameter-efficient fine-tuning of large language models. Beyond the two-factor setting, we study the geometric and matrix-theoretic properties of factorizations with a larger number of block-diagonal factors.

Problem

• Riemannian Geometry
• Structured Matrices
• Orthogonal Matrices
• Efficient Computation

Innovation

• Riemannian geometry
• block-diagonal factors
• automatic differentiation
• parameter sharing
• efficient algorithms