Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection

ArXi:2603.21492v1 Announce Type: new Identifying the most representative subset for a close-to-submodular objective while satisfying the predefined partition constraint is a fundamental task with numerous applications in machine learning. However, the existing distorted local-search methods are often hindered by their prohibitive query complexities and the rigid requirement for prior knowledge of difficult-to-obtain structural parameters. To overcome these limitations, we