Placeholder text
Riemannian Online Learning
By Xi Wang
0 - Default Title
Description
This monograph offers a comprehensive overview of online learning over Riemannian manifolds, and offers a unified overview of the state-of-the-art algorithms for online optimization over Riemannian manifolds. Also presented is a detailed and systematic analysis of achievable regret for those algorithms. The study emphasizes how the curvature of manifolds influences the trade-off between exploration and exploitation, and the performance of the algorithms.
After an introduction, Section 2 briefly introduces Riemannian manifolds, together with the preliminary knowledge of Riemannian optimization and Euclidean online optimization. In Section 3, the fundamental Riemannian online gradient descent algorithm under full information feedback is presented, and the achievable regret on both Hadamard manifolds and general manifolds is analyzed. Section 4 extends the Riemannian online gradient descent algorithm to the bandit feedback setting. In Sections 5 and 6, the authors turn to two advanced Riemannian online optimization algorithms designed for dynamic regret minimization, the Riemannian online extra gradient descent and the Riemannian online optimistic gradient descent.
Product details
Binding:
Paperback
Number of Pages:
172
Release Date:
2025-09-01
Publication Date:
2025-09-01
Publisher:
Now Publishers Inc
Languages:
Original:
English
ISBN10:
1638286108
ISBN13:
9781638286103
GPSR Manufacturer Reference:
Weight:
272 g
Height:
156 cm
Width:
234 cm
Thickness:
10 cm
Currently sold out