Adaptive combinatorial maximization: beyond approximate greedy policies

MaRDI QIDQ7017065zbMATH OpenFDO

Authors Shlomi Weitzman, Sivan Sabato

Publication date 6 March 2025

Full work available at URL https://proceedings.mlr.press/v237/weitzman24a.html

zbMATH Keywords

adaptive submodularityapproximate greedy policiescombinatorial maximization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Cites work

• Adaptive seeding in social networks
• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• An analysis of approximations for maximizing submodular set functions—I
• An analysis of the greedy algorithm for the submodular set covering problem
• Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
• scientific article; zbMATH DE number 5888315 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Robust Adaptive Submodular Maximization
• Streaming adaptive submodular maximization
• Submodular learning and covering with response-dependent costs
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

This page was built for publication: Adaptive combinatorial maximization: beyond approximate greedy policies

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