针对依赖于实例的部分标签学习的变量标签增强。

Ning Xu;Congyu Qiao;Yuchen Zhao;Xin Geng;Min-Ling Zhang
{"title":"针对依赖于实例的部分标签学习的变量标签增强。","authors":"Ning Xu;Congyu Qiao;Yuchen Zhao;Xin Geng;Min-Ling Zhang","doi":"10.1109/TPAMI.2024.3455260","DOIUrl":null,"url":null,"abstract":"Partial label learning (PLL) is a form of weakly supervised learning, where each training example is linked to a set of candidate labels, among which only one label is correct. Most existing PLL approaches assume that the incorrect labels in each training example are randomly picked as the candidate labels. However, in practice, this assumption may not hold true, as the candidate labels are often instance-dependent. In this paper, we address the instance-dependent PLL problem and assume that each example is associated with a latent \n<italic>label distribution</i>\n where the incorrect label with a high degree is more likely to be annotated as a candidate label. Motivated by this consideration, we propose two methods \n<sc>Valen</small>\n and \n<sc>Milen</small>\n, which train the predictive model via utilizing the latent label distributions recovered by the label enhancement process. Specifically, \n<sc>Valen</small>\n recovers the latent label distributions via inferring the variational posterior density parameterized by an inference model with the deduced evidence lower bound. \n<sc>Milen</small>\n recovers the latent label distribution by adopting the variational approximation to bound the mutual information among the latent label distribution, observed labels and augmented instances. Experiments on benchmark and real-world datasets validate the effectiveness of the proposed methods.","PeriodicalId":94034,"journal":{"name":"IEEE transactions on pattern analysis and machine intelligence","volume":"46 12","pages":"11298-11313"},"PeriodicalIF":0.0000,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Variational Label Enhancement for Instance-Dependent Partial Label Learning\",\"authors\":\"Ning Xu;Congyu Qiao;Yuchen Zhao;Xin Geng;Min-Ling Zhang\",\"doi\":\"10.1109/TPAMI.2024.3455260\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Partial label learning (PLL) is a form of weakly supervised learning, where each training example is linked to a set of candidate labels, among which only one label is correct. Most existing PLL approaches assume that the incorrect labels in each training example are randomly picked as the candidate labels. However, in practice, this assumption may not hold true, as the candidate labels are often instance-dependent. In this paper, we address the instance-dependent PLL problem and assume that each example is associated with a latent \\n<italic>label distribution</i>\\n where the incorrect label with a high degree is more likely to be annotated as a candidate label. Motivated by this consideration, we propose two methods \\n<sc>Valen</small>\\n and \\n<sc>Milen</small>\\n, which train the predictive model via utilizing the latent label distributions recovered by the label enhancement process. Specifically, \\n<sc>Valen</small>\\n recovers the latent label distributions via inferring the variational posterior density parameterized by an inference model with the deduced evidence lower bound. \\n<sc>Milen</small>\\n recovers the latent label distribution by adopting the variational approximation to bound the mutual information among the latent label distribution, observed labels and augmented instances. Experiments on benchmark and real-world datasets validate the effectiveness of the proposed methods.\",\"PeriodicalId\":94034,\"journal\":{\"name\":\"IEEE transactions on pattern analysis and machine intelligence\",\"volume\":\"46 12\",\"pages\":\"11298-11313\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on pattern analysis and machine intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10667671/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on pattern analysis and machine intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10667671/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

部分标签学习(PLL)是弱监督学习的一种形式,每个训练实例都与一组候选标签相关联,其中只有一个标签是正确的。大多数现有的 PLL 方法都假定,每个训练示例中的错误标签都是随机选取的候选标签。然而,在实践中,这一假设可能并不成立,因为候选标签往往取决于实例。在本文中,我们将解决与实例相关的 PLL 问题,并假设每个实例都与潜在标签分布相关联,其中错误标签的度数高的标签更有可能被注释为候选标签。基于这一考虑,我们提出了 VALEN 和 MILEN 两种方法,它们通过利用标签增强过程恢复的潜在标签分布来训练预测模型。具体来说,VALEN 通过推断由推理模型参数化的变分后验密度和推导出的证据下限来恢复潜在标签分布。MILEN 通过采用变分近似来约束潜在标签分布、观察标签和增强实例之间的互信息,从而恢复潜在标签分布。在基准数据集和实际数据集上进行的实验验证了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Variational Label Enhancement for Instance-Dependent Partial Label Learning
Partial label learning (PLL) is a form of weakly supervised learning, where each training example is linked to a set of candidate labels, among which only one label is correct. Most existing PLL approaches assume that the incorrect labels in each training example are randomly picked as the candidate labels. However, in practice, this assumption may not hold true, as the candidate labels are often instance-dependent. In this paper, we address the instance-dependent PLL problem and assume that each example is associated with a latent label distribution where the incorrect label with a high degree is more likely to be annotated as a candidate label. Motivated by this consideration, we propose two methods Valen and Milen , which train the predictive model via utilizing the latent label distributions recovered by the label enhancement process. Specifically, Valen recovers the latent label distributions via inferring the variational posterior density parameterized by an inference model with the deduced evidence lower bound. Milen recovers the latent label distribution by adopting the variational approximation to bound the mutual information among the latent label distribution, observed labels and augmented instances. Experiments on benchmark and real-world datasets validate the effectiveness of the proposed methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信