SuBIS: Submodular Subset Selection with Importance Sampling for Data-Efficient Machine Learning

Author:

Trust Paul1,Younis Haseeb1,Minghim Rosane1

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3