activity
20182026
most citedProjection-free Distributed Online Learning with Sublinear Communication Complexity

7 citations · 25 across the 24 of their papers we have counts for

collaborators
Showing 2026Show all

8 papers · 1 filter

math.OC2026

Group Distributionally Robust Optimization over Decentralized Networks

Haomin Bai, Junyan Sun, Quan Cheng +2

We study group distributionally robust optimization (GDRO) over decentralized networks, where workers collaborate to learn robust models by minimizing the maximum local risk. Exist…

cs.LG2026

Efficient Preconditioned Optimization Methods with Frequent Directions

Sifan Yang, Yuanyu Wan, Yibo Wang +1

Adaptive optimization methods have received considerable attention in recent years due to their strong empirical performance. However, they generally require maintaining a precondi…

math.OC2026

Dimension-Free Decentralized Nonsmooth Nonconvex Stochastic Optimization

Yuanyu Wan, Lan Xue, Haomin Bai +2

We investigate decentralized nonsmooth nonconvex stochastic optimization over a network of nodes, with the goal of finding an -Goldstein stationary point. The best exist…

cs.LG2026

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

Yibo Wang, Wenhao Yang, Sifan Yang +3

In non-stationary online learning, dynamic regret has attracted increasing attention as a measure of how well an online learner performs against a time-varying comparator sequence.…

cs.LG2026

Revisiting Decentralized Online Convex Optimization with Compressed Communication

Hao Zhou, Xiaoyu Wang, Chang Yao +2

Decentralized online convex optimization (D-OCO) is a popular framework for distributed applications with streaming data. To tackle the communication bottleneck, previous studies h…

cs.LG2026

Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions

Yuanyu Wan, Yu Shen, Dingzhi Yu +2

To expand the applicability of decentralized online learning, previous studies have proposed several algorithms for decentralized online continuous submodular maximization (D-OCSM)…

cs.LG2026

Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise

Dingzhi Yu, Hongyi Tao, Yuanyu Wan +2

While adaptive gradient methods are the workhorse of modern machine learning, sign-based optimization algorithms such as Lion and Muon have recently demonstrated superior empirical…

cs.CV2026

Deep But Reliable: Advancing Multi-turn Reasoning for Thinking with Images

Wenhao Yang, Yu Xia, Jinlong Huang +7

Recent advances in large Vision-Language Models (VLMs) have exhibited strong reasoning capabilities on complex visual tasks by thinking with images in their Chain-of-Thought (CoT),…