Stochastic Variance Reduction for DR-Submodular Maximization

DOI10.1007/S00453-023-01195-ZMaRDI QIDQ6492081

X. Wang, Da-Chuan Xu, Dong-lei Du, Yuefang Lian, Unnamed Author

Publication date: 24 April 2024

Published in: Algorithmica (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on maximizing a submodular set function subject to a knapsack constraint
• A hybrid stochastic optimization framework for composite nonconvex optimization
• Submodular functions: from discrete to continuous domains
• On Multiplicative Weight Updates for Concave and Submodular Function Maximization
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• An analysis of approximations for maximizing submodular set functions—I
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Guess free maximization of submodular and linear sums
• A stochastic non-monotone DR-submodular maximization problem over a convex set

This page was built for publication: Stochastic Variance Reduction for DR-Submodular Maximization