{"total":19,"rows":[{"id":"2406.06506","title":"Online Newton Method for Bandit Convex Optimisation","created":"2024-06-10","cited_by_count":12,"area":null},{"id":"2402.09152","title":"Improved Regret for Bandit Convex Optimization with Delayed Feedback","created":"2024-02-14","cited_by_count":8,"area":null},{"id":"2405.20678","title":"No-Regret Learning for Fair Multi-Agent Social Welfare Optimization","created":"2024-05-31","cited_by_count":8,"area":null},{"id":"2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","created":"2026-02-04","cited_by_count":5,"area":null},{"id":"2602.02634","title":"A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees","created":"2026-02-02","cited_by_count":3,"area":null},{"id":"2410.00993","title":"Tight Rates for Bandit Control Beyond Quadratics","created":"2024-10-01","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":"2406.18672","title":"A simple and improved algorithm for noisy, convex, zeroth-order optimisation","created":"2024-06-26","cited_by_count":1,"area":null},{"id":"2503.10836","title":"Exploiting Concavity Information in Gaussian Process Contextual Bandit Optimization","created":"2025-03-13","cited_by_count":1,"area":null},{"id":"2506.02980","title":"Non-stationary Bandit Convex Optimization: A Comprehensive Study","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2605.15411","title":"Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning","created":"2026-05-14","cited_by_count":1,"area":null},{"id":"2605.22191","title":"Bandit Convex Optimization with Gradient Prediction Adaptivity","created":"2026-05-21","cited_by_count":1,"area":null},{"id":"2606.11711","title":"Capacity-Constrained Online Convex Optimization with Delayed Feedback","created":"2026-06-10","cited_by_count":1,"area":null},{"id":"2406.05714","title":"A conversion theorem and minimax optimality for continuum contextual bandits","created":"2024-06-09","cited_by_count":0,"area":null},{"id":"2509.21484","title":"High-probability zeroth-order online convex optimisation beyond Euclidean geometry","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2510.18299","title":"Physics-Informed Parametric Bandits for Beam Alignment in mmWave Communications","created":"2025-10-21","cited_by_count":0,"area":null},{"id":"2603.28201","title":"A Perturbation Approach to Unconstrained Linear Bandits","created":"2026-03-30","cited_by_count":0,"area":null},{"id":"2605.26373","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2607.07304","title":"Nonlinear Bandit","created":"2026-07-08","cited_by_count":0,"area":null}],"next_cursor":null}