Ben Liang
6 papers · 2020–2026 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓
๐
Conference Polyglot
(4)
๐
Academic Marathon
(5)
๐
Interdisciplinary Bridge
๐งญ
Keyword Pioneer
๐
Cross-Pollinator
(9)
Conferences
L4DC (2)
AAAI (1)
ICML (1)
JMLR (1)
UAI (1)
Top co-authors
Keywords
dynamic regret
(2)
online optimization
(2)
stochastic gradient descent
(1)
distributed learning
(1)
distributed optimization
(1)
resource allocation
(1)
mirror descent
(1)
optimization theory
(1)
online mirror descent
(1)
generalization bound
(1)
regret bound
(1)
momentum method
(1)
competitive ratio
(1)
min-max optimization
(1)
online matching
(1)
knapsack problem
(1)
bandwidth allocation
(1)
consensus algorithm
(1)
heterogeneous network
(1)
distributed online optimization
(1)
Papers
Online Capacitated General Matching with Knapsack
AAAI 2026
Online Generalized Magicianโs Problem with Multiple Workers
UAI 2025
On the Generalization of Stochastic Gradient Descent with Momentum
JMLR 2024
Gradient and Projection Free Distributed Online Min-Max Resource Optimization
L4DC 2022
Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual Information
L4DC 2022
Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent
ICML 2020