In this paper, we investigate decentralized online convex optimization with compressed communication, where $n$ learners over a network jointly minimize a sequence of global loss functions based only on their local losses and compressed messages from their neighbors. The best known regret bounds for this problem are $O...
Si-Fan Yang, Wen-Hao Yang, Wei Jiang et al.· 0 citations
Stochastic recursive momentum (STORM) achieves fast convergence for nonconvex optimization via the variance reduction effect, but existing analyses rely on the strong average smoothness assumption. In this paper, we study the convergence of STORM for different objectives without average smoothness. We first revisit the...
Wei Jiang, Yi-Bo Wang, Wen-Hao Yang et al.· 0 citations
A framework that reduces dynamic regret minimization to switching regret minimization is presented, which can derive dynamic regret bounds by using off-the-shelf algorithms with switching regret guarantees and all the findings match the minimax optimal results for these three types of losses.
Yi-Bo Wang, Wen-Hao Yang, Si-Fan Yang et al.· 1 citation
This paper studies projection-free algorithms for stochastic constrained multi-level compositional optimization and proposes variance-reduced projection-free algorithms and establishes complexity guarantees under both the Frank-Wolfe gap and the gradient mapping criteria.
Wei Jiang, Si-Fan Yang, Wen-Hao Yang et al.· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.