Implicit Riemannian Optimism with Applications to Min-Max Problems
We introduce a Riemannian optimistic online learning algorithm for Hadamard manifolds based on inexact implicit updates. Unlike prior work, our method can handle in-manifold constraints, and matches the best known regret bounds in the Euclidean setting with no dependence on geometric constants, like the minimum curvature. Building on this, we develop algorithms for g-convex, g-concave smooth min-max problems on Hadamard manifolds. Notably, one method nearly matches the gradient oracle complexity of the lower bound for Euclidean problems, for the first time.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Implicit Riemannian Concave Potential Maps
We are interested in the challenging problem of modelling densities on Riemannian manifolds with a known symmetry group using normalising flows. This has many potential applications in physical sciences such as molecular…
Density EstimationNormalising FlowsRiemannian adaptive stochastic gradient algorithms on matrix manifolds
Adaptive stochastic gradient algorithms in the Euclidean space have attracted much attention lately. Such explorations on Riemannian manifolds, on the other hand, are relatively new, limited, and challenging. This is bec…
Supervised Optimism Correction: Be Confident When LLMs Are Sure
In this work, we establish a novel theoretical connection between supervised fine-tuning and offline reinforcement learning under the token-level Markov decision process, revealing that large language models indeed learn…
GSM8KMathMathematical ReasoningLanding with the Score: Riemannian Optimization through Denoising
Under the data manifold hypothesis, high-dimensional data are concentrated near a low-dimensional manifold. We study the problem of Riemannian optimization over such manifolds when they are given only implicitly through …
Block-Coordinate Minimization for Large SDPs with Block-Diagonal Constraints
The so-called Burer-Monteiro method is a well-studied technique for solving large-scale semidefinite programs (SDPs) via low-rank factorization. The main idea is to solve rank-restricted, albeit non-convex, surrogates in…
Riemannian optimization