Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret

DOI10.1007/978-3-031-22105-7_11MaRDI QIDQ6168935zbMATH OpenFDO

Authors Jun-Kai Feng, Ruiqi Yang, Hai-Bin Zhang, Zhenning Zhang

Publication date 10 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

online optimizationvariance reductionregretapproximation ratioDR-submodularity

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 7255156 (Why is no real title available?)
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Maximizing a monotone submodular function subject to a matroid constraint
• Robust budget allocation via continuous submodular functions

Cited in

(2)

• scientific article; zbMATH DE number 7255156 (Why is no real title available?)
• A bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave

This page was built for publication: Online non-monotone DR-submodular maximization: 1/4 approximation ratio and sublinear regret

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168935)