3 papers
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)…
math.OC2025
Improved Analysis for Sign-based Methods with Momentum Updates
Wei Jiang, Dingzhi Yu, Sifan Yang +2
In this paper, we present enhanced analysis for sign-based optimization algorithms with momentum updates. Traditional sign-based methods, under the separable smoothness assumption,…
cs.LG2025
Group Distributionally Robust Optimization with Flexible Sample Queries
Haomin Bai, Dingzhi Yu, Shuai Li +2
Group distributionally robust optimization (GDRO) aims to develop models that perform well across distributions simultaneously. Existing GDRO algorithms can only process a fixe…