SearcharxivSearch

arXiv subjects

Yiqing Lin

Publications and source records attributed to Yiqing Lin.

At least 19 recordsLinked to original sources

GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks

Graphs are widely used to model relational systems, with applications in domains such as social networks, finance, and biomedicine. Graph neural networks (GNNs) have become a mainstream approach for learning graph representations. With the rise of large language models (LLMs), recent studies have attempted to combine GNNs with LLMs. However, most existing works concentrate on node-level and edge-level tasks, while graph-level tasks, which require capturing more complex structural and feature information, remain relatively underexplored. Moreover, graph pretraining is a widely adopted strategy to alleviate the challenge of label scarcity. Most existing approaches are designed solely for GNNs such as GraphCL, leaving LLMs uninvolved in the process. To address these limitations, we propose GLIP, a Graph-LLM JoInt Pretraining framework for graph-level tasks. GLIP first performs graph augmentation to construct positive and negative pairs and introduces a multi-token selection strategy to identify patches informative in both structure and features. It further leverages a diffusion-based projector to enrich them with contextual information, enabling GLIP to capture signals from both global and local perspectives. Finally, GLIP employs a joint objective that integrates the LLM's semantic judgments with a contrastive alignment loss, ensuring consistent supervision at both the semantic and structural levels. After pretraining, GLIP is fine-tuned with limited labeled data for downstream tasks, and extensive experiments show that it outperforms state-of-the-art methods on graph-level classification and reasoning tasks. Our source code is publicly available at https://anonymous.4open.science/r/GLIP.

cs.LG

Infinite horizon quadratic backward stochastic differential equations driven by $G$-Brownian motion

The aim is to prove the well-posedness of infinite horizon backward stochastic differential equations driven by $G$-Brownian motion ($G$-BSDEs) with quadratic generators. To this end, we provide a full construction of explicit solutions to linear $G$-BSDEs with unbounded coefficients and the linearization method under the quadratic assumption. In addition, the comparison theorems for both finite and infinite horizon $G$-BSDEs are established.

math.PR

Towards Anomaly-Aware Pre-Training and Fine-Tuning for Graph Anomaly Detection

Graph anomaly detection (GAD) has garnered increasing attention in recent years, yet remains challenging due to two key factors: (1) label scarcity stemming from the high cost of annotations and (2) homophily disparity at node and class levels. In this paper, we introduce Anomaly-Aware Pre-Training and Fine-Tuning (APF), a targeted and effective framework to mitigate the above challenges in GAD. In the pre-training stage, APF incorporates node-specific subgraphs selected via the Rayleigh Quotient, a label-free anomaly metric, into the learning objective to enhance anomaly awareness. It further introduces two learnable spectral polynomial filters to jointly learn dual representations that capture both general semantics and subtle anomaly cues. During fine-tuning, a gated fusion mechanism adaptively integrates pre-trained representations across nodes and dimensions, while an anomaly-aware regularization loss encourages abnormal nodes to preserve more anomaly-relevant information. Furthermore, we theoretically show that APF tends to achieve linear separability under mild conditions. Comprehensive experiments on 10 benchmark datasets validate the superior performance of APF in comparison to state-of-the-art baselines.

cs.LG

UniGAD: Unifying Multi-level Graph Anomaly Detection

Graph Anomaly Detection (GAD) aims to identify uncommon, deviated, or suspicious objects within graph-structured data. Existing methods generally focus on a single graph object type (node, edge, graph, etc.) and often overlook the inherent connections among different object types of graph anomalies. For instance, a money laundering transaction might involve an abnormal account and the broader community it interacts with. To address this, we present UniGAD, the first unified framework for detecting anomalies at node, edge, and graph levels jointly. Specifically, we develop the Maximum Rayleigh Quotient Subgraph Sampler (MRQSampler) that unifies multi-level formats by transferring objects at each level into graph-level tasks on subgraphs. We theoretically prove that MRQSampler maximizes the accumulated spectral energy of subgraphs (i.e., the Rayleigh quotient) to preserve the most significant anomaly information. To further unify multi-level training, we introduce a novel GraphStitch Network to integrate information across different levels, adjust the amount of sharing required at each level, and harmonize conflicting training goals. Comprehensive experiments show that UniGAD outperforms both existing GAD methods specialized for a single task and graph prompt-based approaches for multiple tasks, while also providing robust zero-shot task transferability. All codes can be found at https://github.com/lllyyq1121/UniGAD.

