GIST: Greedy Independent Set Thresholding for Diverse Data Summarization
Abstract: We introduce a novel subset selection problem called min-distance diversification with monotone submodular utility ($\textsf{MDMS}$), which has a wide variety of applications in machine learning, e.g., data sampling and feature selection. Given a set of points in a metric space, the goal of $\textsf{MDMS}$ is to maximize an objective function combining a monotone submodular utility term and a min-distance diversity term between any pair of selected points, subject to a cardinality constraint. We propose the $\texttt{GIST}$ algorithm, which achieves a $\frac{1}{2}$-approximation guarantee for $\textsf{MDMS}$ by approximating a series of maximum independent set problems with a bicriteria greedy algorithm. We also prove that it is NP-hard to approximate to within a factor of $0.5584$. Finally, we demonstrate that $\texttt{GIST}$ outperforms existing benchmarks for on a real-world image classification task that studies single-shot subset selection for ImageNet.
- Improved approximation and scalability for fair max-min diversification. In Proceedings of the 25th International Conference on Database Theory, pages 7:1–7:21, 2022.
- P. Alimonti and V. Kann. Some APX-completeness results for cubic graphs. Theoretical Computer Science, 237(1-2):123–134, 2000.
- Gemini: A family of highly capable multimodal models. arXiv preprint arXiv:2312.11805, 2023.
- Deep batch active learning by diverse, uncertain gradient lower bounds. In Proceedings of the 8th International Conference on Learning Representations, 2020.
- G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. Journal of Algorithms, 38(1):91–109, 2001.
- Cover trees for nearest neighbor. In Proceedings of the 23rd International Conference on Machine Learning, pages 97–104, 2006.
- Linear relaxations for finding diverse elements in metric spaces. Advances in Neural Information Processing Systems, 29:4098–4106, 2016.
- Batch active learning at scale. Advances in Neural Information Processing Systems, 34:11933–11944, 2021.
- Accelerating large-scale inference with anisotropic vector quantization. In International Conference on Machine Learning, pages 3887–3896. PMLR, 2020.
- J. Håstad. Clique is hard to approximate within n1−εsuperscript𝑛1𝜀n^{1-\varepsilon}italic_n start_POSTSUPERSCRIPT 1 - italic_ε end_POSTSUPERSCRIPT. In Proceedings of 37th Conference on Foundations of Computer Science, pages 627–636, 1996.
- J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798–859, 2001.
- Deep residual learning for image recognition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 770–778, 2016.
- An efficient approximation for point-set diameter in higher dimensions. In Proceedings of the 30th Canadian Conference on Computational Geometry, pages 72–77, 2018.
- M. Izbicki and C. Shelton. Faster cover trees. In International Conference on Machine Learning, pages 1162–1170. PMLR, 2015.
- Challenges and opportunities for autonomous vehicle query systems. In Proceedings of the Conference on Innovative Data Systems Research, 2021.
- Batchbald: Efficient and diverse batch acquisition for deep bayesian active learning. Advances in Neural Information Processing Systems, 32, 2019.
- S. Mahabadi and S. Trajanovski. Core-sets for fair and diverse data summarization. Advances in Neural Information Processing Systems, 2023.
- Maximum-score diversity selection for early drug discovery. Journal of Chemical Information and Modeling, 51(2):237–247, 2011.
- Diverse data selection under fairness constraints. In Proceedings of the 24th International Conference on Database Theory, pages 13:1–13:25, 2020.
- D. Roth and K. Small. Margin-based active learning for structured output spaces. In Proceedings of the 17th European Conference on Machine Learning, 2006.
- Imagenet large scale visual recognition challenge. International Journal of Computer Vision, 115:211–252, 2015.
- O. Sener and S. Savarese. Active learning for convolutional neural networks: A core-set approach. In Proceedings of the 6th International Conference on Learning Representations, 2018.
- Submodularity in data subset selection and active learning. In International Conference on Machine Learning, pages 1954–1963. PMLR, 2015.
- F. Zhdanov. Diverse mini-batch active learning. arXiv preprint arXiv:1901.05954, 2019.
- D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pages 681–690, 2006.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
