Image de couverture de livre

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pedramfar, Mohammad, Aggarwal, Vaneet
Format:	Preprint
Publié:	2023
Sujets:	Machine Learning Artificial Intelligence Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
par: Nie, Guanyu, et autres
Publié: (2024)

Linear Submodular Maximization with Bandit Feedback
par: Chen, Wenjing, et autres
Publié: (2024)

Introduction to Multi-Armed Bandits
par: Slivkins, Aleksandrs
Publié: (2019)

Unlearning Offline Stochastic Multi-Armed Bandits
par: Ye, Zichun, et autres
Publié: (2026)

Mini-batch Submodular Maximization
par: Schwartzman, Gregory
Publié: (2024)

Semi-Bandit Learning for Monotone Stochastic Optimization
par: Agarwal, Arpit, et autres
Publié: (2023)

Stochastic Bandits with ReLU Neural Networks
par: Xu, Kan, et autres
Publié: (2024)

Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover
par: Harris, Blake, et autres
Publié: (2024)

Near-Optimal Regret for Efficient Stochastic Combinatorial Semi-Bandits
par: Ye, Zichun, et autres
Publié: (2025)

Stochastic Multi-Objective Multi-Armed Bandits: Regret Definition and Algorithm
par: Davoodi, Mansoor, et autres
Publié: (2025)

Convergence of a L2 regularized Policy Gradient Algorithm for the Multi Armed Bandit
par: Anita, Stefana, et autres
Publié: (2024)

$γ$-weakly $θ$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions
par: Pedramfar, Mohammad, et autres
Publié: (2026)

Understanding Memory-Regret Trade-Off for Streaming Stochastic Multi-Armed Bandits
par: He, Yuchen, et autres
Publié: (2024)

Stochastic Multi-round Submodular Optimization with Budget
par: Auletta, Vincenzo, et autres
Publié: (2024)

High-dimensional Linear Bandits with Knapsacks
par: Ma, Wanteng, et autres
Publié: (2023)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
par: Nguyen, Hue T., et autres
Publié: (2025)

Adversarial Attacks on Combinatorial Multi-Armed Bandits
par: Balasubramanian, Rishab, et autres
Publié: (2023)

Tight Gap-Dependent Memory-Regret Trade-Off for Single-Pass Streaming Stochastic Multi-Armed Bandits
par: Ye, Zichun, et autres
Publié: (2025)

No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting
par: Oki, Taihei, et autres
Publié: (2024)

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting
par: Hanneke, Steve, et autres
Publié: (2026)

MNL-Bandit with Knapsacks: a near-optimal algorithm
par: Aznag, Abdellah, et autres
Publié: (2021)

Nearly-tight Approximation Guarantees for the Improving Multi-Armed Bandits Problem
par: Blum, Avrim, et autres
Publié: (2024)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
par: Wang, Long, et autres
Publié: (2025)

Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure
par: Slivkins, Aleksandrs, et autres
Publié: (2025)

Decomposable Submodular Maximization in Federated Setting
par: Rafiey, Akbar
Publié: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
par: Banihashem, Kiarash, et autres
Publié: (2024)

Nearly Tight Bounds for Exploration in Streaming Multi-armed Bandits with Known Optimality Gap
par: Karpov, Nikolai, et autres
Publié: (2025)

Consistent Submodular Maximization
par: Dütting, Paul, et autres
Publié: (2024)

Replication-proof Bandit Mechanism Design with Bayesian Agents
par: Shin, Suho, et autres
Publié: (2023)

Online Two-Stage Submodular Maximization
par: Nikolaou, Iasonas, et autres
Publié: (2025)

Minimum Cost Adaptive Submodular Cover
par: Al-Thani, Hessa, et autres
Publié: (2022)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits
par: Assadi, Sepehr, et autres
Publié: (2023)

Fully Dynamic Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2023)

Deletion Robust Submodular Maximization over Matroids
par: Dütting, Paul, et autres
Publié: (2022)

The Cost of Consistency: Submodular Maximization with Constant Recourse
par: Dütting, Paul, et autres
Publié: (2024)

Multi-Agent Reinforcement Learning with Submodular Reward
par: Chen, Wenjing, et autres
Publié: (2026)

Bandit Social Learning: Exploration under Myopic Behavior
par: Banihashem, Kiarash, et autres
Publié: (2023)

Minimum Weighted Feedback Arc Sets for Ranking from Pairwise Comparisons
par: Vahidi, Soroush, et autres
Publié: (2024)

Learning on the Edge: Online Learning with Stochastic Feedback Graphs
par: Esposito, Emmanuel, et autres
Publié: (2022)

Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
par: Nguyen, Tuan-Anh, et autres
Publié: (2024)