Skip to content

11 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Revisiting Smoothed Online Learning: Competitive Ratio, Dynamic Regret with Switching Cost, and Best of Both Worlds

We revisit smoothed online learning and develop algorithms with improved competitive ratios, optimal dynamic regret with switching cost, and best-of-both-worlds guarantees. Surprisingly, minimizing the hitting cost alone is $\max(1,\frac{2}{\alpha})$-competitive for $\alpha$-polyhedral functions under the $\ell_2$-norm...

Lijun Zhang, Lin-Zhe He, Wei Jiang et al. · 0 citations
Preprint Oct 2026

Variance Reduction with Delayed Feedback for Non-Convex Optimization

We study variance reduction for non-convex optimization when gradient evaluations return with a delay. The server can update the parameter while earlier evaluations remain unfinished. We first analyze an ordered recursive momentum estimator for stochastic optimization. Under average smoothness and bounded variance, its...

Wei Jiang, Ding-Zhi Yu, Ze-Chao Li · 0 citations
Preprint Oct 2026

Optimal Regret for Communication-Efficient Decentralized Online Learning

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
#machine learning Preprint Oct 2026

Last-Iterate Convergence of Clipped SGD with Linear Decay

In this paper, we study the last-iterate convergence of clipped stochastic gradient descent under heavy-tailed noise. We assume that the stochastic gradients are unbiased and that the noise has a bounded central $p$-th moment, where $1<p\le2$. For smooth convex objectives, a linearly decreasing learning rate gives a hi...

Wei Jiang, Hao-Min Bai, Ze-Chao Li · 1 citation · ⚡1
#machine learning Preprint Oct 2026

Adaptive Variance Reduction without Knowing Oracle Smoothness

Variance reduction improves the convergence rate of stochastic non-convex optimization under the average smoothness condition. Existing adaptive variance reduction methods are especially designed for average smoothness and do not adapt to standard smoothness. In this paper, we study how one algorithm can adapt to these...

Wei Jiang, Yi-Bo Wang, Ze-Chao Li · 0 citations
#machine learning Preprint Oct 2026

Convergence Analysis of STORM Under Different Geometries

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
#machine learning Preprint Oct 2026

Optimal Momentum Methods for Stochastic Multilevel Compositional Optimization

A momentum-based estimator with mini-batches is employed to track the function values of each level, which are subsequently used to construct momentum gradient estimators, and a batch-free method that incorporates a first-order approximation and a clipping technique for function value estimation is developed.

Wei Jiang, Rui Yan, Si-Fan Yang et al. · 0 citations
#machine learning Preprint Sep 2026

From Switching to Dynamic Regret: A Simple Reduction via Unbiased Random Sequences

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
#machine learning Preprint Sep 2026

Revisiting Distributed Sign-Based Variance Reduction

This paper solves the problem of sign-based variance reduction methods' failure to obtain optimal convergence rates for both nonconvex stochastic and finite-sum optimization, and proposes tracking the global gradient at the server through unbiased compression of recursive gradient increments.

Wei Jiang, Ze-Chao Li, Li-Jun Zhang · 0 citations
#machine learning Preprint Sep 2026

Projection-Free Multi-level Algorithms for Stochastic Constrained Compositional Optimization

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
#machine learning Preprint Sep 2026

Solving Finite-sum Coupled Compositional Optimization via Multi-block-Single-probe Estimator

Traditional variance reduction methods (e.g., SPIDER, SARAH, STORM) have been extensively investigated for improving the convergence rates of stochastic optimization. These techniques typically maintain a sequence of estimators for a single function (or gradient) across iterations. However, what if we need to track mul...

Wei Jiang, Si-Fan Yang, Yi-Bo Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.