{"total":19,"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":"2106.04769","title":"Submodular + Concave","created":"2021-06-09","cited_by_count":13,"area":null},{"id":"2206.03718","title":"Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach","created":"2022-06-08","cited_by_count":13,"area":null},{"id":"2103.00384","title":"Adaptive Regularized Submodular Maximization","created":"2021-02-28","cited_by_count":8,"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":"2203.01629","title":"Learning Group Importance using the Differentiable Hypergeometric Distribution","created":"2022-03-03","cited_by_count":5,"area":null},{"id":"2101.01631","title":"On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions","created":"2021-01-05","cited_by_count":3,"area":null},{"id":"2405.20848","title":"SLIM: a Scalable Light-weight Root Cause Analysis for Imbalanced Data in Microservice","created":"2024-05-31","cited_by_count":2,"area":null},{"id":"2104.09884","title":"Multi-objective Evolutionary Algorithms are Generally Good: Maximizing Monotone Submodular Functions over Sequences","created":"2021-04-20","cited_by_count":1,"area":null},{"id":"2109.15180","title":"Submodular Optimization Beyond Nonnegativity: Adaptive Seed Selection in Incentivized Social Advertising","created":"2021-09-30","cited_by_count":1,"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":"2411.13513","title":"Procurement Auctions via Approximately Optimal Submodular Optimization","created":"2024-11-20","cited_by_count":1,"area":null},{"id":"2304.06048","title":"RELS-DQN: A Robust and Efficient Local Search Framework for Combinatorial Optimization","created":"2023-04-11","cited_by_count":0,"area":null},{"id":"2409.02943","title":"A Note On Deterministic Submodular Maximization With Bounded Curvature","created":"2024-08-25","cited_by_count":0,"area":null},{"id":"2503.23209","title":"A QUBO Framework for Team Formation","created":"2025-03-29","cited_by_count":0,"area":null},{"id":"2509.24814","title":"A Greedy PDE Router for Blending Neural Operators and Classical Methods","created":"2025-09-29","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},{"id":"2609.01493","title":"Rethinking Learnability in Offline Data-driven Optimization","created":"2026-09-01","cited_by_count":0,"area":null},{"id":"2610.14028","title":"Pick the Mixture, Not the Samples: Combinatorial Data Selection for LLMs","created":"2026-09-30","cited_by_count":0,"area":null}],"next_cursor":null}