{"total":30,"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":"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":"2406.06506","title":"Online Newton Method for Bandit Convex Optimisation","created":"2024-06-10","cited_by_count":12,"area":null},{"id":"2302.08580","title":"Online Learning Guided Curvature Approximation: A Quasi-Newton Method with Global Non-Asymptotic Superlinear Convergence","created":"2023-02-16","cited_by_count":11,"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":"2211.01357","title":"Quasi-Newton Steps for Efficient Online Exp-Concave Optimization","created":"2022-11-02","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":"2410.02476","title":"Online Convex Optimization with a Separation Oracle","created":"2024-10-03","cited_by_count":8,"area":null},{"id":"2306.03655","title":"Online Learning under Adversarial Nonlinear Constraints","created":"2023-06-06","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":"2305.19349","title":"Riemannian Projection-free Online Learning","created":"2023-05-30","cited_by_count":4,"area":null},{"id":"2306.02212","title":"Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization","created":"2023-06-03","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":"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":"2303.05037","title":"Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets","created":"2023-03-09","cited_by_count":2,"area":null},{"id":"2405.15379","title":"Randomized Midpoint Method for Log-Concave Sampling under Constraints","created":"2024-05-24","cited_by_count":2,"area":null},{"id":"2506.01722","title":"When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2403.05786","title":"Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints","created":"2024-03-09","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":"2407.11471","title":"Safe Online Convex Optimization with Multi-Point Feedback","created":"2024-07-16","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},{"id":"2610.13787","title":"Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}