Research map / Optimization / Nonconvex and smooth optimization
Scale Invariant Power Iteration
Cheolmin Kim, Youngseok Kim, Diego Klabjan
Read the paperCheck your idea against 137,217 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
- Tight Convergence Rate Bounds for Optimization Under Power Law Spectral Conditions (JMLR 2024 · similarity 0.86)
- Preconditioning Matters: Fast Global Convergence of Non-convex Matrix Factorization via Scaled Gradient Descent (NeurIPS 2023 · similarity 0.86)
- Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression (NeurIPS 2018 · similarity 0.85)
- Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis (ICML 2016 · similarity 0.85)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.85)
- Tuning-Free Bilevel Optimization: New Algorithms and Convergence Analysis (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.
