6 citations · 17 across the 29 of their papers we have counts for
4 papers · 1 filter
Orthogonal Directions Constrained Gradient Method: from non-linear equality constraints to Stiefel manifold
Sholom Schechtman, Daniil Tiapkin, Michael Muehlebach +1
We consider the problem of minimizing a non-convex function over a smooth manifold . We propose a novel algorithm, the Orthogonal Directions Constrained Gradient Metho…
Primal-Dual Stochastic Mirror Descent for MDPs
Daniil Tiapkin, Alexander Gasnikov
We consider the problem of learning the optimal policy for infinite-horizon Markov decision processes (MDPs). For this purpose, some variant of Stochastic Mirror Descent is propose…
Improved Complexity Bounds in Wasserstein Barycenter Problem
Darina Dvinskikh, Daniil Tiapkin
In this paper, we focus on computational aspects of the Wasserstein barycenter problem. We propose two algorithms to compute Wasserstein barycenters of discrete measures of siz…
Stochastic Saddle-Point Optimization for Wasserstein Barycenters
Daniil Tiapkin, Alexander Gasnikov, Pavel Dvurechensky
We consider the population Wasserstein barycenter problem for random probability measures supported on a finite set of points and generated by an online stream of data. This leads…