Login / Signup
Proximal Online Gradient Is Optimum for Dynamic Regret: A General Lower Bound.
Yawei Zhao
Shuang Qiu
Kuan Li
Lailong Luo
Jianping Yin
Ji Liu
Published in:
IEEE Trans. Neural Networks Learn. Syst. (2022)
Keyphrases
</>
lower bound
online algorithms
upper bound
online learning
special case
worst case
closely related
np hard
dynamic environments
branch and bound algorithm
lower and upper bounds
objective function
real time
e learning
global optimum