Symmetric matrix - truncated SVD

class linalg.svd_arnoldi.SVDSYMARNOLDI[source]
static backward(self, dU, dS, dV)[source]

Defines a formula for differentiating the operation.

This function is to be overridden by all subclasses.

It must accept a context ctx as the first argument, followed by as many outputs did forward() return, and it should return as many tensors, as there were inputs to forward(). Each argument is the gradient w.r.t the given output, and each returned value should be the gradient w.r.t. the corresponding input.

The context can be used to retrieve tensors saved during the forward pass. It also has an attribute ctx.needs_input_grad as a tuple of booleans representing whether each input needs gradient. E.g., backward() will have ctx.needs_input_grad[0] = True if the first input to forward() needs gradient computated w.r.t. the output.

static forward(self, M, k)[source]
Parameters
  • M (torch.tensor) – square symmetric matrix \(N \times N\)

  • k (int) – desired rank (must be smaller than \(N\))

Returns

leading k left eigenvectors U, singular values S, and right eigenvectors V

Return type

torch.tensor, torch.tensor, torch.tensor

Note: depends on scipy

Return leading k-singular triples of a matrix M, where M is symmetric \(M=M^T\), by computing the symmetric decomposition \(M= UDU^T\) up to rank k. Partial eigendecomposition is done through Arnoldi method.