Tensor Completion in Hierarchical Tensor Representations

DOI10.1007/978-3-319-16042-9_14zbMath1333.94023arXiv1404.3905OpenAlexW966126569MaRDI QIDQ3460842

Holger Rauhut, Željka Stojanac, Reinhold Schneider

Publication date: 8 January 2016

Published in: Compressed Sensing and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.3905

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (20)

An optimal statistical and computational framework for generalized tensor estimation ⋮ Randomized Algorithms for Rounding in the Tensor-Train Format ⋮ Minimum \( n\)-rank approximation via iterative hard thresholding ⋮ Tensor-based dynamic mode decomposition ⋮ Low rank tensor recovery via iterative hard thresholding ⋮ $N$-Dimensional Tensor Completion for Nuclear Magnetic Resonance Relaxometry ⋮ Variational Bayesian inference for CP tensor completion with subspace information ⋮ Block tensor train decomposition for missing data estimation ⋮ Low-Rank Tensor Recovery using Sequentially Optimal Modal Projections in Iterative Hard Thresholding (SeMPIHT) ⋮ Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure ⋮ Low-rank tensor train for tensor robust principal component analysis ⋮ Modified iterations for data-sparse solution of linear systems ⋮ Tensor theta norms and low rank recovery ⋮ Low-Rank Approximation and Completion of Positive Tensors ⋮ Riemannian Optimization for High-Dimensional Tensor Completion ⋮ Covariate Regularized Community Detection in Sparse Graphs ⋮ Stable als approximation in the TT-format for rank-adaptive tensor completion ⋮ New Riemannian Preconditioned Algorithms for Tensor Completion via Polyadic Decomposition ⋮ Optimization on the hierarchical Tucker manifold - applications to tensor completion ⋮ Efficient low-rank regularization-based algorithms combining advanced techniques for solving tensor completion problems with application to color image recovering

Uses Software

• MCTDH

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• Tensor-Train Decomposition
• A mathematical introduction to compressive sensing
• The geometry of algorithms using hierarchical tensors
• On the approximation of high-dimensional differential equations in the hierarchical Tucker format
• Low-rank tensor completion by Riemannian optimization
• Ranks derived from multilinear maps
• The density-matrix renormalization group in the age of matrix product states
• Tensorisation of vectors and their efficient convolution
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• A new tensor decomposition
• From quantum to classical molecular dynamics: Reduced models and numerical analysis.
• Well-posedness of convex maximization problems on Stiefel manifolds and orthogonal tensor product approximations
• On minimal subspaces in tensor representations
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Tree-based tensor formats
• Extraction of quantifiable information from complex systems
• A new scheme for the tensor representation
• Optimization on the hierarchical Tucker manifold - applications to tensor completion
• Low rank tensor recovery via iterative hard thresholding
• On manifolds of tensors of fixed TT-rank
• Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
• Exact matrix completion via convex optimization
• On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format
• Low-Rank Matrix Completion by Riemannian Optimization
• Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
• A literature survey of low-rank tensor approximation techniques
• Normalized Iterative Hard Thresholding for Matrix Completion
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• Hierarchical Singular Value Decomposition of Tensors
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Algebraic Wavelet Transform via Quantics Tensor Train Decomposition
• Tensor Spaces and Numerical Tensor Calculus
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Tensor rank is NP-complete
• Multivariate Regression and Machine Learning with Sums of Separable Functions
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A Multilinear Singular Value Decomposition
• Numerical tensor calculus
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Most Tensor Problems Are NP-Hard
• A Simpler Approach to Matrix Completion
• Algorithms for Numerical Analysis in High Dimensions

This page was built for publication: Tensor Completion in Hierarchical Tensor Representations