Regarding risk assessment problems with multiple associated risks, a risk assessment method (RAM) is proposed in this paper. According to the risk-associated assessment information offered by expert panel, a comprehensive associated matrix is constructed to identify the influence relationship among risks so as to determine the hierarchical structure of risks. Then, based on the determined divided or undivided risk hierarchical structure as well as the possibility and loss of risks provided by expert panel, each value at risk (VAR) is calculated through knowledge related to probability theory. Finally, the feasibility and efficiency of the proposed method are demonstrated through a calculating case.
Multimodal Sentiment Analysis (MSA) aims to recognize human emotions by exploiting textual, acoustic, and visual modalities, and thus how to make full use of the interactions between different modalities is a central challenge of MSA. Interaction contains alignment and conflict aspects. Current works mainly emphasize alignment and the inherent differences between unimodal modalities, neglecting the fact that there are also potential conflicts between bimodal combinations. Additionally, multi-task learning-based conflict modeling methods often rely on the unstable generated labels. To address these challenges, we propose a novel multi-level conflict-aware network (MCAN) for multimodal sentiment analysis, which progressively segregates alignment and conflict constituents from unimodal and bimodal representations, and further exploits the conflict constituents with the conflict modeling branch. In the conflict modeling branch, we conduct discrepancy constraints at both the representation and predicted output levels, avoiding dependence on the generated labels. Experimental results on the CMU-MOSI and CMU-MOSEI datasets demonstrate the effectiveness of the proposed MCAN.
Financial fraud detection across institutions faces a fundamental tension between the need for diverse training data and regulatory prohibitions on sharing sensitive records. Existing federated learning approaches suffer from performance degradation under non-IID distributions and substantial utility losses when uniform differential privacy is applied to inherently sparse fraud signals. To this end, this paper proposes HiFraud, a hierarchical federated framework featuring three key components: fraud-aware dynamic clustering with complementarity regularization to group institutions by fraud pattern similarity while preserving rare-type representation; star-chain knowledge transfer augmented by not-true-class distillation to propagate novel fraud patterns rapidly within clusters while mitigating catastrophic forgetting; and privacy-adaptive aggregation via Rényi differential privacy composition, calibrating noise intensity to distributional divergence and fraud rarity. Experiments on IEEE-CIS, PaySim, and Worldline datasets show that HiFraud achieves an area under the receiver operating characteristic curve (AUC-ROC) of 0.935 under ε=2.3, outperforming DP-FedAvg by 10.5% while reducing convergence from 49 to 30 rounds. The framework also suppresses membership inference attack success to 10.2%, detects emerging fraud patterns within 3 h inside clusters, and improves rare fraud type detection by 23.0% over uniform privacy baselines. These results demonstrate that hierarchical architectures can effectively reconcile detection performance, formal privacy guarantees, and rapid threat response in collaborative fraud detection.
In this paper, we investigate the Malliavin differentiability and density smoothness of solutions to stochastic differential equations (SDEs) with non-Lipschitz coefficients. Specifically, we consider equations of the form where the drift b(·) and diffusion σ(·) may violate the global Lipschitz condition but satisfy weaker assumptions such as Hölder continuity, linear growth, and non-degeneracy. By employing Malliavin calculus theory, large deviation principles, and Fokker–Planck equations, we establish comprehensive results concerning the existence and uniqueness of solutions, their Malliavin differentiability, and the smoothness properties of density functions. Our main contributions include (1) proving the Malliavin differentiability of solutions under the standard linear growth condition combined with Hölder continuity; (2) establishing the existence and smoothness of density functions using Norris lemma and the Bismut–Elworthy–Li formula; and (3) providing optimal estimates for density functions through large deviation theory. These results have significant applications in financial mathematics (e.g., CIR, CEV, and Heston models), biological system modeling (e.g., stochastic population dynamics and neuronal and epidemiological models), and other scientific domains.
Since machine learning is applied in medicine, more and more medical data for prediction has been produced by monitoring patients, such as symptoms information of diabetes. This paper establishes a frame called the Diabetes Medication Bayes Matrix (DTBM) to structure the relationship between the symptoms of diabetes and the medication regimens for machine learning. The eigenvector of the DTBM is the stable distribution of different symptoms and medication regimens. Based on the DTBM, this paper proposes a machine-learning algorithm for completing missing medical data, which provides a theoretical basis for the prediction of a Bayesian matrix with missing medical information. The experimental results show the rationality and applicability of the given algorithms.