pith. sign in

arxiv: 1611.05927 · v1 · pith:SDVDPA6Fnew · submitted 2016-11-17 · 💻 cs.CV

Generalized BackPropagation, \'{E}tude De Cas: Orthogonality

classification 💻 cs.CV
keywords deeporthogonalitybackpropagationfeaturelayerlayersmakenetwork
0
0 comments X
read the original abstract

This paper introduces an extension of the backpropagation algorithm that enables us to have layers with constrained weights in a deep network. In particular, we make use of the Riemannian geometry and optimization techniques on matrix manifolds to step outside of normal practice in training deep networks, equipping the network with structures such as orthogonality or positive definiteness. Based on our development, we make another contribution by introducing the Stiefel layer, a layer with orthogonal weights. Among various applications, Stiefel layers can be used to design orthogonal filter banks, perform dimensionality reduction and feature extraction. We demonstrate the benefits of having orthogonality in deep networks through a broad set of experiments, ranging from unsupervised feature learning to fine-grained image classification.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. $\boldsymbol{\lambda}$-Orthogonality Regularization for Compatible Representation Learning

    cs.LG 2025-09 conditional novelty 6.0

    λ-Orthogonality regularization enables distribution-specific adaptation of representations via affine transformations while retaining original learned structures.