{"total":17,"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":"2210.05965","title":"Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets","created":"2022-10-12","cited_by_count":14,"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":"2209.11817","title":"An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret","created":"2022-09-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":"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":"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":"2501.16046","title":"Revisiting Projection-Free Online Learning with Time-Varying Constraints","created":"2025-01-27","cited_by_count":5,"area":null},{"id":"2102.07387","title":"Optimal Regret Algorithm for Pseudo-1d Bandit Convex Optimization","created":"2021-02-15","cited_by_count":3,"area":null},{"id":"2204.04964","title":"Projection-free Online Learning with Arbitrary Delays","created":"2022-04-11","cited_by_count":3,"area":null},{"id":"2307.05698","title":"Online Ad Procurement in Non-stationary Autobidding Worlds","created":"2023-07-10","cited_by_count":1,"area":null},{"id":"2401.09251","title":"Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2105.03527","title":"Scalable Projection-Free Optimization","created":"2021-05-07","cited_by_count":0,"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},{"id":"2607.25480","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","created":"2026-07-28","cited_by_count":0,"area":null}],"next_cursor":null}