On Busemann subgradient methods for stochastic minimization in Hadamard spaces
Nicholas Pischke
TL;DR
The paper extends the Busemann-subgradient method to stochastic minimization of $F(x)=\int f(e,x)\,d\mu(e)$ over closed convex subsets of separable Hadamard spaces, enabling optimization beyond linear spaces. It develops a general weak convergence theory for stochastic processes in Hadamard spaces via a stochastic quasi-Fejér monotonicity framework and a nonlinear Pettis-type measurability result, and then specializes to the SB method with measurability guarantees. Under local compactness of the space, SB is shown to converge strongly to a minimizer; under the weaker $(\overline{Q}_4)$ condition, the ergodic averages converge weakly to a minimizer, with additional strong-convexity assumptions yielding explicit convergence rates. The work broadens stochastic convex optimization tools to nonlinear metric spaces and provides foundational results (including a nonlinear Pettis-type theorem) that may impact related stochastic methods on CAT$(0)$ spaces.
Abstract
We study the recently introduced Busemann subgradient method due to Goodwin, Lewis, Nicolae and López-Acedo, extending it to minimize the mean of a stochastic function over general Hadamard spaces. We prove a strong convergence theorem under a local compactness assumption and further prove weak ergodic convergence of the method over Hadamard spaces satisfying condition $(\overline{Q}_4)$, a slight extension of the $(Q_4)$ condition of Kirk and Payanak, which in particular includes Hilbert spaces, $\mathbb{R}$-trees and spaces of constant curvature. The proof is based on a general (weak) convergence theorem for stochastic processes in Hadamard spaces which confine to a stochastic variant of quasi-Fejér monotonicity, together with a nonlinear variant of Pettis' theorem, which are of independent interest. Lastly, we provide a strong convergence result under a strong convexity assumption, and in that case in particular derive explicit rates of convergence.
