Research map / Learning theory and algorithms / Prediction and decision losses
Adaptive Sequence Submodularity
Marko Mitrovic, Ehsan Kazemi, Moran Feldman, Andreas Krause, Amin Karbasi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 adaptive rather than non-adaptive recommendations | Adaptive Sequence-Greedy and other adaptive recommenders · Amazon Video Games product recommendation | Accuracy Score | Improved |
| Use adaptive rather than non-adaptive recommendations | Adaptive Sequence-Greedy and other adaptive recommenders · Amazon Video Games product recommendation | Sequence Score | Improved |
| Replace the adaptive feed-forward neural network with Adaptive Sequence-Greedy | Amazon Video Games product recommendation · Amazon Video Games product recommendation | Accuracy Score | Mixed |
| Replace deep learning-based approaches with sequence-greedy approaches | Amazon Video Games product recommendation using 1% of training data · Amazon Video Games product recommendation (1% training data) | Accuracy Score | Improved |
| Replace deep learning-based approaches with Adaptive Sequence-Greedy | Wikispeedia link prediction · Wikispeedia | Relevance distance | Improved |
Closest papers by meaning
- Selecting Sequences of Items via Submodular Maximization (AAAI 2017 · similarity 0.90)
- Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio (ICML 2019 · similarity 0.89)
- Non-monotone Sequential Submodular Maximization (AAAI 2024 · similarity 0.87)
- Learning to Make Decisions via Submodular Regularization (ICLR 2021 · similarity 0.86)
- Probabilistic Submodular Maximization in Sub-Linear Time (ICML 2017 · similarity 0.86)
- Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint (NeurIPS 2024 · similarity 0.85)
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.
