Source author record

Zheng Xie

Zheng Xie appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

10works
12topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

10 published item(s)

preprint2026arXiv

Bridging Distance and Spectral Positional Encodings via Anchor-Based Diffusion Geometry Approximation

Molecular graph learning benefits from positional signals that capture both local neighborhoods and global topology. Two widely used families are spectral encodings derived from Laplacian or diffusion operators and anchor-based distance encodings built from shortest-path information, yet their precise relationship is poorly understood. We interpret distance encodings as a low-rank surrogate of diffusion geometry and derive an explicit trilateration map that reconstructs truncated diffusion coordinates from transformed anchor distances and anchor spectral positions, with pointwise and Frobenius-gap guarantees on random regular graphs. On DrugBank molecular graphs using a shared GNP-based DDI prediction backbone, a distance-driven Nyström scheme closely recovers diffusion geometry, and both Laplacian and distance encodings substantially outperform a no-encoding baseline.

preprint2026arXiv

Exploring Pass-Rate Reward in Reinforcement Learning for Code Generation

Reinforcement learning (RL) from unit-test feedback has become a standard post-training recipe for improving large language models (LLMs) on code generation. However, the pass-all-tests binary reward can be sparse, yielding no learning signal on challenging problems where none of the sampled solutions passes all tests. A common remedy is to use the test-case pass rate as a surrogate reward. In this work, we study pass-rate rewards in critic-free RL for code generation (e.g., GRPO and RLOO) and report a consistent pattern across base models and algorithms: despite alleviating reward sparsity, pass-rate rewards do not reliably improve final performance over binary rewards in rigorous controlled experiments. To understand this discrepancy, we analyze reward density and the resulting gradient directions. We find that pass-rate rewards are denser, but the induced gradient updates do not consistently move probability mass toward full-pass solutions. This arises because test-case pass rate is a miscalibrated surrogate for progress toward full correctness, and partial-pass solutions within the same group can induce conflicting gradient directions that cancel out. Overall, our results suggest that, in critic-free RL, pass-rate rewards are insufficient to improve code generation and motivate reward designs that better align optimization with the goal of full correctness.

preprint2020arXiv

Predicting the number of coauthors for researchers: A learning model

Predicting the number of coauthors for researchers contributes to understanding the development of team science. However, it is an elusive task due to diversity in the collaboration patterns of researchers. This study provides a learning model for the dynamics of this variable; the parameters are learned from empirical data that consist of the number of publications and the number of coauthors at given time intervals. The model is based on relationship between the annual number of new coauthors and time given an annual number of publications, the relationship between the annual number of publications and time given a historical number of publications, and Lotka's law. The assumptions of the model are validated by applying it on the high-quality dblp dataset. The effectiveness of the model is tested on the dataset by satisfactory fittings on the evolutionary trend of the number of coauthors for researchers, the distribution of this variable, and the occurrence probability of collaboration events. Due to its regression nature, the model has the potential to be extended to assess the confidence level of the prediction results and thus has applicability to other empirical research.

preprint2019arXiv

On the Leaders' Graphical Characterization for Controllability of Path Related Graphs

The problem of leaders location plays an important role in the controllability of undirected graphs.The concept of minimal perfect critical vertex set is introduced by drawing support from the eigenvector of Laplace matrix. Using the notion of minimal perfect critical vertex set, the problem of finding the minimum number of controllable leader vertices is transformed into the problem of finding all minimal perfect critical vertex sets. Some necessary and sufficient conditions for special minimal perfect critical vertex sets are provided, such as minimal perfect critical 2 vertex set, and minimal perfect critical vertex set of path or path related graphs. And further, the leaders location problem for path graphs is solved completely by the algorithm provided in this paper. An interesting result that there never exist a minimal perfect critical 3 vertex set is proved, too.

preprint2016arXiv

A geometric graph model of citation networks with linearly growing node-increment

Due to the fact that the numbers of annually published papers have witnessed a linear growth in some citation networks, a geometric model is thus proposed to predict some statistical features of those networks, in which the academic influence scopes of the papers are denoted through specific geometric areas related to time and space. In the model, nodes (papers) are uniformly and randomly sprinkled onto a cluster of circles of the Minkowski space whose centers are on the time axis. Edges (citations) are linked according to an influence mechanism which indicates that an existing paper will be cited by a new paper located in its influence zone. Considering the citations among papers in different disciplines, an interdisciplinary citation mechanism is added to the model in which some papers with a small probability of being chosen will cite some existing papers randomly and uniformly. Different from most existing models that only study the power-law tail of the in-degree distribution, this model also characterizes the overall in-degree distribution. Moreover, it presents the description of some other important statistical characteristics of real networks, such as in- and out-assortativity, giant component and clear community structure. Therefore, it is reasonable to believe that a good example is provided in the paper to study real networks by geometric graphs.

preprint2016arXiv

Modeling the time-periodicity of in-degree distributions in scientific citation networks

In a range of citation networks, the in-degree distributions boast time-periodicity---the distributions of citations per article published each year present similar scale-free tails. This phenomenon can be regarded as a consequence of the emergence of hot topics and the existence of the "burst" phenomenon. With this inference considered, a geometric model based on our previous study is established, in which the sizes of the influence zones of nodes follow the same power-law distribution and decrease with their ages. The model successfully reproduces the time-periodicity of the in-degree distributions of the empirical data, and accounts for the presence of citation burst as well. Moreover, a reasonable explanation for the emergence of the scale-free tails by regarding the citation behavior between articles as a "yes/no" experiment is presented. The model can also predict the time-periodicity of the local clustering coefficients, which indicates that the model is a good tool in researches on the evolutionary mechanism of citation networks.

preprint2016arXiv

Scale-invariant geometric random graphs

We introduce and analyze a class of growing geometric random graphs that are invariant under rescaling of space and time. Directed connections between nodes are drawn according to influence zones that depend on node position in space and time, mimicking the heterogeneity and increased specialization found in growing networks. Through calculations and numerical simulations we explore the consequences of scale-invariance for geometric random graphs generated this way. Our analysis reveals a dichotomy between scale-free and Poisson distributions of in- and out-degree, the existence of a random number of hub nodes, high clustering, and unusual percolation behaviour. These properties are similar to those of empirically observed web graphs.

preprint2010arXiv

Simulation of Wave Equation on Manifold using DEC

The classical numerical methods play important roles in solving wave equation, e.g. finite difference time domain method. However, their computational domain are limited to flat space and the time. This paper deals with the description of discrete exterior calculus method for numerical simulation of wave equation. The advantage of this method is that it can be used to compute equation on the space manifold and the time. The analysis of its stable condition and error is also accomplished.

preprint2010arXiv

Two unconditional stable schemes for simulation of heat equation on manifold using DEC

To predict the heat diffusion in a given region over time, it is often necessary to find the numerical solution for heat equation. With the techniques of discrete differential calculus, we propose two unconditional stable numerical schemes for simulation heat equation on space manifold and time. The analysis of their stability and error is accomplished by the use of maximum principle.

preprint2010arXiv

Westervelt Equation Simulation on Manifold using DEC

The Westervelt equation is a model for the propagation of finite amplitude ultrasound. The method of discrete exterior calculus can be used to solve this equation numerically. A significant advantage of this method is that it can be used to find numerical solutions in the discrete space manifold and the time, and therefore is a generation of finite difference time domain method. This algorithm has been implemented in C++.