{"total":24,"rows":[{"id":"2107.00717","title":"SIMILAR: Submodular Information Measures Based Active Learning In Realistic Scenarios","created":"2021-07-01","cited_by_count":84,"area":null},{"id":"2202.00132","title":"Submodularity In Machine Learning and Artificial Intelligence","created":"2022-01-31","cited_by_count":38,"area":null},{"id":"2105.02878","title":"Q-Match: Iterative Shape Matching via Quantum Annealing","created":"2021-05-06","cited_by_count":27,"area":null},{"id":"2112.00166","title":"TALISMAN: Targeted Active Learning for Object Detection with Rare Classes and Slices using Submodular Mutual Information","created":"2021-11-30","cited_by_count":27,"area":null},{"id":"2201.00730","title":"Faster Unbalanced Optimal Transport: Translation invariant Sinkhorn and 1-D Frank-Wolfe","created":"2022-01-03","cited_by_count":22,"area":null},{"id":"2208.04055","title":"Neural Set Function Extensions: Learning with Discrete Functions in High Dimensions","created":"2022-08-08","cited_by_count":14,"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":"2310.18465","title":"Nearly Minimax Optimal Submodular Maximization with Bandit Feedback","created":"2023-10-27","cited_by_count":7,"area":null},{"id":"2201.00387","title":"On the convex hull of convex quadratic optimization problems with indicators","created":"2022-01-02","cited_by_count":6,"area":null},{"id":"2309.04339","title":"Online Submodular Maximization via Online Convex Optimization","created":"2023-09-08","cited_by_count":6,"area":null},{"id":"2307.16625","title":"Adversarial Causal Bayesian Optimization","created":"2023-07-31","cited_by_count":4,"area":null},{"id":"2105.14275","title":"Greedy Bayesian Posterior Approximation with Deep Ensembles","created":"2021-05-29","cited_by_count":3,"area":null},{"id":"2201.12928","title":"PLATINUM: Semi-Supervised Model Agnostic Meta-Learning using Submodular Mutual Information","created":"2022-01-30","cited_by_count":3,"area":null},{"id":"2102.03585","title":"Scalable Inference of Sparsely-changing Markov Random Fields with Strong Statistical Guarantees","created":"2021-02-06","cited_by_count":2,"area":null},{"id":"2305.06677","title":"INGENIOUS: Using Informative Data Subsets for Efficient Pre-Training of Language Models","created":"2023-05-11","cited_by_count":2,"area":null},{"id":"2512.19142","title":"A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage","created":"2025-12-22","cited_by_count":2,"area":null},{"id":"2101.07423","title":"Submodular Maximization via Taylor Series Approximation","created":"2021-01-19","cited_by_count":1,"area":null},{"id":"2102.09029","title":"Joint Continuous and Discrete Model Selection via Submodularity","created":"2021-02-17","cited_by_count":1,"area":null},{"id":"2107.06028","title":"Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields","created":"2021-07-13","cited_by_count":1,"area":null},{"id":"2111.10175","title":"Randomized Algorithms for Monotone Submodular Function Maximization on the Integer Lattice","created":"2021-11-19","cited_by_count":1,"area":null},{"id":"2307.13750","title":"Solution Path of Time-varying Markov Random Fields with Discrete Regularization","created":"2023-07-25","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":"2212.13725","title":"Robust Sequence Networked Submodular Maximization","created":"2022-12-28","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}],"next_cursor":null}