Search arXivSearch

arXiv · 2511.15374

Judicial Sentencing Prediction Based on Hybrid Models and Two-Stage Learning Algorithms

Abstract

The investigation of legal judgment prediction (LJP), such as sentencing prediction, has attracted broad attention for its potential to promote judicial fairness, making the accuracy and reliability of its computation result an increasingly critical concern. In view of this, we present a new sentencing model that shares both legal logic interpretability and strong prediction capability by introducing a two-stage learning algorithm. Specifically, we first construct a hybrid model that synthesizes a mechanism model based on the main factors for sentencing with a neural network modeling possible uncertain features. We then propose a two-stage learning algorithm: First, an adaptive stochastic gradient (ASG) algorithm is used to get good estimates for the unknown parameters in the mechanistic component of the hybrid model. Then, the Adam optimizer tunes all parameters to enhance the predictive performance of the entire hybrid model. The asymptotic convergence of the ASG-based adaptive predictor is established without requiring any excitation data conditions, thereby providing a good initial parameter estimate for prediction. Based on this, the fast-converging Adam optimizer further refines the parameters to enhance overall prediction accuracy. Experiments on a real-world dataset of intentional injury cases in China show that our new hybrid model combined with our two-stage ASG-Adam algorithm, outperforms the existing related methods in sentencing prediction performance, including those based on neural networks and saturated mechanism models.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruifen Dai, Xin Zheng, Fang Wang, Lei Guo. 2025-11-19. Judicial Sentencing Prediction Based on Hybrid Models and Two-Stage Learning Algorithms. https://arxiv.org/abs/2511.15374

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Monotonicity, global symplectification and the stability of Dry Ten Martini Problem

We prove that, for every irrational frequency and every analytic Type I potential, each supercritical spectral energy satisfying the gap-labelling condition is an endpoint of an open spectral gap. This establishes the conjecture of Ge--Jitomirskaya--You \cite{GJY,You} in the supercritical regime. Consequently, the ``all gaps open'' property of the supercritical almost Mathieu operator persists under sufficiently small analytic perturbations. The main ingredient is a global symplectification of the center bundle that preserves quantitative monotonicity. This allows us to study gap opening through the center dynamics of the dual long-range operator, which has no natural Schrödinger form. We first establish the result for trigonometric polynomial potentials and then pass to general analytic potentials by controlling the dependence on the truncation dimension. The proof combines a discrete Hellmann--Feynman identity, dimension-free Aubry duality in weighted analytic norms, and a quantitative cone argument based on pre-monotonicity. These estimates ensure that the gaps survive in the analytic limit. Our results establish analytic stability of the Dry Ten Martini Problem in the supercritical regime and give a partial answer to a question of M. Shamis on the persistence of periodic spectral gaps.

math.DS

Asymmetry of a class of Mellin transforms via bounded solutions

We introduce a family of parametrized non-homogeneous linear complex differential equations on $[1,\infty)$, depending on a complex parameter $s$ in the critical strip. We identify sufficient conditions on the non-homogeneous term that induce a structural asymmetry between the solutions corresponding to the parameters $s$ and $1-s$. More precisely, if both solutions with initial value $1$ are bounded on $[1,\infty)$, then necessarily $\Re(s)=\tfrac12$. The initial condition associated with the unique bounded solution corresponding to a parameter $s$ represents a zero of the Mellin transform associated with the non-homogeneous term at the point $s$.

math.DS

Self-similar Delone sets and Pisot numbers

We consider Delone point patterns with self-similarity. Under mild conditions, the similarity factor is a Pisot number if and only if the pattern is uniformly discrete. The classical case is a Meyer set $Λ$ with $Λ\supset θΛ$ for some $θ>1,$ for which $θ$ must be a Pisot number or a Salem number. When $Λ$ contains several similar copies of itself, the case of a Salem number drops out for $θ<2.$ On the other hand, strictly self-similar patterns with a Pisot factor must be Meyer sets. Various examples are given.

math.DS