SPOT: A framework for selection of prototypes using optimal transport
Not on the map. Why?
Abstract (arXiv)
In this work, we develop an optimal transport (OT) based framework to select informative prototypical examples that best represent a given target dataset. Summarizing a given target dataset via representative examples is an important problem in several machine learning applications where human understanding of the learning models and underlying data distribution is essential for decision making. We model the prototype selection problem as learning a sparse (empirical) probability distribution having the minimum OT distance from the target distribution. The learned probability measure supported on the chosen prototypes directly corresponds to their importance in representing the target data. We show that our objective function enjoys a key property of submodularity and propose an efficient greedy method that is both computationally fast and possess deterministic approximation guarantees. Empirical results on several real world benchmarks illustrate the efficacy of our approach.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 18 of its 61 references that are in the map. First posted on arXiv 18 Mar 2021.
Builds on
18 of 61 references.
References · 18
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2018Computational Optimal Transportcited by 765
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
- 2015YFCC100M: The New Data in Multimedia Researchcited by 234
- 2013Fast Computation of Wasserstein Barycenterscited by 216
- 2015Learning with a Wasserstein Losscited by 194
6 more
- 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
- 2015The Bayesian Case Model: A Generative Approach for Case-Based Reasoning and Prototype Classificationcited by 76
- 2016Restricted Strong Convexity Implies Weak Submodularitycited by 51
- 2018Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithmscited by 44
- 2014MatConvNet - Convolutional Neural Networks for MATLABcited by 36
- 2020Geometry-aware Domain Adaptation for Unsupervised Alignment of Word Embeddingscited by 14
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 3; 2025: 2; 2026: 5.
13 papers.
Sort:
By area:
- 2024RoVRM: A Robust Visual Reward Model Optimized via Auxiliary Textual Preference Datacited by 15
- 2022Riemannian block SPD coupling manifold and its application to optimal transportcited by 7
- 2024Submodular Framework for Structured-Sparse Optimal Transportcited by 4
- 2024A Riemannian Approach to Ground Metric Learning for Optimal Transportcited by 3
- 2026UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guaranteescited by 2
- 2021Deep SIMBAD: Active Landmark-based Self-localization Using Ranking -based Scene Descriptorcited by 1
- 2026A Riemannian Approach to Low-Rank Optimal Transportcited by 1
- 2022ProtoBandit: Efficient Prototype Selection via Multi-Armed Banditscited by 0
- 2025Prototype Selection Using Topological Data Analysiscited by 0
- 2025Adaptive Test-Time Training for Predicting Need for Invasive Mechanical Ventilation in Multi-Center Cohortscited by 0
- 2026Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matchingcited by 0
- 2026CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transportcited by 0
1 more
- 2026Skeletal Prototypes on Iterative Nerve Expansionscited by 0
- 2026Skeletal Prototypes on Iterative Nerve Expansions14 Sep 2026
- 2026CoverPrune: Coverage-Driven Token Pruning for 3D VLMs via Optimal Transport13 Aug 2026
- 2026A Riemannian Approach to Low-Rank Optimal Transport10 Jun 2026
- 2026Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matching6 Jun 2026
- 2026UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guarantees13 Apr 2026
- 2025Adaptive Test-Time Training for Predicting Need for Invasive Mechanical Ventilation in Multi-Center Cohorts7 Dec 2025
- 2025Prototype Selection Using Topological Data Analysis6 Nov 2025
- 2024A Riemannian Approach to Ground Metric Learning for Optimal Transport16 Sep 2024
- 2024RoVRM: A Robust Visual Reward Model Optimized via Auxiliary Textual Preference Data22 Aug 2024
- 2024Submodular Framework for Structured-Sparse Optimal Transport7 Jun 2024
- 2022ProtoBandit: Efficient Prototype Selection via Multi-Armed Bandits4 Oct 2022
- 2022Riemannian block SPD coupling manifold and its application to optimal transport30 Jan 2022
- 2022Riemannian block SPD coupling manifold and its application to optimal transportcited by 7
- 2024Submodular Framework for Structured-Sparse Optimal Transportcited by 4
- 2024A Riemannian Approach to Ground Metric Learning for Optimal Transportcited by 3
- 2026UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guaranteescited by 2
- 2021Deep SIMBAD: Active Landmark-based Self-localization Using Ranking -based Scene Descriptorcited by 1
- 2026A Riemannian Approach to Low-Rank Optimal Transportcited by 1
- 2022ProtoBandit: Efficient Prototype Selection via Multi-Armed Banditscited by 0
- 2025Prototype Selection Using Topological Data Analysiscited by 0
- 2025Adaptive Test-Time Training for Predicting Need for Invasive Mechanical Ventilation in Multi-Center Cohortscited by 0
- 2026Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matchingcited by 0
- 2026Skeletal Prototypes on Iterative Nerve Expansionscited by 0
- 2026Skeletal Prototypes on Iterative Nerve Expansions14 Sep 2026
- 2026A Riemannian Approach to Low-Rank Optimal Transport10 Jun 2026
- 2026Minibatch Selection for Language Models via Partition Matroid Constrained Gradient Matching6 Jun 2026
- 2026UniPROT: Uniform Prototype Selection via Partial Optimal Transport with Submodular Guarantees13 Apr 2026
- 2025Adaptive Test-Time Training for Predicting Need for Invasive Mechanical Ventilation in Multi-Center Cohorts7 Dec 2025
- 2025Prototype Selection Using Topological Data Analysis6 Nov 2025
- 2024A Riemannian Approach to Ground Metric Learning for Optimal Transport16 Sep 2024
- 2024Submodular Framework for Structured-Sparse Optimal Transport7 Jun 2024
- 2022ProtoBandit: Efficient Prototype Selection via Multi-Armed Bandits4 Oct 2022
- 2022Riemannian block SPD coupling manifold and its application to optimal transport30 Jan 2022
- 2021Deep SIMBAD: Active Landmark-based Self-localization Using Ranking -based Scene Descriptor6 Sep 2021