{"total":23,"rows":[{"id":"2202.00132","title":"Submodularity In Machine Learning and Artificial Intelligence","created":"2022-01-31","cited_by_count":38,"area":null},{"id":"2307.13372","title":"Submodular Reinforcement Learning","created":"2023-07-25","cited_by_count":23,"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":"2310.18465","title":"Nearly Minimax Optimal Submodular Maximization with Bandit Feedback","created":"2023-10-27","cited_by_count":7,"area":null},{"id":"2205.12442","title":"Lyapunov function approach for approximation algorithm design and analysis: with applications in submodular maximization","created":"2022-05-25","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":"2307.16625","title":"Adversarial Causal Bayesian Optimization","created":"2023-07-31","cited_by_count":4,"area":null},{"id":"2407.03557","title":"Decision-Focused Evaluation of Worst-Case Distribution Shift","created":"2024-07-04","cited_by_count":4,"area":null},{"id":"2110.00391","title":"Online Primal-Dual Algorithms with Predictions for Packing Problems","created":"2021-10-01","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":"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":"2101.07423","title":"Submodular Maximization via Taylor Series Approximation","created":"2021-01-19","cited_by_count":1,"area":null},{"id":"2601.00611","title":"Stronger Approximation Guarantees for Non-Monotone {\\gamma}-Weakly DR-Submodular Maximization","created":"2026-01-02","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":"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":"2605.07902","title":"Curvature Beyond Positivity: Greedy Guarantees for Arbitrary Submodular Functions","created":"2026-05-08","cited_by_count":0,"area":null}],"next_cursor":null}