{"total":16,"rows":[{"id":"2202.04721","title":"New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees","created":"2022-02-09","cited_by_count":26,"area":null},{"id":"2103.11102","title":"Projection-free Distributed Online Learning with Sublinear Communication Complexity","created":"2021-03-20","cited_by_count":13,"area":null},{"id":"2305.11726","title":"Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees","created":"2023-05-19","cited_by_count":13,"area":null},{"id":"2207.10415","title":"Log Barriers for Safe Black-box Optimization with Application to Safe Reinforcement Learning","created":"2022-07-21","cited_by_count":11,"area":null},{"id":"2302.04859","title":"Projection-free Online Exp-concave Optimization","created":"2023-02-09","cited_by_count":10,"area":null},{"id":"2405.00065","title":"From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization","created":"2024-04-27","cited_by_count":9,"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":"2402.09173","title":"Optimal and Efficient Algorithms for Decentralized Online Convex Optimization","created":"2024-02-14","cited_by_count":8,"area":null},{"id":"2103.05907","title":"Linear Bandits on Uniformly Convex Sets","created":"2021-03-10","cited_by_count":6,"area":null},{"id":"2108.07406","title":"From the Greene--Wu Convolution to Gradient Estimation over Riemannian Manifolds","created":"2021-08-17","cited_by_count":6,"area":null},{"id":"2402.08799","title":"Projection-Free Online Convex Optimization with Time-Varying Constraints","created":"2024-02-13","cited_by_count":5,"area":null},{"id":"2501.16046","title":"Revisiting Projection-Free Online Learning with Time-Varying Constraints","created":"2025-01-27","cited_by_count":5,"area":null},{"id":"2204.04964","title":"Projection-free Online Learning with Arbitrary Delays","created":"2022-04-11","cited_by_count":3,"area":null},{"id":"2305.12131","title":"Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting","created":"2023-05-20","cited_by_count":3,"area":null},{"id":"2508.00523","title":"Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting","created":"2025-08-01","cited_by_count":1,"area":null},{"id":"2310.10946","title":"Multi-point Feedback of Bandit Convex Optimization with Hard Constraints","created":"2023-10-17","cited_by_count":0,"area":null}],"next_cursor":null}