ReLU-based nonlinear tensor decomposition for sparse nonnegative data
From MaRDI portal
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A nonlinear matrix decomposition for mining the zeros of sparse data
- An accelerated alternating partial Bregman algorithm for ReLU-based matrix decomposition
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Bilateral tensor low-rank representation for insufficient observed samples in multidimensional image clustering and recovery
- Computing dense tensor decompositions with optimal dimension trees
- CP decomposition for tensors via alternating least squares with QR decomposition
- Deep learning
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
- On global convergence of alternating least squares for tensor approximation
- Poisson tensor completion via nonconvex regularization and nonlocal self-similarity for multi-dimensional image recovery
- Practical leverage-based sampling for low-rank tensor decomposition
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor decompositions for data science
- Tensor networks for dimensionality reduction and large-scale optimization. I: Low-rank tensor decompositions
- Tensor-train decomposition
- The expression of a tensor or a polyadic as a sum of products.
This page was built for publication: ReLU-based nonlinear tensor decomposition for sparse nonnegative data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325585)
