Affiliation:
1. University College Cork
Abstract
Abstract
In machine learning (ML), particularly in fields like natural language processing and computer vision, developing state-of-the-art models faces a significant challenge due to the high computational power needed for training. These models usually require vast datasets and long training periods, resulting in substantial costs and environmental impacts. Even though extremely large-scale models show promising performances without the need for further finetuning through few-shot and zero-shot learning, they still lag behind fine-tuning alternatives by big margins.This research explores training ML models with smaller yet highly representative subsets of datasets, utilizing submodular data selection. We propose a method Submodular Subset Selection with Importance Sampling (SuBIS), a two-stage process that synergizes clustering with importance sampling alongside submodular functions. This approach is designed to enhance dataset diversity while simultaneously reducing computational demands. Our empirical research indicates that training models with as little as \(10%\) carefully selected subsets of the original dataset can achieve performances that are competitively close, within three standard deviations, to those attained using the full training datasets. Moreover, SuBIS demonstrates its efficacy in scaling submodular functions to accommodate extremely large datasets. It substantially reduces the runtime required for these functions on large datasets by nearly a factor of \(10\) without any deterioration in downstream classification performance.
Publisher
Research Square Platform LLC
Reference168 articles.
1. Bachem, Olivier and Lucic, Mario and Krause, Andreas (2017) Practical coreset constructions for machine learning. arXiv preprint arXiv:1703.06476
2. Kaushal, Vishal and Ramakrishnan, Ganesh and Iyer, Rishabh (2022) Submodlib: A Submodular Optimization Library. arXiv preprint arXiv:2202.10680
3. Likas, Aristidis and Vlassis, Nikos and Verbeek, Jakob J (2003) The global k-means clustering algorithm. Pattern recognition 36(2): 451--461 Elsevier
4. Minghim, Rosane and Huancapaza, Liz and Artur, Erasmo and Telles, Guilherme P. and Belizario, Ivar V. (2020) Graphs from Features: Tree-Based Graph Layout for Feature Analysis. Algorithms 13(11) https://doi.org/10.3390/a13110302, Feature Analysis has become a very critical task in data analysis and visualization. Graph structures are very flexible in terms of representation and may encode important information on features but are challenging in regards to layout being adequate for analysis tasks. In this study, we propose and develop similarity-based graph layouts with the purpose of locating relevant patterns in sets of features, thus supporting feature analysis and selection. We apply a tree layout in the first step of the strategy, to accomplish node placement and overview based on feature similarity. By drawing the remainder of the graph edges on demand, further grouping and relationships among features are revealed. We evaluate those groups and relationships in terms of their effectiveness in exploring feature sets for data analysis. Correlation of features with a target categorical attribute and feature ranking are added to support the task. Multidimensional projections are employed to plot the dataset based on selected attributes to reveal the effectiveness of the feature set. Our results have shown that the tree-graph layout framework allows for a number of observations that are very important in user-centric feature selection, and not easy to observe by any other available tool. They provide a way of finding relevant and irrelevant features, spurious sets of noisy features, groups of similar features, and opposite features, all of which are essential tasks in different scenarios of data analysis. Case studies in application areas centered on documents, images and sound data demonstrate the ability of the framework to quickly reach a satisfactory compact representation from a larger feature set., 1999-4893, https://www.mdpi.com/1999-4893/13/11/302, 302
5. Schreiber, Jacob M and Bilmes, Jeffrey A and Noble, William Stafford (2020) apricot: Submodular selection for data summarization in Python.. J. Mach. Learn. Res. 21: 161--1