2025
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
AISTATS 2025poster
Modern instances of combinatorial optimization problems often exhibit billion-scale ground sets, which have many uninformative or redundant elements. In this work, we develop light-weight pruning algorithms to quickly discard elements that are unlikely to be part of an optimal solution. Under mild a…