activity
20222026
most citedImproved Regret for Bandit Convex Optimization with Delayed Feedback

1 citations · 2 across the 5 of their papers we have counts for

collaborators

6 papers

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.CV2025

Boosting MLLM Reasoning with Text-Debiased Hint-GRPO

Qihan Huang, Weilong Dai, Jinlong Liu +6

MLLM reasoning has drawn widespread research for its excellent problem-solving capability. Current reasoning methods fall into two types: PRM, which supervises the intermediate rea…

cs.LG2024★ 1 cited

Improved Regret for Bandit Convex Optimization with Delayed Feedback

Yuanyu Wan, Chang Yao, Mingli Song +1

We investigate bandit convex optimization (BCO) with delayed feedback, where only the loss value of the action is revealed under an arbitrary delay. Let denote the di…

cs.LG2023

Improved Projection-free Online Continuous Submodular Maximization

Yucheng Liao, Yuanyu Wan, Chang Yao +1

We investigate the problem of online learning with monotone and continuous DR-submodular reward functions, which has received great attention recently. To efficiently handle this p…

cs.LG2023

Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting

Yuanyu Wan, Chang Yao, Yitao Ma +2

Although online convex optimization (OCO) under arbitrary delays has received increasing attention recently, previous studies focus on stationary environments with the goal of mini…

cs.LG2022★ 1 cited

Projection-free Online Learning with Arbitrary Delays

Yuanyu Wan, Yibo Wang, Chang Yao +2

Projection-free online learning, which eschews the projection operation via less expensive computations such as linear optimization (LO), has received much interest recently due to…