Research map / Learning theory and algorithms / Matrix and tensor methods
Exponentially Convergent Algorithms for Supervised Matrix Factorization
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
- Supervised Matrix Factorization: Local Landscape Analysis and Applications (ICML 2024 · similarity 0.91)
- Statistically Optimal $K$-means Clustering via Nonnegative Low-rank Semidefinite Programming (ICLR 2024 · similarity 0.86)
- Compress to Impress: Efficient LLM Adaptation Using a Single Gradient Step on 100 Samples (NeurIPS 2025 · similarity 0.85)
- FasMe: Fast and Sample-efficient Meta Estimator for Precision Matrix Learning in Small Sample Settings (NeurIPS 2024 · similarity 0.84)
- Federated Binary Matrix Factorization Using Proximal Optimization (AAAI 2025 · similarity 0.84)
- On the Crucial Role of Initialization for Matrix Factorization (ICLR 2025 · similarity 0.84)
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.