{"total":39,"rows":[{"id":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"area":null},{"id":"2205.12427","title":"Non-stationary Bandits with Knapsacks","created":"2022-05-25","cited_by_count":25,"area":null},{"id":"2306.00149","title":"Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater's Condition","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2306.01007","title":"Towards Fair Disentangled Online Learning for Changing Environments","created":"2023-05-31","cited_by_count":11,"area":null},{"id":"2211.14720","title":"Rectified Pessimistic-Optimistic Learning for Stochastic Continuum-armed Bandit with Constraints","created":"2022-11-27","cited_by_count":9,"area":null},{"id":"2312.14470","title":"Safe Reinforcement Learning with Instantaneous Constraints: The Role of Aggressive Exploration","created":"2023-12-22","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":"2302.02426","title":"Online Nonstochastic Control with Adversarial and Static Constraints","created":"2023-02-05","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":"2501.16046","title":"Revisiting Projection-Free Online Learning with Time-Varying Constraints","created":"2025-01-27","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":"2203.17150","title":"Online Learning for Traffic Routing under Unknown Preferences","created":"2022-03-31","cited_by_count":4,"area":null},{"id":"2302.12320","title":"Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems","created":"2023-02-23","cited_by_count":4,"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":"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":"2202.12843","title":"Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions","created":"2022-02-25","cited_by_count":2,"area":null},{"id":"2205.00825","title":"Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements","created":"2022-04-27","cited_by_count":2,"area":null},{"id":"2210.16735","title":"Online Convex Optimization with Long Term Constraints for Predictable Sequences","created":"2022-10-30","cited_by_count":2,"area":null},{"id":"2305.01333","title":"Projection-Free Online Convex Optimization with Stochastic Constraints","created":"2023-05-02","cited_by_count":2,"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":"2606.08028","title":"Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization","created":"2026-06-06","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":"2205.00473","title":"A Survey on Distributed Online Optimization and Game","created":"2022-05-01","cited_by_count":1,"area":null},{"id":"2301.11267","title":"Online Convex Optimization with Stochastic Constraints: Zero Constraint Violation and Bandit Feedback","created":"2023-01-26","cited_by_count":1,"area":null},{"id":"2401.01077","title":"Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions","created":"2024-01-02","cited_by_count":1,"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":"2505.00398","title":"Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints","created":"2025-05-01","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":"2302.00997","title":"Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning","created":"2023-02-02","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":"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":"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":"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":"2607.27626","title":"Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning","created":"2026-07-30","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":"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}