UniPROT reformulates uniform prototype selection as a partial optimal transport problem that yields a submodular objective admitting a greedy algorithm with (1-1/e) approximation guarantee.
Letγ P1 (IP1 ,∶)andγP2 (IP2 ,∶)represent the sub-matrices of the respective optimal solutions to the points inP 1 andP 2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guarantees
UniPROT reformulates uniform prototype selection as a partial optimal transport problem that yields a submodular objective admitting a greedy algorithm with (1-1/e) approximation guarantee.