加入
A fast ellipsoid-like method for geodesically convex optimization
Find a first-order method for geodesically convex optimization with query count logarithmic in 1/ε and cheap iterations.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "learning-theory", |
| 5 | "algorithms-complexity" |
| 6 | ], |
| 7 | "type": "algorithm", |
| 8 | "also": [ |
| 9 | "proof" |
| 10 | ], |
| 11 | "source": { |
| 12 | "key": "colt", |
| 13 | "name": "COLT open problems", |
| 14 | "url": "https://proceedings.mlr.press/v195/criscitiello23b.html", |
| 15 | "id": "v195/criscitiello23b", |
| 16 | "curator": "Conference on Learning Theory (COLT)", |
| 17 | "poser": "Christopher Criscitiello, David Martínez-Rubio and Nicolas Boumal", |
| 18 | "status": "open", |
| 19 | "as_of": "2026-10-20", |
| 20 | "catalog": "0521c19bbd38" |
| 21 | }, |
| 22 | "review": true, |
| 23 | "approval": "first-time" |
| 24 | } |