Ben Liang
6 papers · 2020–2026 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
🌍
Conference Polyglot · Silver
🏃
Academic Marathon · Sprint
🌉
Interdisciplinary Bridge · Bronze
🐣
Hot Topic Early Bird
Top co-authors
Research topics
Keywords
dynamic regret
(2)
competitive ratio
(2)
online optimization
(2)
resource allocation
(2)
distributed optimization
(1)
mirror descent
(1)
optimization theory
(1)
online mirror descent
(1)
generalization bound
(1)
regret bound
(1)
online algorithm
(1)
momentum method
(1)
min-max optimization
(1)
online matching
(1)
knapsack problem
(1)
bandwidth allocation
(1)
consensus algorithm
(1)
heterogeneous network
(1)
distributed online optimization
(1)
stochastic resource consumption
(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