{"total":35,"rows":[{"id":"2203.04940","title":"Data-Efficient Structured Pruning via Submodular Optimization","created":"2022-03-09","cited_by_count":23,"area":null},{"id":"2307.13372","title":"Submodular Reinforcement Learning","created":"2023-07-25","cited_by_count":23,"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":"2203.01693","title":"Learning Neural Set Functions Under the Optimal Subset Oracle","created":"2022-03-03","cited_by_count":10,"area":null},{"id":"2202.03051","title":"Using Partial Monotonicity in Submodular Maximization","created":"2022-02-07","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":"2102.13382","title":"Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel","created":"2021-02-26","cited_by_count":5,"area":null},{"id":"2101.07157","title":"Maximizing approximately k-submodular functions","created":"2021-01-18","cited_by_count":4,"area":null},{"id":"2304.09068","title":"METAM: Goal-Oriented Data Discovery","created":"2023-04-18","cited_by_count":4,"area":null},{"id":"2602.17695","title":"EXACT: Explicit Attribute-Guided Decoding-Time Personalization","created":"2026-02-06","cited_by_count":4,"area":null},{"id":"2305.11046","title":"Difference of Submodular Minimization via DC Programming","created":"2023-05-18","cited_by_count":3,"area":null},{"id":"2309.06392","title":"A Fast Algorithm for Moderating Critical Nodes via Edge Removal","created":"2023-09-09","cited_by_count":3,"area":null},{"id":"2502.16870","title":"Distributionally Robust Active Learning for Gaussian Process Regression","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2111.14674","title":"Online MAP Inference and Learning for Nonsymmetric Determinantal Point Processes","created":"2021-11-29","cited_by_count":2,"area":null},{"id":"2201.08417","title":"Scalable Sampling for Nonsymmetric Determinantal Point Processes","created":"2022-01-20","cited_by_count":2,"area":null},{"id":"2209.05170","title":"Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise","created":"2022-09-12","cited_by_count":2,"area":null},{"id":"2402.15053","title":"Nonlinear Bayesian optimal experimental design using logarithmic Sobolev inequalities","created":"2024-02-23","cited_by_count":2,"area":null},{"id":"2102.05954","title":"Demarcating Endogenous and Exogenous Opinion Dynamics: An Experimental Design Approach","created":"2021-02-11","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":"2207.03091","title":"Online SuBmodular + SuPermodular (BP) Maximization with Bandit Feedback","created":"2022-07-07","cited_by_count":1,"area":null},{"id":"2103.02687","title":"Lazy FSCA for Unsupervised Variable Selection","created":"2021-03-03","cited_by_count":0,"area":null},{"id":"2108.08758","title":"Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity","created":"2021-08-19","cited_by_count":0,"area":null},{"id":"2209.14222","title":"Online Subset Selection using $\\alpha$-Core with no Augmented Regret","created":"2022-09-28","cited_by_count":0,"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":"2305.14632","title":"Supermodular Rank: Set Function Decomposition and Optimization","created":"2023-05-24","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":"2410.17945","title":"Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization","created":"2024-10-23","cited_by_count":0,"area":null},{"id":"2507.01841","title":"Automatic Rank Determination for Low-Rank Adaptation via Submodular Function Maximization","created":"2025-07-02","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":"2511.22944","title":"Bandit Guided Submodular Curriculum for Adaptive Subset Selection","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2605.10151","title":"Learning to Sparsify Stochastic Linear Bandits","created":"2026-05-11","cited_by_count":0,"area":null},{"id":"2606.07954","title":"Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matching","created":"2026-06-06","cited_by_count":0,"area":null},{"id":"2607.06642","title":"The Approximation Ratio for the Risk of Myopic Bayesian Active Learning for Linear Regression","created":"2026-07-07","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}