{"total":42,"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":"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":"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":"2111.07430","title":"Safe Online Convex Optimization with Unknown Linear Safety Constraints","created":"2021-11-14","cited_by_count":13,"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":"2104.09750","title":"Joint Online Learning and Decision-making via Dual Mirror Descent","created":"2021-04-20","cited_by_count":8,"area":null},{"id":"2202.10590","title":"Online Caching with Optimistic Learning","created":"2022-02-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":"2504.00461","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries","created":"2025-04-01","cited_by_count":6,"area":null},{"id":"2402.07703","title":"Online Sequential Decision-Making with Unknown Delays","created":"2024-02-12","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":"2202.13710","title":"Best of Many Worlds Guarantees for Online Learning with Knapsacks","created":"2022-02-28","cited_by_count":4,"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":"2204.09345","title":"Online Caching with no Regret: Optimistic Learning via Recommendations","created":"2022-04-20","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":"2112.12373","title":"Decentralized Multi-Task Stochastic Optimization With Compressed Communications","created":"2021-12-23","cited_by_count":3,"area":null},{"id":"2403.06812","title":"Monotone Individual Fairness","created":"2024-03-11","cited_by_count":3,"area":null},{"id":"2105.04005","title":"Delay-Tolerant Constrained OCO with Application to Network Resource Allocation","created":"2021-05-09","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":"2401.02552","title":"Long-term Fairness For Real-time Decision Making: A Constrained Online Optimization Approach","created":"2024-01-04","cited_by_count":2,"area":null},{"id":"2404.02988","title":"Risk-averse Learning with Non-Stationary Distributions","created":"2024-04-03","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":"2305.15558","title":"Online Optimization for Randomized Network Resource Allocation with Long-Term Constraints","created":"2023-05-24","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":"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":"2509.07901","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","created":"2025-09-09","cited_by_count":1,"area":null},{"id":"2204.02197","title":"Penalised FTRL With Time-Varying Constraints","created":"2022-04-05","cited_by_count":0,"area":null},{"id":"2205.06968","title":"No-regret learning for repeated non-cooperative games with lossy bandits","created":"2022-05-14","cited_by_count":0,"area":null},{"id":"2205.09571","title":"Augmented Lagrangian Methods for Time-varying Constrained Online Convex Optimization","created":"2022-05-19","cited_by_count":0,"area":null},{"id":"2306.10835","title":"Online Dynamic Submodular Optimization","created":"2023-06-19","cited_by_count":0,"area":null},{"id":"2307.09711","title":"Two Tales of Platoon Intelligence for Autonomous Mobility Control: Enabling Deep Learning Recipes","created":"2023-07-19","cited_by_count":0,"area":null},{"id":"2311.02426","title":"Online Non-convex Optimization with Long-term Non-convex Constraints","created":"2023-11-04","cited_by_count":0,"area":null},{"id":"2405.02373","title":"Exponentially Weighted Algorithm for Online Network Resource Allocation with Long-Term Constraints","created":"2024-05-03","cited_by_count":0,"area":null},{"id":"2407.03601","title":"Online Non-Stationary Stochastic Quasar-Convex Optimization","created":"2024-07-04","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":"2501.00799","title":"Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation","created":"2025-01-01","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.07266","title":"Dynamic Regret Bounds for Online Omniprediction with Long Term Constraints","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2512.22986","title":"Risk-Averse Learning with Varying Risk Levels","created":"2025-12-28","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":"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}],"next_cursor":null}