{"total":35,"rows":[{"id":"2201.00703","title":"Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function","created":"2022-01-03","cited_by_count":21,"area":null},{"id":"2210.05965","title":"Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets","created":"2022-10-12","cited_by_count":14,"area":null},{"id":"2106.04769","title":"Submodular + Concave","created":"2021-06-09","cited_by_count":13,"area":null},{"id":"2305.12402","title":"Bandit Multi-linear DR-Submodular Maximization and Its Applications on Adversarial Submodular Bandits","created":"2023-05-21","cited_by_count":13,"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":"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":"2111.07990","title":"Fast First-Order Methods for Monotone Strongly DR-Submodular Maximization","created":"2021-11-15","cited_by_count":7,"area":null},{"id":"2305.18442","title":"Improved Projection-free Online Continuous Submodular Maximization","created":"2023-05-29","cited_by_count":7,"area":null},{"id":"2310.18465","title":"Nearly Minimax Optimal Submodular Maximization with Bandit Feedback","created":"2023-10-27","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":"2305.12795","title":"Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments","created":"2023-05-22","cited_by_count":6,"area":null},{"id":"2309.04339","title":"Online Submodular Maximization via Online Convex Optimization","created":"2023-09-08","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":"2209.12429","title":"Online Submodular Coordination with Bounded Tracking Regret: Theory, Algorithm, and Applications to Multi-Robot Coordination","created":"2022-09-26","cited_by_count":5,"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":"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":"2602.20578","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","created":"2026-02-24","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":"2107.00957","title":"Ascent Similarity Caching with Approximate Indexes","created":"2021-07-02","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":"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":"2401.09251","title":"Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2508.16992","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","created":"2025-08-23","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":"2602.13506","title":"$\\gamma$-weakly $\\theta$-up-concavity: A Unified Framework for Non-Convex Optimization Beyond DR-Submodular and OSS Functions","created":"2026-02-13","cited_by_count":1,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","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":"2208.00522","title":"Online Decentralized Frank-Wolfe: From theoretical bound to applications in smart-building","created":"2022-07-31","cited_by_count":0,"area":null},{"id":"2303.09960","title":"Stochastic Submodular Maximization via Polynomial Estimators","created":"2023-03-17","cited_by_count":0,"area":null},{"id":"2309.16161","title":"Leveraging Untrustworthy Commands for Multi-Robot Coordination in Unpredictable Environments: A Bandit Submodular Maximization Approach","created":"2023-09-28","cited_by_count":0,"area":null},{"id":"2404.17158","title":"Online $\\mathrm{L}^{\\natural}$-Convex Minimization","created":"2024-04-26","cited_by_count":0,"area":null},{"id":"2510.19480","title":"Online Two-Stage Submodular Maximization","created":"2025-10-22","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}],"next_cursor":null}