{"total":30,"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":"2307.13372","title":"Submodular Reinforcement Learning","created":"2023-07-25","cited_by_count":23,"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":"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.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":"2309.04339","title":"Online Submodular Maximization via Online Convex Optimization","created":"2023-09-08","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":"2509.18383","title":"G\\\"odel Test: Can Large Language Models Solve Easy Conjectures?","created":"2025-09-22","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":"2106.07836","title":"Improved Regret Bounds for Online Submodular Maximization","created":"2021-06-15","cited_by_count":2,"area":null},{"id":"2101.07423","title":"Submodular Maximization via Taylor Series Approximation","created":"2021-01-19","cited_by_count":1,"area":null},{"id":"2102.09029","title":"Joint Continuous and Discrete Model Selection via Submodularity","created":"2021-02-17","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":"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":"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":"2105.03527","title":"Scalable Projection-Free Optimization","created":"2021-05-07","cited_by_count":0,"area":null},{"id":"2207.05937","title":"Game of Trojans: A Submodular Byzantine Approach","created":"2022-07-13","cited_by_count":0,"area":null},{"id":"2303.11937","title":"High Probability Bounds for Stochastic Continuous Submodular Maximization","created":"2023-03-20","cited_by_count":0,"area":null},{"id":"2506.07952","title":"Discrete and Continuous Difference of Submodular Minimization","created":"2025-06-09","cited_by_count":0,"area":null},{"id":"2606.11804","title":"Toward Trustworthy AI: Multi-Target Adversarial Attacks and Robust Defenses for Continuous Data Summarization","created":"2026-06-10","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":"2608.30271","title":"Dec-BFTRL: Squre-Root Regret for Decentralized Online Upper-Linearizable Optimization under Separation Access with Application to Continuous Submodular Maximization","created":"2026-08-31","cited_by_count":0,"area":null}],"next_cursor":null}