greedy selection

MUSS: Multilevel Subset Selection for Relevance and Diversity UAI 2026 PhaseWin Search Framework Enable Efficient Object-Level Interpretation CVPR 2026 Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals ICML 2025 Greed is good: correspondence recovery for unlabeled linear regression UAI 2023 Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence JMLR 2022 Sublinear time algorithms for greedy selection in high dimensions UAI 2022 apricot: Submodular selection for data summarization in Python JMLR 2020 Good Subnetworks Provably Exist: Pruning via Greedy Forward Selection ICML 2020 Which Scores to Predict in Sentence Regression for Text Summarization? NAACL 2018 Feature Selection via Dependence Maximization JMLR 2012 Forward Basis Selection for Sparse Approximation over Dictionary AISTATS 2012 Non-parametric Group Orthogonal Matching Pursuit for Sparse Learning with Multiple Kernels NeurIPS 2011 Grouped Orthogonal Matching Pursuit for Variable Selection and Prediction NeurIPS 2009