CVLGDec 11, 2022

Orthogonal SVD Covariance Conditioning and Latent Disentanglement

arXiv:2212.05599v16 citationsh-index: 51Has Code
Originality Incremental advance
AI Analysis

This addresses a specific technical bottleneck in deep learning for researchers and practitioners, offering incremental improvements in covariance conditioning and disentanglement.

The paper tackles the problem of ill-conditioned covariance in neural networks with SVD meta-layers, which harms training stability and generalization, by proposing methods like Nearest Orthogonal Gradient and Optimal Learning Rate to improve conditioning without performance loss, achieving better generalization in visual recognition and latent disentanglement in generative models.

Inserting an SVD meta-layer into neural networks is prone to make the covariance ill-conditioned, which could harm the model in the training stability and generalization abilities. In this paper, we systematically study how to improve the covariance conditioning by enforcing orthogonality to the Pre-SVD layer. Existing orthogonal treatments on the weights are first investigated. However, these techniques can improve the conditioning but would hurt the performance. To avoid such a side effect, we propose the Nearest Orthogonal Gradient (NOG) and Optimal Learning Rate (OLR). The effectiveness of our methods is validated in two applications: decorrelated Batch Normalization (BN) and Global Covariance Pooling (GCP). Extensive experiments on visual recognition demonstrate that our methods can simultaneously improve covariance conditioning and generalization. The combinations with orthogonal weight can further boost the performance. Moreover, we show that our orthogonality techniques can benefit generative models for better latent disentanglement through a series of experiments on various benchmarks. Code is available at: \href{https://github.com/KingJamesSong/OrthoImproveCond}{https://github.com/KingJamesSong/OrthoImproveCond}.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes