7 papers
Outcome-Grounded Advantage Reshaping for Fine-Grained Credit Assignment in Mathematical Reasoning
Ziheng Li, Liu Kang, Feng Xiao +7
Group Relative Policy Optimization (GRPO) has emerged as a promising critic-free reinforcement learning paradigm for reasoning tasks. However, standard GRPO employs a coarse-graine…
Accelerated Evolving Set Processes for Local PageRank Computation
Binbin Huang, Luo Luo, Yanghua Xiao +2
This work proposes a novel framework based on nested evolving set processes to accelerate Personalized PageRank (PPR) computation. At each stage of the process, we employ a localiz…
Heterogeneous Influence Maximization in User Recommendation
Hongru Hou, Jiachen Sun, Wenqing Lin +3
User recommendation systems enhance user engagement by encouraging users to act as inviters to interact with other users (invitees), potentially fostering information propagation.…
From Text to Trajectories: GPT-2 as an ODE Solver via In-Context
Ziyang Ma, Baojian Zhou, Deqing Yang +1
In-Context Learning (ICL) has emerged as a new paradigm in large language models (LLMs), enabling them to perform novel tasks by conditioning on a few examples embedded in the prom…
Iterative Methods via Locally Evolving Set Process
Baojian Zhou, Yifan Sun, Reza Babanezhad Harikandeh +3
Given the damping factor and precision tolerance , \citet{andersen2006local} introduced Approximate Personalized PageRank (APPR), the \textit{de facto local method} for appr…
Faster Local Solvers for Graph Diffusion Equations
Jiahe Bai, Baojian Zhou, Deqing Yang +1
Efficient computation of graph diffusion equations (GDEs), such as Personalized PageRank, Katz centrality, and the Heat kernel, is crucial for clustering, training neural networks,…
SubAnom: Efficient Subgraph Anomaly Detection Framework over Dynamic Graphs
Chi Zhang, Wenkai Xiang, Xingzhi Guo +2
Given a dynamic graph, the efficient tracking of anomalous subgraphs via their node embeddings poses a significant challenge. Addressing this issue necessitates an effective scorin…