cs.LG

Non-concave utility maximization problem with transaction costs and a given consistent price system

We investigate expected utility maximization problems from the terminal liquidation value in continuous time in markets with transaction costs and one fixed consistent price system, where a non-concave utility function is defined on the positive half real line. The sufficient conditions are given by the convex conjugate of the utility function, then the existence of the optimizer is proved by a maximizing sequence. Finally, we show that the value function of the envelope of the utility function and the concave envelope of the value function are coincide.

math.OC

Mean-reflected $G$-BSDEs with multi-variate constraints

In this paper, we study the multi-dimensional reflected backward stochastic differential equation driven by $G$-Brownian motion ($G$-BSDE) with a multi-variate constraint on the $G$-expectation of its solution. The generators are diagonally dependent on $Z$ and on all $Y$-components. We obtain the existence and uniqueness result via a fixed-point argumentation.

math.PR

Propagation of chaos for mean-field reflected BSDEs with jumps

In this paper, we study a class of mean-field reflected backward stochastic differential equations (MF-RBSDEs) driven by a marked point process and also analyze MF-RBSDEs driven by a Poisson process. Based on a $g$-expectation representation lemma, we give the existence and uniqueness of the particle system of MF-RBSDEs driven by a marked point process under Lipschitz generator conditions and obtain a convergence result of this system. We also establish the well-posedness of the MF-RBSDEs driven by a Poisson process and the convergence rate of the corresponding particle system towards the solution to the MF-RBSDEs driven by a Poisson process under bounded terminal, bounded obstacle conditions.

math.PR

ProG: A Graph Prompt Learning Benchmark

Artificial general intelligence on graphs has shown significant advancements across various applications, yet the traditional 'Pre-train & Fine-tune' paradigm faces inefficiencies and negative transfer issues, particularly in complex and few-shot settings. Graph prompt learning emerges as a promising alternative, leveraging lightweight prompts to manipulate data and fill the task gap by reformulating downstream tasks to the pretext. However, several critical challenges still remain: how to unify diverse graph prompt models, how to evaluate the quality of graph prompts, and to improve their usability for practical comparisons and selection. In response to these challenges, we introduce the first comprehensive benchmark for graph prompt learning. Our benchmark integrates SIX pre-training methods and FIVE state-of-the-art graph prompt techniques, evaluated across FIFTEEN diverse datasets to assess performance, flexibility, and efficiency. We also present 'ProG', an easy-to-use open-source library that streamlines the execution of various graph prompt models, facilitating objective evaluations. Additionally, we propose a unified framework that categorizes existing graph prompt methods into two main approaches: prompts as graphs and prompts as tokens. This framework enhances the applicability and comparison of graph prompt techniques. The code is available at: https://github.com/sheldonresearch/ProG.

cs.LG

Particle systems for mean reflected BSDEs with jumps

In this paper, we study the mean reflected backward stochastic differential equations with jump (BSDEJs). We extend the work of Briand and Hibon on the propagation of chaos for mean reflected BSDEs \cite{briand2021particles} to the jump framework. Besides, we study the reflections for the particle system and obtain the rate of of convergence of the particle system towards the deterministic flat solution to the mean reflected BSDEJ.

math.PR

Mean-field reflected BSDEs driven by a marked point process

In this paper, we study a class of mean-field reflected backward stochastic differential equations (MFRBSDEs) driven by a marked point process. Based on a g-expectation representation lemma, we give the existence and uniqueness of MFRBSDEs driven by a marked point process under Lipschitz generator conditions. Besides, the well-posedness of this kind of BSDEs with exponential growth generator and unbounded terminal is also provided by $\theta$-method.

math.PR

Reflected BSDE driven by a marked point process with a convex/concave generator

In this paper, a class of reflected backward stochastic differential equations (RBSDE) driven by a marked point process (MPP) with a convex/concave generator is studied. Based on fixed point argument, $\theta$-method and truncation technique, the well-posedness of this kind of RBSDE with unbounded terminal condition and obstacle is investigated. Besides, we present an application on the pricing of American options via utility maximization, which is solved by constructing an RBSDE with a convex generator.

math.PR

Exponential growth BSDE driven by a marked point process

In this study, we investigate the well-posedness of exponential growth backward stochastic differential equations (BSDEs) driven by a marked point process (MPP) under unbounded terminal conditions. Our analysis utilizes a fixed-point argument, the $\theta$-method, and an approximation procedure. Additionally, we establish the solvability of mean-reflected exponential growth BSDEs driven by the MPP using the $\theta$-method.

