Papers › Greedy Frank-Wolfe Algorithm for Exemplar Selection
Greedy Frank-Wolfe Algorithm for Exemplar Selection
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.
Code
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.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
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