Sigmoid Tensor Decomposition for Compact Representations of Binary Data
From MaRDI portal
Cites work
- A Multilinear Singular Value Decomposition
- A nonlinear matrix decomposition for mining the zeros of sparse data
- A systematic analysis of performance measures for classification tasks
- Accelerated Algorithms for Nonlinear Matrix Decomposition with the ReLU function
- An accelerated alternating partial Bregman algorithm for ReLU-based matrix decomposition
- An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
- Factorization
- Non-negative matrix factorization with sparseness constraints
- On local convergence of alternating schemes for optimization of convex problems in the tensor train format
- Online Learning for Matrix Factorization and Sparse Coding
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- ReLU-based nonlinear tensor decomposition for sparse nonnegative data
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- Tensor Decompositions and Applications
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
- The approximation of one matrix by another of lower rank.
This page was built for publication: Sigmoid Tensor Decomposition for Compact Representations of Binary Data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7427330)