Tensor decompositions for count data that leverage stochastic and deterministic optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5937963 (Why is no real title available?)
- A Riemannian trust region method for the canonical tensor rank approximation problem
- A Second-Order Method for Fitting the Canonical Polyadic Decomposition With Non-Least-Squares Cost
- A new truncation strategy for the higher-order singular value decomposition
- Adaptive subgradient methods for online learning and stochastic optimization
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computing non-negative tensor factorizations
- Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
- Coordinate descent algorithms
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Efficient multi-start strategies for local search algorithms
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Generalized canonical polyadic tensor decomposition
- Handbook of heuristics
- LAPACK Users' Guide
- Low complexity damped Gauss-Newton algorithms for CANDECOMP/PARAFAC
- Newton-based optimization for Kullback-Leibler nonnegative tensor factorizations
- On Tensors, Sparsity, and Nonnegative Factorizations
- Optimization by simulated annealing
- Procrustes matching by congruence coefficients
- Software for Sparse Tensor Decomposition on Emerging Computing Architectures
- Stochastic gradients for large-scale tensor decomposition
- Templates for the Solution of Algebraic Eigenvalue Problems
- Tensor Decompositions and Applications
- The condition number of join decompositions
- The distribution of chance congruence coefficients from simulated data
- The expression of a tensor or a polyadic as a sum of products.
- Tutorial on maximum likelihood estimation
- Very fast simulated re-annealing
This page was built for publication: Tensor decompositions for count data that leverage stochastic and deterministic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971047)
