Cover Image

Linear Submodular Maximization with Bandit Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chen, Wenjing, Crawford, Victoria G.
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Threshold Greedy Algorithm for Noisy Submodular Maximization
by: Chen, Wenjing, et al.
Published: (2023)

Fair Submodular Cover
by: Chen, Wenjing, et al.
Published: (2024)

Multi-Agent Reinforcement Learning with Submodular Reward
by: Chen, Wenjing, et al.
Published: (2026)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
by: Nie, Guanyu, et al.
Published: (2024)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
by: Chen, Wenjing, et al.
Published: (2026)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
by: Pedramfar, Mohammad, et al.
Published: (2023)

Consistent Submodular Maximization
by: Dütting, Paul, et al.
Published: (2024)

Online Two-Stage Submodular Maximization
by: Nikolaou, Iasonas, et al.
Published: (2025)

The Cost of Consistency: Submodular Maximization with Constant Recourse
by: Dütting, Paul, et al.
Published: (2024)

Deletion Robust Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2022)

Fully Dynamic Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2023)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
by: Chen, Yixin, et al.
Published: (2020)

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
by: Chen, Yixin, et al.
Published: (2021)

A Note On Deterministic Submodular Maximization With Bounded Curvature
by: Li, Wenxin
Published: (2024)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
by: Cui, Shuang, et al.
Published: (2023)

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
by: Yuan, Jing, et al.
Published: (2024)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2022)

Mini-batch Submodular Maximization
by: Schwartzman, Gregory
Published: (2024)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
by: Amanatidis, Georgios, et al.
Published: (2020)

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
by: Amanatidis, Georgios, et al.
Published: (2021)

High-dimensional Linear Bandits with Knapsacks
by: Ma, Wanteng, et al.
Published: (2023)

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
by: Chen, Yixin, et al.
Published: (2024)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
by: Halabi, Marwa El, et al.
Published: (2023)

Breaking Barriers: Combinatorial Algorithms for Non-monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation
by: Chen, Yixin, et al.
Published: (2025)

Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions
by: Chen, Yixin, et al.
Published: (2026)

Minimum Cost Adaptive Submodular Cover
by: Al-Thani, Hessa, et al.
Published: (2022)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
by: Tukan, Murad, et al.
Published: (2024)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
by: Oki, Taihei, et al.
Published: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
by: Banihashem, Kiarash, et al.
Published: (2024)

A Unified Approach to Submodular Maximization Under Noise
by: Bhawalkar, Kshipra, et al.
Published: (2025)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
by: Buchbinder, Niv, et al.
Published: (2025)

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
by: Fahrbach, Matthew, et al.
Published: (2024)

Corporate Needs You to Find the Difference: Revisiting Submodular and Supermodular Ratio Optimization Problems
by: Harb, Elfarouk, et al.
Published: (2025)

Submodular Maximization in Exactly $n$ Queries
by: Balkanski, Eric, et al.
Published: (2024)

Regularized Unconstrained Weakly Submodular Maximization
by: Zhu, Yanhui, et al.
Published: (2024)

Learning-Augmented Dynamic Submodular Maximization
by: Agarwal, Arpit, et al.
Published: (2023)

A Poisson Process for Submodular Maximization
by: Rozenman, Amit Ganz, et al.
Published: (2026)

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
by: Gopal, Shivaram, et al.
Published: (2024)

Decomposable Submodular Maximization in Federated Setting
by: Rafiey, Akbar
Published: (2024)

Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
by: Chen, Yixin, et al.
Published: (2022)