◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Mingli Song

6 papers hereh-index 442 citations11 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author3
  • last author3

Across the 6 of 6 papers where every author was matched, so the position is known.

fields
  • cs.LG4
  • cs.CV2
same name
  • Mingli Song — 53 papers, h 51
  • Mingli Song — 46 papers, h 21
  • Mingli Song — 21 papers, h 8
  • Mingli Song — 18 papers, h 7
  • Mingli Song — 9 papers, h 4
  • Mingli Song — 5 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20242026
most citedOptimal and Efficient Algorithms for Decentralized Online Convex Optimization

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

collaborators
Showing cs.LGShow all

4 papers · 1 filter

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.LG2024★ 2 cited

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization

Yuanyu Wan, Tong Wei, Bo Xue +2

We investigate decentralized online convex optimization (D-OCO), in which a set of local learners are required to minimize a sequence of global loss functions using only local comp…

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 n,T,dˉ denote the di…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.