Submodular Optimization
Overview
Submodular optimization uses diminishing returns to model problems such as coverage, data selection, and allocating tasks or resources. Because exact optimization is often computationally hard, common methods include greedy selection, continuous relaxations with rounding, and local exchanges, with guarantees for constraints such as cardinality, knapsack, and matroids. Current work also studies non-monotone objectives and applications in language-model data selection, robotics, and benchmark design. A central tension is preserving strong approximation or regret guarantees while handling limited feedback, communication, changing constraints, and more general objectives.
Latest papers
61 papers7 papers in the last four weeks, down 22% on the four weeks before. 0.1% of all new papers.