AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

On the Riemannian Search for Eigenvector Computation

Zhiqiang Xu, Ping Li

JMLR 2021 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add shift-and-invert preconditioning to Riemannian gradient eigensolver (ablation)rgEIGS · synthetic standard eigenvector problemsconvergence of sin2 angleImproved
use Barzilai-Borwein step-sizes instead of constant hand-tuned step-sizesSI-rgEIGS · real sparse matriceswall-clock convergenceImproved
use smaller shift parameter sigma closer to lambda1 (ablation)SI-rgEIGS · synthetic dataconvergence speedImproved
replace Riemannian search SI-rgGenEIGS with projection SI-PM-gengeneralized eigenvalue problems · Lapla3 and Lapla5convergenceHurt
use Lanczos instead of SI-rgEIGSlow-rank real matrix with multiplicity 15 · ch7 matrixrunning timeImproved
add shift-and-invert preconditioning to Riemannian search for CCASI-rgGenEIGS vs CCALin · CCA on JW11 and MNISTconvergenceImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy