Block tensor train decomposition for missing data estimation (Q1757240): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:10, 23 September 2024

scientific article

Language	Label	Description	Also known as
English	Block tensor train decomposition for missing data estimation	scientific article

Statements

scholarly article

0 references

Block tensor train decomposition for missing data estimation (English)

0 references

0 references

0 references

Statistical Papers

0 references

publication date

3 January 2019

0 references

zbMATH Keywords

imputation

0 references

multidimensional array

0 references

singular value decomposition

0 references

tensor network

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00362-018-1043-8

0 references

Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD

0 references

Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train

0 references

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young'' decomposition

0 references

Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions

0 references

Fast Solution of Parabolic Problems in the Tensor Train/Quantized Tensor Train Format with Initial Application to the Fokker--Planck Equation

0 references

Computation of extreme eigenvalues in higher dimensions using block tensor train format

0 references

On minimal subspaces in tensor representations

0 references

Tucker factorization with missing data with application to low-\(n\)-rank tensor completion

0 references

Nuclear norm of higher-order tensors

0 references

Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights

0 references

Tensor completion and low-n-rank tensor recovery via convex optimization

0 references

Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard

0 references

Hierarchical Singular Value Decomposition of Tensors

0 references

A literature survey of low-rank tensor approximation techniques

0 references

Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format

0 references

Tensor Spaces and Numerical Tensor Calculus

0 references

A new scheme for the tensor representation

0 references

The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format

0 references

On manifolds of tensors of fixed TT-rank

0 references

Principal component analysis.

0 references

\(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling

0 references

Weighted least squares fitting using ordinary least squares algorithms

0 references

Tensor Decompositions and Applications

0 references

Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems

0 references

Low-rank tensor completion by Riemannian optimization

0 references

Tensor conjugate-gradient-type method for Rayleigh quotient minimization in block QTT-format

0 references

Estimating a Few Extreme Singular Values and Vectors for Large-Scale Matrices in Tensor Train Format

0 references

Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions

0 references

Fundamental tensor operations for large-scale data analysis using tensor network formats

0 references

0 references

Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions

0 references

Tensor-Train Decomposition

0 references

Solution of Linear Systems and Matrix Inversion in the TT-Format

0 references

Tensor Completion in Hierarchical Tensor Representations

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Recommender Systems Handbook

0 references

Numerical Methods for Large Eigenvalue Problems

0 references

Riemannian Optimization for High-Dimensional Tensor Completion

0 references

0 references

Smooth PARAFAC Decomposition for Tensor Completion

0 references

On tensor completion via nuclear norm minimization

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00362-018-1043-8

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1757240

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1757240&oldid=37847293"