Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.

DOI10.1093/imaiai/iav004zbMath1386.94036arXiv1005.4732OpenAlexW2000134594MaRDI QIDQ4603696

No author found.

Publication date: 19 February 2018

Published in: Information and Inference (Search for Journal in Brave)

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

zbMATH Keywords

tensortensor normrandom tensortensor sparsificationfast tensor computation

Mathematics Subject Classification ID

Related Items (9)

Randomized algorithms for the approximations of Tucker and the tensor train decompositions ⋮ Functional norms, condition numbers and numerical algorithms in algebraic geometry ⋮ Explicit lower and upper bounds on the entangled value of multiplayer XOR games ⋮ Marchenko–Pastur law with relaxed independence conditions ⋮ Comparison of matrix norm sparsification ⋮ On Orthogonal Tensors and Best Rank-One Approximation Ratio ⋮ Z-singular value and Z-singular value inclusion sets for tensors ⋮ Sparse random tensors: concentration, regularization and applications ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor Decompositions and Applications
• CUR matrix decompositions for improved data analysis
• Sums of random Hermitian matrices and an inequality by Rudelson
• Spectral norm of products of random and deterministic matrices
• A randomized algorithm for a tensor-based generalization of the singular value decomposition
• The eigenvalues of random symmetric matrices
• Random sampling and approximation of MAX-CSPs
• A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
• Exact matrix completion via convex optimization
• Orthogonal Tensor Decompositions
• Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
• Fast computation of low-rank matrix approximations
• Tensor decomposition and approximation schemes for constraint satisfaction problems
• A Fast Random Sampling Algorithm for Sparsifying Matrices
• Relative-Error $CUR$ Matrix Decompositions
• Smallest singular value of a random rectangular matrix
• A Multilinear Singular Value Decomposition
• On the Best Rank-1 and Rank-(R₁ ,R₂ ,. . .,R_N) Approximation of Higher-Order Tensors
• Strong converse for identification via quantum channels
• A fast and efficient algorithm for low-rank approximation of a matrix
• Twice-ramanujan sparsifiers
• Fast computation of low rank matrix approximations
• Spectral analysis of data
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Tensor-CUR Decompositions for Tensor-Based Data
• An Introduction to Matrix Concentration Inequalities

This page was built for publication: Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.