mlsanityData to 7 Oct 2026

SPOT: A framework for selection of prototypes using optimal transport

arXiv 2103.10159 ↗First posted 18 Mar 2021cs.LG cs.AI stat.MLcited by 13

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

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  3. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  5. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  6. 2018Computational Optimal Transportcited by 765
  7. 2015Optimal Transport for Domain Adaptationcited by 457
  8. 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
  9. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  10. 2015YFCC100M: The New Data in Multimedia Researchcited by 234
  11. 2013Fast Computation of Wasserstein Barycenterscited by 216
  12. 2015Learning with a Wasserstein Losscited by 194
6 more
  1. 2018Representer Point Selection for Explaining Deep Neural Networkscited by 187
  2. 2015The Bayesian Case Model: A Generative Approach for Case-Based Reasoning and Prototype Classificationcited by 76
  3. 2016Restricted Strong Convexity Implies Weak Submodularitycited by 51
  4. 2018Faster k-Medoids Clustering: Improving the PAM, CLARA, and CLARANS Algorithmscited by 44
  5. 2014MatConvNet - Convolutional Neural Networks for MATLABcited by 36
  6. 2020Geometry-aware Domain Adaptation for Unsupervised Alignment of Word Embeddingscited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 3; 2025: 2; 2026: 5.

13 papers.

Sort:

By area: