A library for constrained optimization and manifold optimization for deep learning in PyTorch

GeoTorch provides a simple way to perform constrained optimization and optimization on manifolds in PyTorch. It is compatible out of the box with any optimizer, layer, and model implemented in PyTorch without having to reimplement the layers or optimizers and without any kind of boilerplate in the training code.

import torch
import torch.nn as nn
import geotorch

class Net(nn.Module):
    def __init__(self):
        super(Model, self).__init__()
        self.linear = nn.Linear(64, 128)
        self.cnn = nn.Conv2d(16, 32, 3)
        # Make the linear layer into a low rank layer with rank at most 10
        geotorch.low_rank(self.linear, "weight", rank=10)
        # Also works on tensors. Makes every kernel orthogonal
        geotorch.orthogonal(self.cnn, "weight")

    def forward(self, x):
        # self.linear has rank at most 10 and every 3x3 kernel in the CNN is orthogonal

# Nothing fancy from here on. Use the model as you'd normally do.
model = Net()

# Use your optimizer of choice. Any optimizer works out of the box with any parametrization
optim = torch.optim.Adam(model.parameters(), lr=lr)

The constrained tensor is always initialized to a matrix sampled according to some standard distributions on each space. Even then, we may initialize the tensors manually by assigning to them:

linear = nn.Linear(64, 64)
geotorch.orthogonal(linear, "weight")  # linear.weight is an orthogonal matrix sampled uniformly
linear.weight = torch.eye(64)          # linear.weight is the identity matrix

The following constraints are implemented and may be used as in the example above:

• geotorch.symmetric. Symmetric matrices
• geotorch.skew. Skew-symmetric matrices
• geotorch.sphere. Vectors of norm 1
• geotorch.orthogonal. Matrices with orthogonal columns
• geotorch.grassmannian. Skew-symmetric matrices
• geotorch.almost_orthogonal(λ). Matrices with singular values in the interval [1-λ, 1+λ]
• geotorch.invertible. Invertible matrices with positive determinant
• geotorch.low_rank(r). Matrices of rank at most r
• geotorch.fixed_rank(r). Matrices of rank r
• geotorch.positive_definite. Positive definite matrices
• geotorch.positive_semidefinite. Positive semidefinite matrices
• geotorch.positive_semidefinite_low_rank(r). Positive semidefinite matrices of rank at most r
• geotorch.positive_semidefinite_fixed_rank(r). Positive semidefinite matrices of rank r

Each of these constraints have some extra parameters which can be used to tailor the behavior of each constraint to the problem in hand. For more on this, see the documentation.

These constraints are a fronted for the families of spaces listed below.

Each constraint in GeoTorch is implemented as a manifold. These give the user more flexibility on the options that they choose for each parametrization. All these support Riemannian Gradient Descent by default (more on this here), but they also support optimization via any other PyTorch optimizer.

GeoTorch currently supports the following spaces:

• Rn(n): Rⁿ. Unrestricted optimization
• Sym(n): Vector space of symmetric matrices
• Skew(n): Vector space of skew-symmetric matrices
• Sphere(n): Sphere in Rⁿ. { x ∈ Rⁿ | ||x|| = 1 } ⊂ Rⁿ
• SO(n): Manifold of n×n orthogonal matrices
• St(n,k): Manifold of n×k matrices with orthonormal columns
• AlmostOrthogonal(n,k,λ): Manifold of n×k matrices with singular values in the interval [1-λ, 1+λ]
• Gr(n,k): Manifold of k-dimensional subspaces in Rⁿ
• GLp(n): Manifold of invertible n×n matrices with positive determinant
• LowRank(n,k,r): Variety of n×k matrices of rank r or less
• FixedRank(n,k,r): Manifold of n×k matrices of rank r
• PSD(n): Cone of n×n symmetric positive definite matrices``
• PSSD(n): Cone of n×n symmetric positive semi-definite matrices
• PSSDLowRank(n,r): Variety of n×n symmetric positive semi-definite matrices of rank r or less
• PSSDFixedRank(n,r): Manifold of n×n symmetric positive semi-definite matrices of rank r
• ProductManifold(M₁, ..., Mₖ): Product of manifolds M₁ × ... × Mₖ

Every space of dimension (n, k) can be applied to tensors of shape (*, n, k), so we also get efficient parallel implementations of product spaces such as

• ObliqueManifold(n,k): Matrix with unit length columns, Sⁿ⁻¹ × ...ᵏ⁾ × Sⁿ⁻¹

The files in examples/copying_problem.py and examples/sequential_mnist.py serve as tutorials to see how to handle the initialization and usage of GeoTorch in some real code. They also show how to implement Riemannian Gradient Descent and some other tricks. For an introduction to how the library is actually implemented, see `exmaples/parametrisations.ipynb`_.

You may try GeoTorch installing it with

pip install git+https://github.com/Lezcano/geotorch/

GeoTorch is tested in Linux, Mac, and Windows environments for Python >= 3.6.

If one wants to use a parametrized tensor in different places in their model, or uses one parametrized layer many times, for example in an RNN, it is recommended to wrap the forward pass as follows to avoid each parametrization to be computed many times:

with geotorch.parametrize.cached():
    logits = model(input_)

Of course, this with statement may be used simply inside the forward function where the parametrized layer is used several times.

These ideas fall in the context of parametrized optimization, where one wraps a tensor X with a function f, and rather than using X, uses f(X). Particular examples of this idea are pruning, weight normalization, and spectral normalization among others. This repository implements a framework to approach this kind of problems. The framework is currently PR #33344 in PyTorch. All the functionality of this PR is located in geotorch/parametrize.py.

As every space in GeoTorch is, at its core, a map from a flat space into a manifold, the tools implemented here also serve as a building block in normalizing flows. Using a factorized space such as LowRank(n,k,r) it is direct to compute the determinant of the transformation it defines, as we have direct access to the singular values of the layer.

Please cite the following work if you found GeoTorch useful. This paper exposes a simplified mathematical explanation of part of the inner-workings of GeoTorch.

@inproceedings{lezcano2019trivializations,
    title = {Trivializations for gradient-based optimization on manifolds},
    author = {Lezcano-Casado, Mario},
    booktitle={Advances in Neural Information Processing Systems, NeurIPS},
    pages = {9154--9164},
    year = {2019},
}