{"total":17,"rows":[{"id":"2301.13326","title":"A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2312.08057","title":"Combinatorial Stochastic-Greedy Bandit","created":"2023-12-13","cited_by_count":18,"area":null},{"id":"2201.08315","title":"Predictive Inference with Weak Supervision","created":"2022-01-20","cited_by_count":13,"area":null},{"id":"2210.06380","title":"Near-Optimal Multi-Agent Learning for Safe Coverage Control","created":"2022-10-12","cited_by_count":11,"area":null},{"id":"2310.18465","title":"Nearly Minimax Optimal Submodular Maximization with Bandit Feedback","created":"2023-10-27","cited_by_count":7,"area":null},{"id":"2305.12795","title":"Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments","created":"2023-05-22","cited_by_count":6,"area":null},{"id":"2209.12429","title":"Online Submodular Coordination with Bounded Tracking Regret: Theory, Algorithm, and Applications to Multi-Robot Coordination","created":"2022-09-26","cited_by_count":5,"area":null},{"id":"2106.07836","title":"Improved Regret Bounds for Online Submodular Maximization","created":"2021-06-15","cited_by_count":2,"area":null},{"id":"2405.12439","title":"No-Regret M${}^{\\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting","created":"2024-05-21","cited_by_count":1,"area":null},{"id":"2604.11328","title":"Select Smarter, Not More: Prompt-Aware Evaluation Scheduling with Submodular Guarantees","created":"2026-04-13","cited_by_count":1,"area":null},{"id":"2105.03527","title":"Scalable Projection-Free Optimization","created":"2021-05-07","cited_by_count":0,"area":null},{"id":"2209.14222","title":"Online Subset Selection using $\\alpha$-Core with no Augmented Regret","created":"2022-09-28","cited_by_count":0,"area":null},{"id":"2303.11937","title":"High Probability Bounds for Stochastic Continuous Submodular Maximization","created":"2023-03-20","cited_by_count":0,"area":null},{"id":"2309.16161","title":"Leveraging Untrustworthy Commands for Multi-Robot Coordination in Unpredictable Environments: A Bandit Submodular Maximization Approach","created":"2023-09-28","cited_by_count":0,"area":null},{"id":"2410.08578","title":"Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit","created":"2024-10-11","cited_by_count":0,"area":null},{"id":"2605.10151","title":"Learning to Sparsify Stochastic Linear Bandits","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2607.00680","title":"Distributed Online Bandit Submodular Maximization with Bounded Sampling Violations","created":"2026-07-01","cited_by_count":0,"area":null}],"next_cursor":null}