{"total":26,"rows":[{"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":"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":"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":"2410.02476","title":"Online Convex Optimization with a Separation Oracle","created":"2024-10-03","cited_by_count":8,"area":null},{"id":"2305.18442","title":"Improved Projection-free Online Continuous Submodular Maximization","created":"2023-05-29","cited_by_count":7,"area":null},{"id":"2306.03655","title":"Online Learning under Adversarial Nonlinear Constraints","created":"2023-06-06","cited_by_count":6,"area":null},{"id":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","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":"2402.08799","title":"Projection-Free Online Convex Optimization with Time-Varying Constraints","created":"2024-02-13","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":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2402.08621","title":"A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization","created":"2024-02-13","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":"2602.20578","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","created":"2026-02-24","cited_by_count":3,"area":null},{"id":"2608.15050","title":"Online Convex Optimization with Dueling Feedback","created":"2026-08-15","cited_by_count":2,"area":null},{"id":"2602.13506","title":"$\\gamma$-weakly $\\theta$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2607.27073","title":"Parameter-Free Dynamic Regret under Heavy-Tailed Noise","created":"2026-07-29","cited_by_count":1,"area":null},{"id":"2311.11180","title":"Nonsmooth Projection-Free Optimization with Functional Constraints","created":"2023-11-18","cited_by_count":0,"area":null},{"id":"2608.30271","title":"Dec-BFTRL: Squre-Root Regret for Decentralized Online Upper-Linearizable Optimization under Separation Access with Application to Continuous Submodular Maximization","created":"2026-08-31","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},{"id":"2610.00254","title":"Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization","created":"2026-09-23","cited_by_count":0,"area":null}],"next_cursor":null}