Riemannian coordinate descent algorithms on matrix manifolds
<|reference_start|>Riemannian coordinate descent algorithms on matrix manifolds: Many machine learning applications are naturally formulated as optimization problems on Riemannian manifolds. The main idea behind Riemannian optimization is to maintain the feasibility of the variables while moving along a descent direction on the manifold. This results in updating all the variables at every iteration. In this work, we provide a general framework for developing computationally efficient coordinate descent (CD) algorithms on matrix manifolds that allows updating only a few variables at every iteration while adhering to the manifold constraint. In particular, we propose CD algorithms for various manifolds such as Stiefel, Grassmann, (generalized) hyperbolic, symplectic, and symmetric positive (semi)definite. While the cost per iteration of the proposed CD algorithms is low, we further develop a more efficient variant via a first-order approximation of the objective function. We analyze their convergence and complexity, and empirically illustrate their efficacy in several applications.<|reference_end|>
@article{han2024riemannian,
    title={Riemannian coordinate descent algorithms on matrix manifolds},
    author={Andi Han, Pratik Jawanpuria, Bamdev Mishra},
    journal={arXiv preprint arXiv:2406.02225},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.02225},
    primaryClass={math.OC cs.LG stat.ML}
}