Finding Key Training Data by Calculating Influence Score

Jiahao Xu, Fan Zhang, S. Khan
{"title":"Finding Key Training Data by Calculating Influence Score","authors":"Jiahao Xu, Fan Zhang, S. Khan","doi":"10.1145/3565387.3565403","DOIUrl":null,"url":null,"abstract":"Due to the complexity and opacity of decision models and increasing data volume requirements, this makes it more attractive to reduce data volume and improve model interpretability by selecting key data. In this paper, we propose an influence function-based method InfSort for data sorting and pruning, and demonstrate that the key data selected by this method outperforms an equal number of other data. In addition, we also found that the importance of the data is positively correlated with the speed and stability of the loss, and the key data is more conducive to speeding up the model convergence. We also developed a method CGT that prevents the risk of overfitting by controlling for the worst case distribution of the data. Experimental results show that our method is effective and efficient in emotion recognition tasks.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3565387.3565403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the complexity and opacity of decision models and increasing data volume requirements, this makes it more attractive to reduce data volume and improve model interpretability by selecting key data. In this paper, we propose an influence function-based method InfSort for data sorting and pruning, and demonstrate that the key data selected by this method outperforms an equal number of other data. In addition, we also found that the importance of the data is positively correlated with the speed and stability of the loss, and the key data is more conducive to speeding up the model convergence. We also developed a method CGT that prevents the risk of overfitting by controlling for the worst case distribution of the data. Experimental results show that our method is effective and efficient in emotion recognition tasks.
通过计算影响分数找到关键训练数据
由于决策模型的复杂性和不透明性以及对数据量需求的增加,通过选择关键数据来减少数据量和提高模型可解释性变得越来越有吸引力。在本文中,我们提出了一种基于影响函数的数据排序和修剪方法InfSort,并证明了该方法选择的关键数据优于同等数量的其他数据。此外,我们还发现数据的重要性与损失的速度和稳定性呈正相关,关键数据更有利于加快模型收敛。我们还开发了一种方法CGT,通过控制数据的最坏情况分布来防止过度拟合的风险。实验结果表明,该方法在情绪识别任务中是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信