Corporate profiling serves as a critical analytical tool for modern enterprises, enabling data-driven decision-making in investment strategies, risk assessment, and strategic planning. It requires integrating quantitative metrics, qualitative insights, and network relationships to capture a company’s role in the business ecosystem. However, traditional methods struggle to synthesize heterogeneous data and model complex interdependencies among corporations, news, and market dynamics, often addressing these aspects in isolation. To address these challenges, this article introduces Financial Graph-based Mixture of Experts Prompt Learning (FGMPL), an innovative framework that unifies graph prompt learning with a multi-task paradigm for corporate profile modeling. The proposed framework reformulates node- and edge-level tasks into a coherent graph-level representation and employs multi-view contrastive learning to effectively integrate textual details with relational structures. Moreover, a novel Financial Multi-Experts Prompting mechanism—with learnable tokens coupled with a Mixture of Experts (MoE) design—is presented to enhance the processing of heterogeneous graph data and bridge the gap between pre-training and downstream tasks. To further improve adaptability, a meta-learning-based prompt tuning strategy is incorporated, enabling rapid transition to various downstream applications. Extensive experiments on real-world financial graphs show that FGMPL consistently outperforms strong pre-training and graph-prompting baselines across corporate performance prediction, relationship prediction, and news classification in both full-data and few-shot settings. In addition, cross-market transfer on a NASDAQ dataset and interpretability/efficiency analyses further demonstrate its robustness and practical applicability.

The next point-of-interest (POI) recommendation is a hot-spot for both industry and academia, which helps users better experience the physical world. However, existing methods suffer from a severe bias towards recommending repeat POIs that have been visited by the target user before, and perform inefficiently when recommending new POIs that have not been visited by the target user yet. To overcome this issue, we delve into the next new POI recommendation and uncover the coexistence of local and global exploration patterns in users’ visits to new POIs, showing their willingness to explore not only nearby new POIs but also those distant ones. Subsequently, we develop a novel L ocal and G lobal E xploration framework (LGE) for the next new POI recommendation. In particular, LGE involves three key modules: 1) a Zone-Aware Local Exploration (ZLE) module, which encourages users to explore POIs in the local area by learning zone-aware POI representations and regularizing POI prediction with zone information; 2) an Intention-Aware Global Exploration (IGE) module, which recommends POIs that meet user intentions without distance constraints by extracting static and dynamic intentions from category information; 3) a fusion module, which contains a Mean Pooling (MP) strategy and a Weighted Pooling (WP) strategy to aggregate the outputs of local and global exploration modules for the final recommendation. Experiments carried out on real-world datasets have shown the effectiveness of LGE in recommending new POIs.

Real-world observational datasets and machine learning have revolutionized data-driven decision-making, yet many models rely on empirical associations that may be misleading due to confounding and subgroup heterogeneity. Simpson's paradox exemplifies this challenge, where aggregated and subgroup-level associations contradict each other, leading to misleading conclusions. Existing methods provide limited support for detecting and interpreting such paradoxical associations, especially for practitioners without deep causal expertise. We introduce De-paradox Tree , an interpretable algorithm designed to uncover hidden subgroup patterns behind paradoxical associations under assumed causal structures involving confounders and effect heterogeneity. It employs novel split criteria and balancing-based procedures to adjust for confounders and homogenize heterogeneous effects through recursive partitioning. Compared to state-of-the-art methods, De-paradox Tree builds simpler, more interpretable trees, selects relevant covariates, and identifies nested opposite effects while ensuring robust estimation of causal effects when causally admissible variables are provided. Our approach addresses the limitations of traditional causal inference and machine learning methods by introducing an interpretable framework that supports non-expert practitioners while explicitly acknowledging causal assumptions and scope limitations, enabling more reliable and informed decision-making in complex observational data environments.

Link Prediction (LP) is a fundamental task in graph representation learning, with numerous applications in diverse domains. However, the generalizability of LP models is often compromised due to the presence of noisy or spurious information in graphs and the inherent incompleteness of graph data. To address these challenges, we draw inspiration from the Information Bottleneck principle and propose a novel data augmentation method, COmplete and REduce (CORE) to learn compact and predictive augmentations for LP models. In particular, CORE aims to recover missing edges in graphs while simultaneously removing noise from the graph structures, thereby enhancing the model’s robustness and performance. Extensive experiments on multiple benchmark datasets demonstrate the applicability and superiority of CORE over state-of-the-art methods, showcasing its potential as a leading approach for robust LP in graph representation learning.

Large language models (LLMs) significantly advance data augmentation research. However, existing approaches largely overlook two fundamental issues. First, empirical evidence demonstrating the alignment between LLM natural language (LLMNL) and human natural language (HNL) remains limited. Second, current methodologies often neglect the variability of LLMNL in comparison with HNL. To address the gap, we introduce a comprehensive scaling-law-based framework for examining the congruence between LLMNL and HNL. Through extensive experiments, we uncover a progression of findings: LLMNL fails to achieve congruence with HNL; there is a consistent discrepancy, with Mandelbrot exponents for LLMNL being approximately 0.2 lower than those of HNL; LLMNL exhibits reduced fractal complexity, corroborated our analysis to stylistic factors such as readability, sentiment, and semantics. Furthermore, we propose a new data augmentation approach for text classification, which leverages scaling laws to make decisions on LLM-generated texts. Extensive experiments under real-world scenarios demonstrate that our approach is competitive and robust, outperforming recent methods and consistently maintaining performance advantages across different LLMs and prompts.