math.PR

Mean reflected BSDE driven by a marked point process and application in insurance risk management

This paper aims to solve a super-hedging problem along with insurance re-payment under running risk management constraints. The initial endowment for the super-heding problem is characterized by a class of mean reflected backward stochastic differential equation driven by a marked point process (MPP) and a Brownian motion. By Lipschitz assumptions on the generators and proper integrability on the terminal value, we give the well-posedness of this kind of BSDEs by combining a representation theorem with the fixed point argument.

math.PR

Opinion Dynamics in Two-Step Process: Message Sources, Opinion Leaders and Normal Agents

According to mass media theory, the dissemination of messages and the evolution of opinions in social networks follow a two-step process. First, opinion leaders receive the message from the message sources, and then they transmit their opinions to normal agents. However, most opinion models only consider the evolution of opinions within a single network, which fails to capture the two-step process accurately. To address this limitation, we propose a unified framework called the Two-Step Model, which analyzes the communication process among message sources, opinion leaders, and normal agents. In this study, we examine the steady-state opinions and stability of the Two-Step Model. Our findings reveal that several factors, such as message distribution, initial opinion, level of stubbornness, and preference coefficient, influence the sample mean and variance of steady-state opinions. Notably, normal agents' opinions tend to be influenced by opinion leaders in the two-step process. We also conduct numerical and social experiments to validate the accuracy of the Two-Step Model, which outperforms other models on average. Our results provide valuable insights into the factors that shape social opinions and can guide the development of effective strategies for opinion guidance in social networks.

cs.SI

Exploring Information Acquisition in Social Learning

Social learning, a fundamental process through which individuals shape their beliefs and perspectives via observation and interaction with others, is critical for the development of our society and the functioning of social governance. Prior works on social learning usually assume that the initial beliefs are given and focus on the update rule. With the recent proliferation of online social networks, there is an avalanche amount of information, which may significantly influence users' initial beliefs. In this paper, we use the rational inattention theory to model how agents acquire information to form initial beliefs and assess its influence on their adjustments in beliefs. Furthermore, we analyze the dynamic evolution of belief distribution among agents. Simulations and social experiments are conducted to validate our proposed model and analyze the impact of model parameters on belief dynamics.

cs.SI

Uniform-in-time propagation of chaos for kinetic mean field Langevin dynamics

We study the kinetic mean field Langevin dynamics under the functional convexity assumption of the mean field energy functional. Using hypocoercivity, we first establish the exponential convergence of the mean field dynamics and then show the corresponding $N$-particle system converges exponentially in a rate uniform in $N$ modulo a small error. Finally we study the short-time regularization effects of the dynamics and prove its uniform-in-time propagation of chaos property in both the Wasserstein and entropic sense. Our results can be applied to the training of two-layer neural networks with momentum and we include the numerical experiments.

math.PR

Random horizon principal-agent problems

We consider a general formulation of the random horizon Principal-Agent problem with a continuous payment and a lump-sum payment at termination. In the European version of the problem, the random horizon is chosen solely by the principal with no other possible action from the agent than exerting effort on the dynamics of the output process. We also consider the American version of the contract, which covers the seminal Sannikov's model, where the agent can also quit by optimally choosing the termination time of the contract. Our main result reduces such non-zero-sum stochastic differential games to appropriate stochastic control problems which may be solved by standard methods of stochastic control theory. This reduction is obtained by following Sannikov's approach, further developed by Cvitanic, Possamai, and Touzi. We first introduce an appropriate class of contracts for which the agent's optimal effort is immediately characterized by the standard verification argument in stochastic control theory. We then show that this class of contracts is dense in an appropriate sense so that the optimization over this restricted family of contracts represents no loss of generality. The result is obtained by using the recent well-posedness result of random horizon second-order backward SDE.

math.OC

Second order backward SDE with random terminal time

Backward stochastic differential equations extend the martingale representation theorem to the nonlinear setting. This can be seen as path-dependent counterpart of the extension from the heat equation to fully nonlinear parabolic equations in the Markov setting. This paper extends such a nonlinear representation to the context where the random variable of interest is measurable with respect to the information at a finite stopping time. We provide a complete wellposedness theory which covers the semilinear case (backward SDE), the semilinear case with obstacle (reflected backward SDE), and the fully nonlinear case (second order backward SDE).

math.PR