{"total":32,"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.12491","title":"Training Data Subset Selection for Regression with Controlled Generalization Error","created":"2021-06-23","cited_by_count":14,"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":"2108.09767","title":"A Boosting Approach to Reinforcement Learning","created":"2021-08-22","cited_by_count":12,"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":"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":"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":"2208.08681","title":"Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization","created":"2022-08-18","cited_by_count":6,"area":null},{"id":"2111.01262","title":"Minimax Optimization: The Case of Convex-Submodular","created":"2021-11-01","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":"2406.09882","title":"Harm Mitigation in Recommender Systems under User Preference Dynamics","created":"2024-06-14","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":"2101.07423","title":"Submodular Maximization via Taylor Series Approximation","created":"2021-01-19","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.00138","title":"Decomposable Submodular Maximization in Federated Setting","created":"2024-01-31","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":"2303.09960","title":"Stochastic Submodular Maximization via Polynomial Estimators","created":"2023-03-17","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":"2310.09890","title":"Score-Based Methods for Discrete Optimization in Deep Learning","created":"2023-10-15","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":"2511.22944","title":"Bandit Guided Submodular Curriculum for Adaptive Subset Selection","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2607.11555","title":"Advancing Optimal Subset Oracle via Learning Relaxation of Neural Set Functions","created":"2026-07-13","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}