Entrywise tensor-train approximation of large tensors via random embeddings

DOI10.1137/24M1649186MaRDI QIDQ6993632zbMATH OpenFDO

Authors Stanislav S. Budzinskiy

Publication date 25 April 2025

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1649186

zbMATH Keywords

alternating projectionscoherencefactorization normHanson-Wright inequalitymaximum normtensor train

Mathematics Subject Classification ID

Factorization of matrices (15A23) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55) Numerical optimization and variational techniques (65K10)

Cites work

• 1-bit tensor completion via max-and-nuclear-norm composite optimization
• A new scheme for the tensor representation
• An elementary and unified proof of Grothendieck's inequality
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• Complexity measures of sign matrices
• Deterministic tensor completion with hypergraph expanders
• Estimates of moments and tails of Gaussian chaoses
• Exact matrix completion via convex optimization
• Factorization norms and hereditary discrepancy
• Grothendieck’s Theorem, past and present
• Hierarchical Singular Value Decomposition of Tensors
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 194266 (Why is no real title available?)
• scientific article; zbMATH DE number 635657 (Why is no real title available?)
• Learning Theory
• Low-rank matrix approximation in the infinity norm
• Low-rank nonnegative tensor approximation via alternating projections and sketching
• Lower bounds in communication complexity based on factorization norms
• Matrix completion via max-norm constrained optimization
• Near-optimal sample complexity for convex tensor completion
• On manifolds of tensors of fixed TT-rank
• On the distance to low-rank matrices in the maximum norm
• On the optimal rank-1 approximation of matrices in the Chebyshev norm
• Operator norm inequalities between tensor unfoldings on the partition lattice
• Tensor Decompositions and Applications
• Tensor train completion: Local recovery guarantees via Riemannian optimization
• Tensor-train decomposition
• The approximate rank of a matrix and its algorithmic applications
• The density-matrix renormalization group in the age of matrix product states
• The expression of a tensor or a polyadic as a sum of products.
• The Hanson-Wright inequality for random tensors
• Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns
• Why Are Big Data Matrices Approximately Low Rank?

Cited in

(2)

• Quasioptimal alternating projections and their use in low-rank approximation of matrices and tensors
• When big data actually are low-rank, or entrywise approximation of certain function-generated matrices

This page was built for publication: Entrywise tensor-train approximation of large tensors via random embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993632)