{"total":20,"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":"2211.12638","title":"Projection-free Adaptive Regret with Membership Oracles","created":"2022-11-22","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":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2302.04859","title":"Projection-free Online Exp-concave Optimization","created":"2023-02-09","cited_by_count":10,"area":null},{"id":"2302.05620","title":"Improved Dynamic Regret for Online Frank-Wolfe","created":"2023-02-11","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":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"area":null},{"id":"2301.00497","title":"Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control","created":"2023-01-02","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":"2305.19349","title":"Riemannian Projection-free Online Learning","created":"2023-05-30","cited_by_count":4,"area":null},{"id":"2204.04964","title":"Projection-free Online Learning with Arbitrary Delays","created":"2022-04-11","cited_by_count":3,"area":null},{"id":"2502.16744","title":"BAGEL: Adversarially Constrained Online Convex Optimization under Separation Oracle Access","created":"2025-02-23","cited_by_count":3,"area":null},{"id":"2506.05855","title":"Optimized projection-free algorithms for online learning: construction and worst-case analysis","created":"2025-06-06","cited_by_count":3,"area":null},{"id":"2406.03787","title":"Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization","created":"2024-06-06","cited_by_count":2,"area":null},{"id":"2402.12868","title":"Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets","created":"2024-02-20","cited_by_count":1,"area":null},{"id":"2503.10013","title":"Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case","created":"2025-03-13","cited_by_count":0,"area":null},{"id":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2609.38375","title":"Lower Bounds for Linear-Oracle Online Learning","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}