{"total":22,"rows":[{"id":"2102.13028","title":"Batched Neural Bandits","created":"2021-02-25","cited_by_count":22,"area":null},{"id":"2106.01420","title":"Parallelizing Thompson Sampling","created":"2021-06-02","cited_by_count":20,"area":null},{"id":"2202.05448","title":"Fast Rates in Pool-Based Batch Active Learning","created":"2022-02-11","cited_by_count":15,"area":null},{"id":"2402.17327","title":"Data-Efficient Learning via Clustering-Based Sensitivity Sampling: Foundation Models and Beyond","created":"2024-02-27","cited_by_count":15,"area":null},{"id":"2202.10660","title":"Batched Dueling Bandits","created":"2022-02-22","cited_by_count":10,"area":null},{"id":"2102.08327","title":"Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity","created":"2021-02-16","cited_by_count":8,"area":null},{"id":"2208.08351","title":"Minimum Cost Adaptive Submodular Cover","created":"2022-08-17","cited_by_count":5,"area":null},{"id":"2102.01149","title":"A Tight Bound for Stochastic Submodular Cover","created":"2021-02-01","cited_by_count":4,"area":null},{"id":"2203.10124","title":"Approximate Function Evaluation via Multi-Armed Bandits","created":"2022-03-18","cited_by_count":4,"area":null},{"id":"2201.09433","title":"Active Learning Polynomial Threshold Functions","created":"2022-01-24","cited_by_count":3,"area":null},{"id":"2112.02165","title":"On Submodular Contextual Bandits","created":"2021-12-03","cited_by_count":2,"area":null},{"id":"2205.10403","title":"Tackling Provably Hard Representative Selection via Graph Neural Networks","created":"2022-05-20","cited_by_count":2,"area":null},{"id":"2209.12108","title":"An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem","created":"2022-09-25","cited_by_count":2,"area":null},{"id":"2402.15441","title":"Active Few-Shot Fine-Tuning","created":"2024-02-13","cited_by_count":2,"area":null},{"id":"2505.15641","title":"A Simple Approximation Algorithm for Optimal Decision Tree","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2111.00986","title":"Partial-Adaptive Submodular Maximization","created":"2021-11-01","cited_by_count":1,"area":null},{"id":"2403.08199","title":"Deep Submodular Peripteral Networks","created":"2024-03-13","cited_by_count":1,"area":null},{"id":"2602.21312","title":"Precedence-Constrained Decision Trees and Coverings","created":"2026-02-24","cited_by_count":1,"area":null},{"id":"2607.23896","title":"Cost-Aware Recovery-Pathway Identification and Bayesian Optimization for Autonomous Materials Discovery","created":"2026-07-26","cited_by_count":1,"area":null},{"id":"2210.13694","title":"Worst-Case Adaptive Submodular Cover","created":"2022-10-25","cited_by_count":0,"area":null},{"id":"2404.01930","title":"Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies","created":"2024-04-02","cited_by_count":0,"area":null},{"id":"2604.12036","title":"Simpler Logarithmic Approximation Algorithms for the Optimal Decision Tree and Adaptive Set Cover","created":"2026-04-13","cited_by_count":0,"area":null}],"next_cursor":null}