Research map / Bandits and online learning / Online convex optimization and games
Online Learning for Min Sum Set Cover and Pandora’s Box
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the proposed convex relaxation and rounding for MSSC instead of the prior method | MSSC · MSSC, partially-adaptive | approximation factor: 11.713 -> 4 | Helped |
| Use randomized full-information exploration with bandit feedback | Pandora's Box algorithm · Pandora's Box, partially-adaptive, bandit | approximation factor | No clear effect |
Closest papers by meaning
- Contextual Pandora’s Box (AAAI 2024 · similarity 0.89)
- Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality (NeurIPS 2025 · similarity 0.88)
- Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints (NeurIPS 2024 · similarity 0.85)
- Combinatorial Stochastic-Greedy Bandit (AAAI 2024 · similarity 0.85)
- Gradient Methods for Online DR-Submodular Maximization with Stochastic Long-Term Constraints (NeurIPS 2024 · similarity 0.84)
- Learning Thresholds with Latent Values and Censored Feedback (ICLR 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.