1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
Non-Euclidean High-Order Smooth Convex Optimization
Juan Pablo Contreras, Cristóbal Guzmán, David Martínez-Rubio
We develop algorithms for the optimization of convex objectives that have Hölder continuous -th derivatives by using a -th order oracle, for any . Our algorithms wo…
Convergence and Trade-Offs in Riemannian Gradient Descent and Riemannian Proximal Point
David Martínez-Rubio, Christophe Roux, Sebastian Pokutta
In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. W…
Open Problem: Polynomial linearly-convergent method for geodesically convex optimization?
Christopher Criscitiello, David Martínez-Rubio, Nicolas Boumal
Let be a Lipschitz and geodesically convex function defined on a -dimensional Riemannian manifold . Does there exist a first-o…
Accelerated and Sparse Algorithms for Approximate Personalized PageRank and Beyond
David Martínez-Rubio, Elias Wirth, Sebastian Pokutta
It has recently been shown that ISTA, an unaccelerated optimization method, presents sparse updates for the -regularized personalized PageRank problem, leading to cheap ite…