Old Web
English
Sign In
Acemap
>
Paper
>
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds
Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds
2020
Nicholas J. A. Harvey
Christopher Liaw
Tasuku Soma
Keywords:
Mathematical optimization
Regret
first order
Computer science
submodular maximization
Correction
Source
Cite
Save
Machine Reading By IdeaReader
27
References
1
Citations
NaN
KQI
[]