Shuying Huang, Junpeng Li, Changchun Hua, Yana Yang
{"title":"Learning from not-all-negative pairwise data and unlabeled data","authors":"Shuying Huang, Junpeng Li, Changchun Hua, Yana Yang","doi":"10.1016/j.patcog.2025.111442","DOIUrl":null,"url":null,"abstract":"<div><div>A weakly-supervised approach utilizing data pairs with comparative or similarity/dissimilarity information has gained popularity in various fields due to its cost-effectiveness. However, the challenge of dealing with not all negative (<em>i.e</em>., pairwise data that includes at least one positive) or not all positive (<em>i.e</em>., pairwise data that includes at least one negative) data pairs has not been specifically addressed by any algorithm. To overcome this bottleneck, this paper explores a novelty weakly-supervision framework of learning from pairwise data that includes at least one positive and unlabeled data points (<span><math><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>p</mi><mi>o</mi><mi>s</mi></mrow></msub><mi>U</mi></mrow></math></span>) as a representative. The provided pairwise data ensures that each data pair contains at least one positive data point. Unlabeled data refers to data without labeled information. Firstly, this paper shows an unbiased risk estimator for <span><math><mrow><msub><mrow><mi>P</mi></mrow><mrow><mi>p</mi><mi>o</mi><mi>s</mi></mrow></msub><mi>U</mi></mrow></math></span> data and use risk correction functions to mitigate the overfitting caused by negative terms. In addition, the estimation error bound is established for the empirical risk minimizer and the optimal convergence rate is obtained. Finally, the detailed experimental process and results are presented to demonstrate the effectiveness of the proposed method.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"163 ","pages":"Article 111442"},"PeriodicalIF":7.5000,"publicationDate":"2025-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325001025","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
A weakly-supervised approach utilizing data pairs with comparative or similarity/dissimilarity information has gained popularity in various fields due to its cost-effectiveness. However, the challenge of dealing with not all negative (i.e., pairwise data that includes at least one positive) or not all positive (i.e., pairwise data that includes at least one negative) data pairs has not been specifically addressed by any algorithm. To overcome this bottleneck, this paper explores a novelty weakly-supervision framework of learning from pairwise data that includes at least one positive and unlabeled data points () as a representative. The provided pairwise data ensures that each data pair contains at least one positive data point. Unlabeled data refers to data without labeled information. Firstly, this paper shows an unbiased risk estimator for data and use risk correction functions to mitigate the overfitting caused by negative terms. In addition, the estimation error bound is established for the empirical risk minimizer and the optimal convergence rate is obtained. Finally, the detailed experimental process and results are presented to demonstrate the effectiveness of the proposed method.
期刊介绍:
The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.