Sequential Recommender Systems (SRSs) predict items of interest for users based on their historical interactions. Two key popular paradigms for SRs are unidirectional Next Item Prediction (NIP) and bidirectional Masked Language Modeling (MLM). NIP performs well in recommendation tasks but is constrained by its reliance on prior information and a rigid temporal order assumption, limiting its ability to capture dynamic personalized preferences. MLM, on the other hand, enhances sequence representation and personalization by leveraging bidirectional context, but its objective is misaligned with recommendation tasks. To this end, we develop MetaSR, a meta-learning-based SR approach that ingeniously combines both paradigms into a unified framework to enhance personalized sequential recommendation. Specifically, we treat the mask prediction task in MLM as the inner-loop task (i.e., the support set), adjusting mask items dynamically to generate sequences that match individual behavioral patterns to capture personalized user preferences. In the outer loop (i.e., the query set), we adopt the NIP paradigm to directly train MetaSR toward the SR target. The joint training bridges the gap between MLM and SRs tasks, also overcoming NIP’s limitations in capturing dynamic personalized preferences. Furthermore, to improve the overall efficiency, we develop a reinforcement learning-based Adaptive Masked Sequence Selection (AMSS) mechanism, automatically selecting the optimal masking prediction tasks within the meta-learning support set to accelerate the meta-learning and achieve better personalization. Experiments on multiple public benchmark datasets show that MetaSR significantly outperforms existing SRs models. The dataset and codes are available at MetaSR .

Multi-view classification aims to improve prediction performance by integrating heterogeneous data sources, leveraging the complementary and consistent information across different views. However, existing approaches predominantly focus on consistency and complementarity, often overlooking the role of diversity, which is crucial for enhancing generalization and mitigating redundancy. To address these issues, we propose a Tri-perspective Multi-view Fusion and Classification (TMFC) framework that systematically unifies consistency, complementarity, and diversity principles. TMFC consolidates multi-view data into a meta-view through feature concatenation and generates diverse latent views via random mapping, preserving structural information while reducing redundancy. These latent views are optimized through a unified formulation that balances alignment, information enrichment, and feature distinctiveness, reformulated as a semidefinite programming problem and efficiently solved using the reformulation-linearization technique with a cutting-plane algorithm. Extensive experiments on real-world datasets demonstrate TMFC’s superiority over state-of-the-art methods, achieving significant improvements in accuracy, normalized mutual information, and adjusted rand index.

Recommendation algorithms have been extensively applied in multiple areas. However, user-level uncertainty in implicit feedback introduce false-positive signals, misaligning interactions with true preferences and introducing noise. This makes it challenging for traditional recommendation methods to achieve both robust and accurate performance. In this manuscript, we propose a semi-supervised co-training algorithm for denoising learning in the recommender system, which incorporates both supervised learning and semi-supervised learning in a cooperative way. We first adopt a Gaussian Mixture Model as a confidence estimation module to partition the implicit feedback into two disjoint datasets: a reliable dataset and an unreliable dataset, based on the intrinsic features of the feedback. To achieve doubly robust learning, we design an iterative cross co-training module that consists of two key components: a two-stage reliable learning process and a cross-sample transmission mechanism. The two-stage reliable learning process enables semi-supervised training on both the reliable and unreliable datasets. Meanwhile, the cross-sample transmission mechanism iteratively transfers hard yet clean samples between dual networks, enhancing robustness through mutual supervision during joint learning. Extensive experiments are conducted using clean test sets extracted from four real-world explicit feedback datasets to validate our denoising method, which demonstrates superior effectiveness across all datasets.

In recent years, deep learning techniques have made significant strides in molecular generation for specific targets, driving advancements in drug discovery. However, existing molecular generation methods present significant limitations: those operating at the atomic level often lack synthetic feasibility, drug-likeness, and interpretability, while fragment-based approaches frequently overlook comprehensive factors that influence protein–molecule interactions. To address these challenges, we propose a novel fragment-based molecular generation framework tailored for specific proteins. Our method begins by constructing a protein subpocket and molecular arm concept-based neural network, which systematically integrates interaction force information and geometric complementarity to sample molecular arms for specific protein subpockets. Subsequently, we introduce a diffusion model to generate molecular backbones that connect these arms, ensuring structural integrity and chemical diversity. Our approach improves synthetic feasibility and binding affinity, with a 4% increase in drug-likeness and a 6% improvement in synthetic feasibility. Furthermore, by integrating explicit interaction data through a concept-based model, our framework enhances interpretability, offering valuable insights into the molecular design process.

Accurate spatial-temporal (ST) traffic prediction plays an essential role in intelligent transportation systems. Existing advanced traffic prediction methods typically utilize spatial-temporal graph neural networks (STGNNs) to capture the ST correlations and achieve excellent prediction performance. However, our experimental investigation reveals that existing static and dynamic graph-based STGNNs still incur excessive noise and redundancy, and fail to discover robust and reliable ST correlations in traffic networks. Moreover, most methods cannot explain the underlying reasons behind the ST correlations. To solve these problems, we propose a novel S patial- T emporal G raph M odeling framework via A daptive contrastive learning (ST-GMA). Firstly, we design a robust augmentation learning module to generate high-level and robust data augmentations via a self-supervised task for modeling reliable correlations. Then, we develop an adaptive contrastive learning module to update correlation graphs by effectively selecting positive and negative augmentations, reducing redundant calculations, and providing insights into the correlation changes. Finally, ST-GMA integrates the generated correlation graphs with ST convolution blocks to conduct traffic prediction tasks. Experimental results on five real-world datasets demonstrate that ST-GMA not only achieves significant prediction performance compared with state-of-the-art methods but also exhibits a new perspective on the interpretability of correlation changes.