Uncertainty-aware evidential learning for legal case retrieval with noisy correspondence

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-01-28 DOI:10.1016/j.ins.2025.121915
Weicong Qin , Weijie Yu , Kepu Zhang , Haiyuan Zhao , Jun Xu , Ji-Rong Wen
{"title":"Uncertainty-aware evidential learning for legal case retrieval with noisy correspondence","authors":"Weicong Qin ,&nbsp;Weijie Yu ,&nbsp;Kepu Zhang ,&nbsp;Haiyuan Zhao ,&nbsp;Jun Xu ,&nbsp;Ji-Rong Wen","doi":"10.1016/j.ins.2025.121915","DOIUrl":null,"url":null,"abstract":"<div><div>Legal case retrieval is a critical task in intelligent legal systems, providing relevant precedents to assist judges in their decision-making. While current data-driven neural retrieval methods have demonstrated impressive performance on clean, annotated data, they often ignore the robustness against noisy correspondences. In practice, legal annotators are required to identify <em>legal uncertainty</em>, which refers to the ambiguity or unpredictability in legal interpretations and applications, in relevance estimation between cases. This uncertainty often introduces noise into the training data, leading to unreliable predictions and potentially impacting the fairness and justice of downstream tasks. Focusing on this robustness issue, we propose a novel evidential learning framework called ELCR, which explicitly models the <em>legal uncertainty</em> and addresses noisy correspondences. Specifically, we first estimate the multi-faceted relevance between query-candidate cases from the concept, rule, and fact levels. These relevance estimations are then used to obtain the evidence-based uncertainty under the Dempster-Shafer Evidence Theory, which helps correct labels from noisy correspondence. Guided by two elaborate evidence-based training objectives, ELCR provides accurate uncertainty estimation, enhancing reliability and robustness. Extensive experiments on various noise proportions across two benchmark datasets demonstrate that our method exhibits robustness against noisy correspondences while maintaining competitive retrieval performance.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"702 ","pages":"Article 121915"},"PeriodicalIF":8.1000,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525000477","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Legal case retrieval is a critical task in intelligent legal systems, providing relevant precedents to assist judges in their decision-making. While current data-driven neural retrieval methods have demonstrated impressive performance on clean, annotated data, they often ignore the robustness against noisy correspondences. In practice, legal annotators are required to identify legal uncertainty, which refers to the ambiguity or unpredictability in legal interpretations and applications, in relevance estimation between cases. This uncertainty often introduces noise into the training data, leading to unreliable predictions and potentially impacting the fairness and justice of downstream tasks. Focusing on this robustness issue, we propose a novel evidential learning framework called ELCR, which explicitly models the legal uncertainty and addresses noisy correspondences. Specifically, we first estimate the multi-faceted relevance between query-candidate cases from the concept, rule, and fact levels. These relevance estimations are then used to obtain the evidence-based uncertainty under the Dempster-Shafer Evidence Theory, which helps correct labels from noisy correspondence. Guided by two elaborate evidence-based training objectives, ELCR provides accurate uncertainty estimation, enhancing reliability and robustness. Extensive experiments on various noise proportions across two benchmark datasets demonstrate that our method exhibits robustness against noisy correspondences while maintaining competitive retrieval performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Self-supervised temporal adaptive learning for weakly-supervised temporal action localization Predicting and interpreting healthcare trajectories from irregularly collected sequential patient data using AMITA A Pareto Front searching algorithm based on reinforcement learning for constrained multiobjective optimization Data-driven fault-tolerant consensus control for constrained nonlinear multiagent systems via adaptive dynamic programming An intelligent medical recommendation model based on big data-driven estimation of physician ability
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1