A Projection Algorithm for the Unitary Weights
Hao-Yuan Chang (University of California, Los Angeles)

TL;DR
This paper introduces a novel backpropagation-based projection algorithm using Lie algebra to efficiently initialize unitary weights in neural networks, reducing training time while preserving inference speed benefits.
Contribution
The paper presents a new algorithm that approximates unitary weights from pre-trained non-unitary weights, improving training efficiency of unitary neural networks.
Findings
Faster training of unitary networks with the proposed method.
Maintains inference speed advantages of unitary networks.
Applicable to architectures with pre-trained weights.
Abstract
Unitary neural networks are promising alternatives for solving the exploding and vanishing activation/gradient problem without the need for explicit normalization that reduces the inference speed. However, they often require longer training time due to the additional unitary constraints on their weight matrices. Here we show a novel algorithm using a backpropagation technique with Lie algebra for computing approximated unitary weights from their pre-trained, non-unitary counterparts. The unitary networks initialized with these approximations can reach the desired accuracies much faster, mitigating their training time penalties while maintaining inference speedups. Our approach will be instrumental in the adaptation of unitary networks, especially for those neural architectures where pre-trained weights are freely available.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Neural Network Applications · Domain Adaptation and Few-Shot Learning · Neural Networks and Applications
