Pytorch implementation of the hamburger module from the ICLR 2021 paper "Is Attention Better Than Matrix Decomposition"
-
Updated
Jan 13, 2021 - Python
Pytorch implementation of the hamburger module from the ICLR 2021 paper "Is Attention Better Than Matrix Decomposition"
A sparsity aware implementation of "Enhanced Network Embedding with Text Information" (ICPR 2018).
Converts unitary matrix to Qiskit/Cirq/Q# cirquit
The official implementation of "Rank-One Network: An Effective Framework for Image Restoration" via TensorFlow
Robust Orthonormal Subspace Learning in Python
This repository contains Python functions implementing the Hoffman algorithm for decomposing elements of SO(N), and functions applying this algorithm to decompose any element of the matchgate group into nearest-neighbor matchgates. See README for more information and a list of references on the Hoffman decomposition and the matchgate group.
The code for prototype selection and instance ranking using matrix decomposition and subspace learning
Fatoração de Matrizes para Sistemas de Classificação de Machine Learning
implement machine learning models from scratch
Cholesky decomposition for Hilbert matrix of any order in Python 3 (Two programs)
Add a description, image, and links to the matrix-decomposition topic page so that developers can more easily learn about it.
To associate your repository with the matrix-decomposition topic, visit your repo's landing page and select "manage topics."