arXiv Machine Learning
Bandit Submodular Maximization under Matroid Constraints: Learning Compressed Exchange Policy
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Aug 13
Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids: From Robust Offline Optimization to Full-Bandit Learning
arXiv:2608. 12134v1 Announce Type: cross Abstract: We study nonnegative submodular maximization subject to a general matroid when the offline algorithm is given an arbitrary controlled value oracle.
arXiv AI
Sep 10
Adversarial Resilience of Poisson-Process Submodular Maximization over Matroids, and Full-Bandit Learning
arXiv:2608.12134v2 Announce Type: replace-cross Abstract: We study nonnegative submodular maximization on $n$ elements subject to a general matroid of rank $k$, when the offline algorithm is given an...
arXiv Machine Learning
Jul 2
Distributed Online Bandit Submodular Maximization with Bounded Sampling Violations
arXiv:2607. 00680v1 Announce Type: new Abstract: We study distributed online submodular maximization under partition matroid constraints, in which multiple agents select a limited number of actions from their own subsets sequentially to maximize the cumulative value of a sequence of objective functions.
arXiv Machine Learning
2d ago
Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary
arXiv:2609.13547v1 Announce Type: new Abstract: We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$...
arXiv Machine Learning
2d ago
Strong and Compact Policies for Submodular Markov Decision Processes via LP-Based Submodular Orienteering
arXiv:2609.15539v1 Announce Type: cross Abstract: Finding policies for Markov Decision Processes (MDPs) is a central problem in areas such as Reinforcement Learning and Operations Research. Here, we...
arXiv Machine Learning
Jun 30
Optimal Regret for Single Index Bandits
arXiv:2605. 09454v2 Announce Type: replace-cross Abstract: We study the $\textit{single-index bandit}$ problem, where rewards depend on an unknown one-dimensional projection of high-dimensional contexts through an unknown reward function.