Research map / Learning theory and algorithms / Matrix and tensor methods
Hardness of Low Rank Approximation of Entrywise Transformed Matrix Products
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Entrywise error bounds for low-rank approximations of kernel matrices (NeurIPS 2024 · similarity 0.88)
- Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time (ICLR 2024 · similarity 0.88)
- The Structural Complexity of Matrix-Vector Multiplication (NeurIPS 2025 · similarity 0.87)
- Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation (ICLR 2025 · similarity 0.87)
- Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy (NeurIPS 2025 · similarity 0.87)
- Perturbation Bounds for Low-Rank Inverse Approximations under Noise (NeurIPS 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.