Riemannian optimization for high-dimensional tensor completion
From MaRDI portal
Recommendations
- Low-rank tensor completion by Riemannian optimization
- A Riemannian trust-region method for low-rank tensor completion.
- Riemannian conjugate gradient method for low-rank tensor completion
- Low-rank matrix completion by Riemannian optimization
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
Cites work
- A literature survey of low-rank tensor approximation techniques
- A theory of pseudoskeleton approximations
- Adaptive low-rank approximation of collocation matrices
- Alternating minimal energy methods for linear systems in higher dimensions
- Approximation of boundary element matrices
- Automated solution of differential equations by the finite element method. The FEniCS book
- Black box approximation of tensors in hierarchical Tucker format
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Hybrid cross approximation of integral operators
- Incomplete cross approximation in the mosaic-skeleton method
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Low-rank matrix completion by Riemannian optimization
- Low-rank retractions: a survey and new results
- Low-rank tensor completion by Riemannian optimization
- Low-rank tensor methods with subspace correction for symmetric eigenvalue problems
- Matrix completion from noisy entries
- On local convergence of alternating schemes for optimization of convex problems in the tensor train format
- On manifolds of tensors of fixed TT-rank
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- Parallel tensor sampling in the hierarchical Tucker format
- Projection-like retractions on matrix manifolds
- Solution of Linear Systems and Matrix Inversion in the TT-Format
- Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
- Tensor completion in hierarchical tensor representations
- Tensor-train decomposition
- The alternating linear scheme for tensor optimization in the tensor train format
- The geometry of algorithms using hierarchical tensors
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Time integration of tensor trains
- TT-cross approximation for multidimensional arrays
Cited in
(57)- Block tensor train decomposition for missing data estimation
- Efficient Weingarten map and curvature estimation on manifolds
- Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
- Efficient low-rank regularization-based algorithms combining advanced techniques for solving tensor completion problems with application to color image recovering
- Particle number conservation and block structures in matrix product states
- Guarantees of Riemannian optimization for low rank matrix completion
- Symplectic dynamical low rank approximation of wave equations with random parameters
- Low-rank Riemannian eigensolver for high-dimensional Hamiltonians
- Stable als approximation in the TT-format for rank-adaptive tensor completion
- Optimization on the hierarchical Tucker manifold - applications to tensor completion
- An approximation method of CP rank for third-order tensor completion
- Low-rank approximation and completion of positive tensors
- Constrained optimization with low-rank tensors and applications to parametric problems with PDEs
- A Riemannian trust-region method for low-rank tensor completion.
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds
- Low-rank tensor completion by Riemannian optimization
- Tensor algorithms for advanced sensitivity metrics
- Riemannian multigrid line search for low-rank problems
- scientific article; zbMATH DE number 7626702 (Why is no real title available?)
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- Automatic differentiation for Riemannian optimization on low-rank matrix and tensor-train manifolds
- Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing
- Multiresolution low-rank tensor formats
- Tensor Completion via Gaussian Process--Based Initialization
- Chebfun in Three Dimensions
- A Riemannian trust region method for the canonical tensor rank approximation problem
- Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
- The Condition Number of Riemannian Approximation Problems
- New Riemannian preconditioned algorithms for tensor completion via polyadic decomposition
- Tensor completion using geodesics on Segre 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
- Riemannian conjugate gradient method for low-rank tensor completion
- 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
- Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition
- Practical gradient and conjugate gradient methods on flag manifolds
- Riemannian preconditioned coordinate descent for low multilinear rank approximation
- A Riemannian dimension-reduced second-order method with application in sensor network localization
- From low-rank retractions to dynamical low-rank approximation and back
- Convergence and worst-case complexity of adaptive Riemannian trust-region methods for optimization on manifolds
- Implicit low-rank Riemannian schemes for the time integration of stiff partial differential equations
- Optimization on the extended tensor-train manifold with shared factors
- Riemannian preconditioning algorithms for the low-rank tensor completion via the triple decomposition
- Computation over t-product based tensor Stiefel manifold: a preliminary study
- Low-rank optimization on Tucker tensor varieties
- Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay
- Robust completion for rank-1 tensors with noises
- Conformalized Tensor Completion with Riemannian Optimization
- Low-Rank Tensor Completion using Tensor Train Decomposition via Riemannian Optimization on the Quotient Geometry
- Statistical inference in tensor completion: optimal uncertainty quantification and statistical-to-computational gaps
- Generative modeling via hierarchical tensor sketching
- 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
This page was built for publication: Riemannian optimization for high-dimensional tensor completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830626)
