{"total":13,"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":"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":"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":"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":"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.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":"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}