{"total":31,"rows":[{"id":"2102.11050","title":"Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization","created":"2021-02-18","cited_by_count":40,"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":"2201.00703","title":"Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function","created":"2022-01-03","cited_by_count":21,"area":null},{"id":"2205.11921","title":"Compression-aware Training of Neural Networks using Frank-Wolfe","created":"2022-05-24","cited_by_count":16,"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":"2108.09767","title":"A Boosting Approach to Reinforcement Learning","created":"2021-08-22","cited_by_count":12,"area":null},{"id":"2305.08367","title":"Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Acceleration","created":"2023-05-15","cited_by_count":11,"area":null},{"id":"2302.04859","title":"Projection-free Online Exp-concave Optimization","created":"2023-02-09","cited_by_count":10,"area":null},{"id":"2305.16671","title":"A Unified Approach for Maximizing Continuous DR-submodular Functions","created":"2023-05-26","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":"2305.18442","title":"Improved Projection-free Online Continuous Submodular Maximization","created":"2023-05-29","cited_by_count":7,"area":null},{"id":"2501.18183","title":"Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization","created":"2025-01-30","cited_by_count":7,"area":null},{"id":"2208.08681","title":"Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization","created":"2022-08-18","cited_by_count":6,"area":null},{"id":"2401.08330","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","created":"2024-01-16","cited_by_count":6,"area":null},{"id":"2403.10063","title":"Unified Projection-Free Algorithms for Adversarial DR-Submodular Optimization","created":"2024-03-15","cited_by_count":5,"area":null},{"id":"2210.02719","title":"Continuous Diagnosis and Prognosis by Controlling the Update Process of Deep Neural Networks","created":"2022-10-06","cited_by_count":4,"area":null},{"id":"2402.08621","title":"A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization","created":"2024-02-13","cited_by_count":4,"area":null},{"id":"2208.06883","title":"Confidence-Guided Learning Process for Continuous Classification of Time Series","created":"2022-08-14","cited_by_count":3,"area":null},{"id":"2208.07632","title":"Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback","created":"2022-08-16","cited_by_count":3,"area":null},{"id":"2106.07836","title":"Improved Regret Bounds for Online Submodular Maximization","created":"2021-06-15","cited_by_count":2,"area":null},{"id":"2303.13604","title":"Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback","created":"2023-03-23","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":"2510.13713","title":"Don't Be Greedy, Just Relax! Pruning LLMs via Frank-Wolfe","created":"2025-10-15","cited_by_count":2,"area":null},{"id":"2205.07217","title":"Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback","created":"2022-05-15","cited_by_count":1,"area":null},{"id":"2210.16790","title":"One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization","created":"2022-10-30","cited_by_count":1,"area":null},{"id":"2402.02114","title":"Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach","created":"2024-02-03","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":"2105.03527","title":"Scalable Projection-Free Optimization","created":"2021-05-07","cited_by_count":0,"area":null},{"id":"2507.08543","title":"Quantum Algorithms for Projection-Free Sparse Convex Optimization","created":"2025-07-11","cited_by_count":0,"area":null},{"id":"2607.00680","title":"Distributed Online Bandit Submodular Maximization with Bounded Sampling Violations","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2609.00471","title":"Operational Regimes in Non-Convex Optimization: A Multiplier-Based Taxonomy","created":"2026-08-31","cited_by_count":0,"area":null}],"next_cursor":null}