Deterministic Tensor Completion with Hypergraph Expanders
From MaRDI portal
Publication:5162629
DOI10.1137/20M1379745zbMath1476.15041arXiv1910.10692OpenAlexW3204668058MaRDI QIDQ5162629
Kameron Decker Harris, Yizhe Zhu
Publication date: 3 November 2021
Published in: SIAM Journal on Mathematics of Data Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.10692
Applications of graph theory (05C90) Hypergraphs (05C65) Multilinear algebra, tensor calculus (15A69) Expander graphs (05C48)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Inverse expander mixing for hypergraphs
- Matrix completion via max-norm constrained optimization
- On tensor completion via nuclear norm minimization
- Lifts, discrepancy and nearly optimal spectral gap
- Complexity measures of sign matrices
- Eigenvalues and expanders
- On codes from hypergraphs.
- Cross: efficient low-rank tensor completion
- On the second eigenvalue of hypergraphs
- Derandomized graph products
- Interlacing eigenvalues and graphs
- Large incidence-free sets in geometries
- On polynomial time methods for exact low-rank tensor completion
- Sparse random tensors: concentration, regularization and applications
- Spectra of random regular hypergraphs
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Noisy low-rank matrix completion with general sampling distribution
- Deterministic algorithms for matrix completion
- A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
- Tensor completion and low-n-rank tensor recovery via convex optimization
- Expander graphs and their applications
- The dimension of Euclidean subspaces of quasi-normed spaces
- Eigenvalues and expansion of regular graphs
- Nuclear norm of higher-order tensors
- Spectral Algorithms for Tensor Completion
- Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns
- Near-optimal sample complexity for convex tensor completion
- Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs: Exact and Stable Recovery
- HIGH DIMENSIONAL EXPANDERS
- A Deterministic Theory of Low Rank Matrix Completion
- Explicit near-Ramanujan graphs of every degree
- Factorization Norms and Hereditary Discrepancy
- Matrix Completion From a Few Entries
- Mixing in High-Dimensional Expanders
- Most Tensor Problems Are NP-Hard
- A Simpler Approach to Matrix Completion
- Learning Theory
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS
This page was built for publication: Deterministic Tensor Completion with Hypergraph Expanders
