{"total":47,"rows":[{"id":"2209.07454","title":"A Unifying Framework for Online Optimization with Long-Term Constraints","created":"2022-09-15","cited_by_count":41,"area":null},{"id":"2106.05135","title":"Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints","created":"2021-06-09","cited_by_count":39,"area":null},{"id":"2112.00885","title":"DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learning","created":"2021-12-01","cited_by_count":35,"area":null},{"id":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"area":null},{"id":"2206.02346","title":"Convergence and sample complexity of natural policy gradient primal-dual methods for constrained MDPs","created":"2022-06-06","cited_by_count":27,"area":null},{"id":"2205.12427","title":"Non-stationary Bandits with Knapsacks","created":"2022-05-25","cited_by_count":25,"area":null},{"id":"2102.03192","title":"Provably Efficient Algorithms for Multi-Objective Competitive RL","created":"2021-02-05","cited_by_count":22,"area":null},{"id":"2105.00321","title":"Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization","created":"2021-05-01","cited_by_count":21,"area":null},{"id":"2108.09435","title":"Fairness-Aware Online Meta-learning","created":"2021-08-21","cited_by_count":19,"area":null},{"id":"2205.11264","title":"Adaptive Fairness-Aware Online Meta-Learning for Changing Environments","created":"2022-05-20","cited_by_count":17,"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":"2102.10156","title":"Learning to Persuade on the Fly: Robustness Against Ignorance","created":"2021-02-19","cited_by_count":12,"area":null},{"id":"2111.07707","title":"Simultaneously Achieving Sublinear Regret and Constraint Violations for Online Convex Optimization with Time-varying Constraints","created":"2021-11-15","cited_by_count":12,"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":"2104.09750","title":"Joint Online Learning and Decision-making via Dual Mirror Descent","created":"2021-04-20","cited_by_count":8,"area":null},{"id":"2304.05219","title":"BanditQ: Fair Bandits with Guaranteed Rewards","created":"2023-04-11","cited_by_count":6,"area":null},{"id":"2306.03655","title":"Online Learning under Adversarial Nonlinear Constraints","created":"2023-06-06","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":"2605.21107","title":"A Geometric Approach to Constrained Online Learning","created":"2026-05-20","cited_by_count":5,"area":null},{"id":"2201.02890","title":"Lazy Lagrangians with Predictions for Online Learning","created":"2022-01-08","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":"2403.06812","title":"Monotone Individual Fairness","created":"2024-03-11","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":"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":"2402.12319","title":"Dynamic Environment Responsive Online Meta-Learning with Fairness Awareness","created":"2024-02-19","cited_by_count":2,"area":null},{"id":"2406.09563","title":"e-COP : Episodic Constrained Optimization of Policies","created":"2024-06-13","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.31480","title":"Constrained Online Convex Optimization without Slater's Condition","created":"2026-06-30","cited_by_count":2,"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.01077","title":"Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions","created":"2024-01-02","cited_by_count":1,"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":"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":"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":"2503.13366","title":"Optimal Bounds for Adversarial Constrained Online Convex Optimization","created":"2025-03-17","cited_by_count":0,"area":null},{"id":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","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":"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":"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":"2609.06921","title":"Constrained Online Learning with Noisy Constraint Values","created":"2026-09-07","cited_by_count":0,"area":null}],"next_cursor":null}