{"total":24,"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":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"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":"2310.19807","title":"Improved Communication Efficiency in Federated Natural Policy Gradient via ADMM-based Gradient Updates","created":"2023-10-09","cited_by_count":21,"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":"2504.07388","title":"Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm","created":"2025-04-10","cited_by_count":5,"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":"2301.09808","title":"On Dynamic Regret and Constraint Violations in Constrained Online Convex Optimization","created":"2023-01-24","cited_by_count":4,"area":null},{"id":"2310.11880","title":"Online Convex Optimization with Switching Cost and Delayed Gradients","created":"2023-10-18","cited_by_count":3,"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":"2206.07126","title":"Lazy Queries Can Reduce Variance in Zeroth-order Optimization","created":"2022-06-14","cited_by_count":2,"area":null},{"id":"2405.19015","title":"Distributed Management of Fluctuating Energy Resources in Dynamic Networked Systems","created":"2024-05-29","cited_by_count":1,"area":null},{"id":"2408.16215","title":"Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks","created":"2024-08-29","cited_by_count":1,"area":null},{"id":"2505.02640","title":"Adaptive Budgeted Multi-Armed Bandits for IoT with Dynamic Resource Constraints","created":"2025-05-05","cited_by_count":1,"area":null},{"id":"2506.02980","title":"Non-stationary Bandit Convex Optimization: A Comprehensive Study","created":"2025-06-03","cited_by_count":1,"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":"2306.05655","title":"Communication-Efficient Zeroth-Order Distributed Online Optimization: Algorithm, Theory, and Applications","created":"2023-06-09","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":"2406.05714","title":"A conversion theorem and minimax optimality for continuum contextual bandits","created":"2024-06-09","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.19867","title":"Bandits in Flux: Adversarial Constraints in Dynamic Environments","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2605.21263","title":"Nonparametric Learning and Earning with One-Point Feedback under Nonstationarity","created":"2026-05-20","cited_by_count":0,"area":null}],"next_cursor":null}