conftrace_

set cover

13 papers

Explore in graph

Co-occurring keywords · papers mentioning both

online algorithm (3) submodular set cover (2) competitive analysis (2) set cover problem (2) online learning (2) combinatorial optimization (2) repeated active learning (1) hypothesis class (1) vertex cover (1) subsampling (1)

Papers

Formalizing Task-Space Complexity for Zero-Shot Generalization L4DC 2026 Improved Approximations for Hard Graph Problems using Predictions ICML 2025 Minimal Evidence Group Identification for Claim Verification NAACL 2025 Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization ICML 2024 An Improved Algorithm for Online Min-Sum Set Cover AAAI 2023 Buying Information for Stochastic Optimization ICML 2023 Discrete-Smoothness in Online Algorithms with Predictions NeurIPS 2023 Globally-Consistent Rule-Based Summary-Explanations for Machine Learning Models: Application to Credit-Risk Evaluation JMLR 2023 Augmenting Online Algorithms with ε-Accurate Predictions NeurIPS 2022 Learning View Selection for 3D Scenes CVPR 2021 Solving Set Cover and Dominating Set via Maximum Satisfiability AAAI 2020 Smooth Interactive Submodular Set Cover NeurIPS 2015 Online Submodular Set Cover, Ranking, and Repeated Active Learning NeurIPS 2011