{"total":40,"rows":[{"id":"2302.06606","title":"Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation","created":"2023-02-13","cited_by_count":30,"area":null},{"id":"2302.03673","title":"Breaking the Curse of Multiagents in a Large State Space: RL in Markov Games with Independent Linear Function Approximation","created":"2023-02-07","cited_by_count":27,"area":null},{"id":"2202.04721","title":"New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees","created":"2022-02-09","cited_by_count":26,"area":null},{"id":"2101.08534","title":"Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback","created":"2021-01-21","cited_by_count":21,"area":null},{"id":"2102.11646","title":"HardCoRe-NAS: Hard Constrained diffeRentiable Neural Architecture Search","created":"2021-02-23","cited_by_count":20,"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":"2602.08232","title":"Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization","created":"2026-02-09","cited_by_count":14,"area":null},{"id":"2103.11102","title":"Projection-free Distributed Online Learning with Sublinear Communication Complexity","created":"2021-03-20","cited_by_count":13,"area":null},{"id":"2211.12638","title":"Projection-free Adaptive Regret with Membership Oracles","created":"2022-11-22","cited_by_count":13,"area":null},{"id":"2305.11726","title":"Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees","created":"2023-05-19","cited_by_count":13,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2302.04859","title":"Projection-free Online Exp-concave Optimization","created":"2023-02-09","cited_by_count":10,"area":null},{"id":"2405.00065","title":"From Linear to Linearizable Optimization: A Novel Framework with Applications to Stationary and Non-stationary DR-submodular Optimization","created":"2024-04-27","cited_by_count":9,"area":null},{"id":"2302.05620","title":"Improved Dynamic Regret for Online Frank-Wolfe","created":"2023-02-11","cited_by_count":8,"area":null},{"id":"2402.09152","title":"Improved Regret for Bandit Convex Optimization with Delayed Feedback","created":"2024-02-14","cited_by_count":8,"area":null},{"id":"2402.09173","title":"Optimal and Efficient Algorithms for Decentralized Online Convex Optimization","created":"2024-02-14","cited_by_count":8,"area":null},{"id":"2305.18442","title":"Improved Projection-free Online Continuous Submodular Maximization","created":"2023-05-29","cited_by_count":7,"area":null},{"id":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"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":"2305.19349","title":"Riemannian Projection-free Online Learning","created":"2023-05-30","cited_by_count":4,"area":null},{"id":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2204.04964","title":"Projection-free Online Learning with Arbitrary Delays","created":"2022-04-11","cited_by_count":3,"area":null},{"id":"2506.05855","title":"Optimized projection-free algorithms for online learning: construction and worst-case analysis","created":"2025-06-06","cited_by_count":3,"area":null},{"id":"2106.11943","title":"Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes","created":"2021-06-22","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.03787","title":"Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization","created":"2024-06-06","cited_by_count":2,"area":null},{"id":"2112.03896","title":"Gradient and Projection Free Distributed Online Min-Max Resource Optimization","created":"2021-12-07","cited_by_count":1,"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":"2403.05786","title":"Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints","created":"2024-03-09","cited_by_count":1,"area":null},{"id":"2602.09502","title":"Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions","created":"2026-02-10","cited_by_count":1,"area":null},{"id":"2311.11180","title":"Nonsmooth Projection-Free Optimization with Functional Constraints","created":"2023-11-18","cited_by_count":0,"area":null},{"id":"2407.11471","title":"Safe Online Convex Optimization with Multi-Point Feedback","created":"2024-07-16","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":"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":"2609.33993","title":"ASTRA: ADMM-Accelerated Topology Reconfiguration for Dynamic Satellite Constellations","created":"2026-09-27","cited_by_count":0,"area":null},{"id":"2609.38375","title":"Lower Bounds for Linear-Oracle Online Learning","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.00254","title":"Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2610.13787","title":"Optimal Algorithms for Nonsmooth Nonconvex Stochastic Optimization with Constraints","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}