Papers › Greedy Frank-Wolfe Algorithm for Exemplar Selection

Greedy Frank-Wolfe Algorithm for Exemplar Selection

6 Nov 2018arXiv:1811.02702archive 2025-07-28

Gary Cheng, Armin Askari, Kannan Ramchandran, Laurent El Ghaoui

In this paper, we consider the problem of selecting representatives from a data set for arbitrary supervised/unsupervised learning tasks. We identify a subset S of a data set A such that 1) the size of S is much smaller than A and 2) S efficiently describes the entire data set, in a way formalized via convex optimization. In order to generate |S| = k exemplars, our kernelizable algorithm, Frank-Wolfe Sparse Representation (FWSR), only needs to execute ≈k iterations with a per-iteration cost that is quadratic in the size of A. This is in contrast to other state of the art methods which need to execute until convergence with each iteration costing an extra factor of d (dimension of the data). Moreover, we also provide a proof of linear convergence for our method. We support our results with empirical experiments; we test our algorithm against current methods in three different experimental setups on four different data sets. FWSR outperforms other exemplar finding methods both in speed and accuracy in almost all scenarios.

PaperPDFCode

Syntology This paper's arXiv id is not in Syntology's Atlas id list (549,449 ids, as this build read them; the read time is in the build record), so this page links to no Syntology page for it. The list is not the whole graph; Syntology's feed shows papers as they enter the graph.

Code

garyxcheng/FWSR officialmentioned in papermentioned on GitHubSyntology: not harvested report
srvCodes/continual-learning-benchmark mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Overcoming catastrophic forgetting in neural networks (arXiv:1612.00796; that paper's own run record: 16 ran (of which 8 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 4 where Syntology's instrument failed) · 6 unverified) and Continual Learning in Sensor-based Human Activity Recognition: an Empirical Benchmark Analysis (arXiv:2104.09396; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Dictionary Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections