{"total":33,"rows":[{"id":"2412.08060","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","created":"2024-12-11","cited_by_count":11,"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":"2506.13244","title":"No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need!","created":"2025-06-16","cited_by_count":5,"area":null},{"id":"2605.21107","title":"A Geometric Approach to Constrained Online Learning","created":"2026-05-20","cited_by_count":5,"area":null},{"id":"2510.01867","title":"Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization","created":"2025-10-02","cited_by_count":4,"area":null},{"id":"2605.07386","title":"Convex Optimization with Nested Evolving Feasible Sets","created":"2026-05-08","cited_by_count":4,"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":"2503.14796","title":"A New Benchmark for Online Learning with Budget-Balancing Constraints","created":"2025-03-19","cited_by_count":3,"area":null},{"id":"2603.20671","title":"Breaking the $O(\\sqrt{T})$ Cumulative Constraint Violation Barrier while Achieving $O(\\sqrt{T})$ Static Regret in Constrained Online Convex Optimization","created":"2026-03-21","cited_by_count":3,"area":null},{"id":"2412.10703","title":"Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint","created":"2024-12-14","cited_by_count":2,"area":null},{"id":"2509.11357","title":"Online Omniprediction with Long-Term Constraints","created":"2025-09-14","cited_by_count":2,"area":null},{"id":"2606.31480","title":"Constrained Online Convex Optimization without Slater's Condition","created":"2026-06-30","cited_by_count":2,"area":null},{"id":"2405.09296","title":"Tight Bounds for Online Convex Optimization with Adversarial Constraints","created":"2024-05-15","cited_by_count":1,"area":null},{"id":"2508.16992","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","created":"2025-08-23","cited_by_count":1,"area":null},{"id":"2510.22579","title":"Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2025-10-26","cited_by_count":1,"area":null},{"id":"2602.10452","title":"Distributed Online Convex Optimization with Nonseparable Costs and Constraints","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2605.05497","title":"Online Localized Conformal Prediction","created":"2026-05-06","cited_by_count":1,"area":null},{"id":"2606.08452","title":"Theoretical Foundations of Continual Learning via Drift-Plus-Penalty","created":"2026-06-07","cited_by_count":1,"area":null},{"id":"2608.29074","title":"Nested Convex-Body Chasing for Online Optimization with Evolving Feasible Sets","created":"2026-08-29","cited_by_count":1,"area":null},{"id":"2412.03983","title":"Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback","created":"2024-12-05","cited_by_count":0,"area":null},{"id":"2502.05599","title":"Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint","created":"2025-02-08","cited_by_count":0,"area":null},{"id":"2510.07266","title":"Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2510.13560","title":"Multi-Objective $\\textit{min-max}$ Online Convex Optimization","created":"2025-10-15","cited_by_count":0,"area":null},{"id":"2601.16072","title":"CLASP: An online learning algorithm for Convex Losses And Squared Penalties","created":"2026-01-22","cited_by_count":0,"area":null},{"id":"2602.05019","title":"A Simple Reduction Scheme for Constrained Contextual Bandits with Adversarial Contexts via Regression","created":"2026-02-04","cited_by_count":0,"area":null},{"id":"2603.14319","title":"Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints","created":"2026-03-15","cited_by_count":0,"area":null},{"id":"2603.21375","title":"Constrained Online Convex Optimization with Memory and Predictions","created":"2026-03-22","cited_by_count":0,"area":null},{"id":"2605.06190","title":"Constrained Contextual Bandits with Adversarial Contexts","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2607.10808","title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)","created":"2026-07-12","cited_by_count":0,"area":null},{"id":"2608.21539","title":"Federated Continual Learning as a Distributed Drift-Plus-Penalty Control Problem","created":"2026-08-21","cited_by_count":0,"area":null},{"id":"2609.06921","title":"Constrained Online Learning with Noisy Constraint Values","created":"2026-09-07","cited_by_count":0,"area":null},{"id":"2609.11207","title":"Convex Optimization with Nested Evolving Feasible Sets (CONES) under Time-Varying Loss Functions","created":"2026-09-10","cited_by_count":0,"area":null},{"id":"2610.03983","title":"$\\tilde{O}(\\sqrt{T})$ Regret and Polylogarithmic Constraint Violation for COCO","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}