Research map / Learning theory and algorithms / Matrix and tensor methods
An Embarrassingly Simple Way to Optimize Orthogonal Matrices at Scale
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
- On orthogonality and learning recurrent networks with long term dependencies (ICML 2017 · similarity 0.85)
- On the Crucial Role of Initialization for Matrix Factorization (ICLR 2025 · similarity 0.83)
- Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization (NeurIPS 2026 · similarity 0.83)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.82)
- Searching for Efficient Linear Layers over a Continuous Space of Structured Matrices (NeurIPS 2024 · similarity 0.82)
- Compress to Impress: Efficient LLM Adaptation Using a Single Gradient Step on 100 Samples (NeurIPS 2025 · similarity 0.82)
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.