Distinguish Confusion in Legal Judgment Prediction via Revised Relation Knowledge
Nuo Xu, Pinghui Wang, Junzhou Zhao, Feiyang Sun, Lin Lan, Jing Tao, Li Pan, Xiaohong Guan
TL;DR
This work tackles confusion among similar law articles and data-imbalance-induced posterior confusion in Legal Judgment Prediction (LJP). It introduces D-LADAN, an end-to-end framework that combines a Graph Distillation Operator (GDO) over law-article communities with a momentum-updated memory mechanism to revise label relations in light of training dynamics, yielding a three-component fact representation $\tilde{\mathbf{v}}_f=[\mathbf{v}_f^{\text{b}} \oplus \mathbf{v}_f^{\text{p}} \oplus \mathbf{v}_f^{\text{r}}]$ for prediction. The method includes a graph construction layer, graph distillation, revised memories, and distinguishable attention-based re-encoders, with a loss that jointly optimizes prediction and memory updates. Empirical results on CAIL-small/big and Criminal datasets show state-of-the-art performance and improved tail-category accuracy, demonstrating robustness to data imbalance and better generalization. The approach is modular and adaptable to transformer backbones, and is extended with a D-LADAN_BERT variant to leverage token-level representations. Overall, D-LADAN offers a principled way to fuse prior legal knowledge with data-driven revision to enhance LJP reliability and fairness.
Abstract
Legal Judgment Prediction (LJP) aims to automatically predict a law case's judgment results based on the text description of its facts. In practice, the confusing law articles (or charges) problem frequently occurs, reflecting that the law cases applicable to similar articles (or charges) tend to be misjudged. Although some recent works based on prior knowledge solve this issue well, they ignore that confusion also occurs between law articles with a high posterior semantic similarity due to the data imbalance problem instead of only between the prior highly similar ones, which is this work's further finding. This paper proposes an end-to-end model named \textit{D-LADAN} to solve the above challenges. On the one hand, D-LADAN constructs a graph among law articles based on their text definition and proposes a graph distillation operation (GDO) to distinguish the ones with a high prior semantic similarity. On the other hand, D-LADAN presents a novel momentum-updated memory mechanism to dynamically sense the posterior similarity between law articles (or charges) and a weighted GDO to adaptively capture the distinctions for revising the inductive bias caused by the data imbalance problem. We perform extensive experiments to demonstrate that D-LADAN significantly outperforms state-of-the-art methods in accuracy and robustness.
