{"total":17,"rows":[{"id":"2101.08534","title":"Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback","created":"2021-01-21","cited_by_count":21,"area":null},{"id":"2102.04323","title":"Discovering a set of policies for the worst case reward","created":"2021-02-08","cited_by_count":21,"area":null},{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"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":"2302.05620","title":"Improved Dynamic Regret for Online Frank-Wolfe","created":"2023-02-11","cited_by_count":8,"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":"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":"2604.09276","title":"Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications","created":"2026-04-10","cited_by_count":1,"area":null},{"id":"2102.07360","title":"Generating Structured Adversarial Attacks Using Frank-Wolfe Method","created":"2021-02-15","cited_by_count":0,"area":null},{"id":"2108.12916","title":"A Policy Efficient Reduction Approach to Convex Constrained Deep Reinforcement Learning","created":"2021-08-29","cited_by_count":0,"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":"2505.11259","title":"Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes","created":"2025-05-16","cited_by_count":0,"area":null},{"id":"2607.01665","title":"Revisiting Decentralized Online Convex Optimization with Compressed Communication","created":"2026-07-02","cited_by_count":0,"area":null}],"next_cursor":null}