Riemannian Dueling Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910035650543616 |
|---|---|
| author | Ren, Yuxuan Roy, Abhishek Ma, Shiqian |
| author_facet | Ren, Yuxuan Roy, Abhishek Ma, Shiqian |
| contents | Dueling optimization considers optimizing an objective with access to only a comparison oracle of the objective function. It finds important applications in emerging fields such as recommendation systems and robotics. Existing works on dueling optimization mainly focused on unconstrained problems in the Euclidean space. In this work, we study dueling optimization over Riemannian manifolds, which covers important applications that cannot be solved by existing dueling optimization algorithms. In particular, we propose a Riemannian Dueling Normalized Gradient Descent (RDNGD) method and establish its iteration complexity when the objective function is geodesically L-smooth or geodesically (strongly) convex. We also propose a projection-free algorithm, named Riemannian Dueling Frank-Wolfe (RDFW) method, to deal with the situation where projection is prohibited. We establish the iteration and oracle complexities for RDFW. We illustrate the effectiveness of the proposed algorithms through numerical experiments on both synthetic and real applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_00023 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Riemannian Dueling Optimization Ren, Yuxuan Roy, Abhishek Ma, Shiqian Optimization and Control Machine Learning Dueling optimization considers optimizing an objective with access to only a comparison oracle of the objective function. It finds important applications in emerging fields such as recommendation systems and robotics. Existing works on dueling optimization mainly focused on unconstrained problems in the Euclidean space. In this work, we study dueling optimization over Riemannian manifolds, which covers important applications that cannot be solved by existing dueling optimization algorithms. In particular, we propose a Riemannian Dueling Normalized Gradient Descent (RDNGD) method and establish its iteration complexity when the objective function is geodesically L-smooth or geodesically (strongly) convex. We also propose a projection-free algorithm, named Riemannian Dueling Frank-Wolfe (RDFW) method, to deal with the situation where projection is prohibited. We establish the iteration and oracle complexities for RDFW. We illustrate the effectiveness of the proposed algorithms through numerical experiments on both synthetic and real applications. |
| title | Riemannian Dueling Optimization |
| topic | Optimization and Control Machine Learning |
| url | https://arxiv.org/abs/2603.00023 |