{"total":13,"rows":[{"id":"2202.00132","title":"Submodularity In Machine Learning and Artificial Intelligence","created":"2022-01-31","cited_by_count":38,"area":null},{"id":"2205.08715","title":"Customizing ML Predictions for Online Algorithms","created":"2022-05-18","cited_by_count":21,"area":null},{"id":"2106.03403","title":"Network Inference and Influence Maximization from Samples","created":"2021-06-07","cited_by_count":9,"area":null},{"id":"2107.07508","title":"USCO-Solver: Solving Undetermined Stochastic Combinatorial Optimization Problems","created":"2021-07-15","cited_by_count":5,"area":null},{"id":"2111.03198","title":"On the Complexity of Dynamic Submodular Maximization","created":"2021-11-05","cited_by_count":5,"area":null},{"id":"2501.19300","title":"Offline Learning for Combinatorial Multi-armed Bandits","created":"2025-01-31","cited_by_count":5,"area":null},{"id":"2102.06486","title":"Adaptive Sampling for Fast Constrained Maximization of Submodular Function","created":"2021-02-12","cited_by_count":2,"area":null},{"id":"2102.11911","title":"Instance Specific Approximations for Submodular Maximization","created":"2021-02-23","cited_by_count":2,"area":null},{"id":"2405.12439","title":"No-Regret M${}^{\\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and Hardness of Adversarial Full-Information Setting","created":"2024-05-21","cited_by_count":1,"area":null},{"id":"2502.04554","title":"Unifying and Optimizing Data Values for Selection via Sequential Decision-Making","created":"2025-02-06","cited_by_count":1,"area":null},{"id":"2409.05265","title":"Learning Submodular Sequencing from Samples","created":"2024-09-09","cited_by_count":0,"area":null},{"id":"2410.08578","title":"Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit","created":"2024-10-11","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}],"next_cursor":null}