Riemannian Optimization for High-Dimensional Tensor Completion

DOI10.1137/15M1010506zbMath1352.65129WikidataQ115246975 ScholiaQ115246975MaRDI QIDQ2830626

Michael Steinlechner

Publication date: 28 October 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmnumerical experimentscurse of dimensionalitylow-rank approximationRiemannian optimizationtensor completionhigh-dimensional problemstensor train formatmatrix product statesdata recoverynonlinear conjugate gradient scheme

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83)

Related Items

Particle number conservation and block structures in matrix product states ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ An approximation method of CP rank for third-order tensor completion ⋮ Automatic Differentiation for Riemannian Optimization on Low-Rank Matrix and Tensor-Train Manifolds ⋮ Low-rank tensor methods for partial differential equations ⋮ Generative modeling via tensor train sketching ⋮ Data-Driven Tensor Train Gradient Cross Approximation for Hamilton–Jacobi–Bellman Equations ⋮ Constrained Optimization with Low-Rank Tensors and Applications to Parametric Problems with PDEs ⋮ Riemannian conjugate gradient method for low-rank tensor completion ⋮ Chebfun in Three Dimensions ⋮ Pricing High-Dimensional Bermudan Options with Hierarchical Tensor Formats ⋮ High-dimensional density estimation with tensorizing flow ⋮ An approximate projection onto the tangent cone to the variety of third-order tensors of bounded tensor-train rank ⋮ Variational Bayesian inference for CP tensor completion with subspace information ⋮ A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem ⋮ Symplectic dynamical low rank approximation of wave equations with random parameters ⋮ Low-Rank Tensor Approximation for Chebyshev Interpolation in Parametric Option Pricing ⋮ Low-rank Riemannian eigensolver for high-dimensional Hamiltonians ⋮ Geometric Methods on Low-Rank Matrix and Tensor Manifolds ⋮ Multiresolution Low-rank Tensor Formats ⋮ Tensor Completion via Gaussian Process--Based Initialization ⋮ Unnamed Item ⋮ Block tensor train decomposition for missing data estimation ⋮ Preconditioned Low-rank Riemannian Optimization for Linear Systems with Tensor Product Structure ⋮ Tensor Algorithms for Advanced Sensitivity Metrics ⋮ Efficient Weingarten map and curvature estimation on manifolds ⋮ Iterative algorithms for the post-processing of high-dimensional data ⋮ Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs ⋮ Riemannian Multigrid Line Search for Low-Rank Problems ⋮ Stable als approximation in the TT-format for rank-adaptive tensor completion ⋮ The Condition Number of Riemannian Approximation Problems ⋮ Efficient low-rank regularization-based algorithms combining advanced techniques for solving tensor completion problems with application to color image recovering

Uses Software

• FEniCS
• TT Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor-Train Decomposition
• TT-cross approximation for multidimensional arrays
• The geometry of algorithms using hierarchical tensors
• Low-rank tensor completion by Riemannian optimization
• Low-rank retractions: a survey and new results
• Parallel tensor sampling in the hierarchical Tucker format
• Automated solution of differential equations by the finite element method. The FEniCS book
• A theory of pseudoskeleton approximations
• Adaptive low-rank approximation of collocation matrices
• Incomplete cross approximation in the mosaic-skeleton method
• Approximation of boundary element matrices
• Black box approximation of tensors in hierarchical Tucker format
• Learning with tensors: a framework based on convex optimization and spectral regularization
• Optimization on the hierarchical Tucker manifold - applications to tensor completion
• On manifolds of tensors of fixed TT-rank
• Hybrid cross approximation of integral operators
• On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train Format
• Low-Rank Matrix Completion by Riemannian Optimization
• A literature survey of low-rank tensor approximation techniques
• Projection-like Retractions on Matrix Manifolds
• The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format
• Alternating Minimal Energy Methods for Linear Systems in Higher Dimensions
• Low-Rank Tensor Methods with Subspace Correction for Symmetric Eigenvalue Problems
• Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Hierarchical Tensor Approximation of Output Quantities of Parameter-Dependent PDEs
• Tensor Completion in Hierarchical Tensor Representations
• Solution of Linear Systems and Matrix Inversion in the TT-Format
• Time Integration of Tensor Trains
• The Power of Convex Relaxation: Near-Optimal Matrix Completion