1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.LG2022
Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions
Nima Eshraghi, Ben Liang
The performance of online convex optimization algorithms in a dynamic environment is often expressed in terms of the dynamic regret, which measures the decision maker's performance…
cs.IT2022★ 1 cited
Online Distributed Coordinated Precoding for Virtualized MIMO Networks with Delayed CSI
Juncheng Wang, Ben Liang, Min Dong +2
We consider online wireless network virtualization (WNV) in a multi-cell multiple-input multiple output (MIMO) system with delayed feedback of channel state information (CSI). Mult…
cs.LG2021
On the Generalization of Stochastic Gradient Descent with Momentum
Ali Ramezani-Kebrya, Ashish Khisti, Ben Liang
While momentum-based methods, in conjunction with stochastic gradient descent (SGD), are widely used when training machine learning models, there is little theoretical understandin…