scientific article; zbMATH DE number 7306859
From MaRDI portal
Publication:5148935
Publication date: 5 February 2021
Full work available at URL: https://arxiv.org/abs/1811.05076
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generalized linear modeldiverging dimensionalityCANDECOMP/PARAFAC tensor decompositionconstrained maximum likelihood estimationbinary tensor
Related Items (8)
An optimal statistical and computational framework for generalized tensor estimation ⋮ Tensor factorization recommender systems with dependency ⋮ Generalized Tensor Decomposition With Features on Multiple Modes ⋮ Partially Observed Dynamic Tensor Response Regression ⋮ Correlation Tensor Decomposition and Its Application in Spatial Imaging Data ⋮ Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization ⋮ Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition ⋮ Community detection on mixture multilayer networks via regularized tensor decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels
- Operator norm inequalities between tensor unfoldings on the partition lattice
- Sparse logistic principal components analysis for binary data
- Dimensionality reduction and topographic mapping of binary tensors
- Principal component analysis of binary data by iterated singular value decomposition
- Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
- Multilayer tensor factorization with applications to recommender systems
- Common and individual structure of brain networks
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
- Tensor decompositions for learning latent variable models
- On the existence of maximum likelihood estimates in logistic regression models
- Numerical Analysis for Statisticians
- Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
- Nuclear norm of higher-order tensors
- Learning Tensors From Partial Binary Measurements
- 1-Bit matrix completion
- Generalized Canonical Polyadic Tensor Decomposition
- A modern maximum-likelihood theory for high-dimensional logistic regression
- Smoothed analysis of tensor decompositions
- Tensor and its tucker core: The invariance relationships
This page was built for publication:
