Source author record

Yanzhi Zhang

Yanzhi Zhang 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

7works
7topics
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

7 published item(s)

preprint2026arXiv

FutureWorld: A Live Reinforcement Learning Environment for Predictive Agents with Real-World Outcome Rewards

Live future prediction refers to the task of making predictions about real-world events before they unfold. This task is increasingly studied using large language model-based agent systems, and it is important for building agents that can continually learn from the real world. It can provide a large number of prediction questions grounded in diverse real-world events, while preventing answer leakage. To leverage the advantages of future prediction, we present FutureWorld, a live agentic reinforcement learning environment that closes the training loop between prediction, outcome realization, and parameter updates. Specifically, we modify and extend verl-tool, resulting in a new framework that we call verl-tool-future. Unlike standard reinforcement learning training frameworks that rely on immediate rewards, verl-tool-future stores prediction-time rollouts, backfills rewards after real-world outcomes become available, and then replays the completed trajectories for policy update. Across three open-source agents, successive FutureWorld training rounds lead to consistent improvements in prediction accuracy, probabilistic scoring, and calibration, demonstrating that delayed real-world outcome feedback can serve as an effective reinforcement learning signal.

preprint2023arXiv

Gaussian radial basis functions collocation for fractional PDEs: methodology and error analysis

The paper introduces a new meshfree pseudospectral method based on Gaussian radial basis functions (RBFs) collocation to solve fractional Poisson equations. Hypergeometric functions are used to represent the fractional Laplacian of Gaussian RBFs, enabling an efficient computation of stiffness matrix entries. Unlike existing RBF-based methods, our approach ensures a Toeplitz structure in the stiffness matrix with equally spaced RBF centers, enabling efficient matrix-vector multiplications using fast Fourier transforms. We conduct a comprehensive study on the shape parameter selection, addressing challenges related to ill-conditioning and numerical stability. The main contribution of our work includes rigorous stability analysis and error estimates of the Gaussian RBF collocation method, representing a first attempt at the rigorous analysis of RBF-based methods for fractional PDEs to the best of our knowledge. We conduct numerical experiments to validate our analysis and provide practical insights for implementation.

preprint2022arXiv

The Development and Prospect of Code Clone

The application of code clone technology accelerates code search, improves code reuse efficiency, and assists in software quality assessment and code vulnerability detection. However, the application of code clones also introduces software quality issues and increases the cost of software maintenance. As an important research field in software engineering, code clone has been extensively explored and studied by researchers, and related studies on various sub-research fields have emerged, including code clone detection, code clone evolution, code clone analysis, etc. However, there lacks a comprehensive exploration of the entire field of code clone, as well as an analysis of the trend of each sub-research field. This paper collects related work of code clones in the past ten years. In summary, the contributions of this paper mainly include: (1) summarize and classify the sub-research fields of code clone, and explore the relative popularity and relation of these sub-research fields; (2) analyze the overall research trend of code clone and each sub-research field; (3) compare and analyze the difference between academy and industry regarding code clone research; (4) construct a network of researchers, and excavate the major contributors in code clone research field; (5) The list of popular conferences and journals was statistically analyzed. The popular research directions in the future include clone visualization, clone management, etc. For the clone detection technique, researchers can optimize the scalability and execution efficiency of the method, targeting particular clone detection tasks and contextual environments, or apply the technology to other related research fields continuously.

preprint2021arXiv

A universal solution scheme for fractional and classical PDEs

We propose a unified meshless method to solve classical and fractional PDE problems with $(-Δ)^{\fracα{2}}$ for $α\in (0, 2]$. The classical ($α= 2$) and fractional ($α< 2$) Laplacians, one local and the other nonlocal, have distinct properties. Therefore, their numerical methods and computer implementations are usually incompatible. We notice that for any $α\ge 0$, the Laplacian $(-Δ)^{\fracα{2}}$ of generalized inverse multiquadric (GIMQ) functions can be analytically written by the Gauss hypergeometric function, and thus propose a GIMQ-based method. Our method unifies the discretization of classical and fractional Laplacians and also bypasses numerical approximation to the hypersingular integral of fractional Laplacian. These two merits distinguish our method from other existing methods for the fractional Laplacian. Extensive numerical experiments are carried out to test the performance of our method. Compared to other methods, our method can achieve high accuracy with fewer number of unknowns, which effectively reduces the storage and computational requirements in simulations of fractional PDEs. Moreover, the meshfree nature makes it free of geometric constraints and enables simple implementation for any dimension $d \ge 1$. Additionally, two approaches of selecting shape parameters, including condition number-indicated method and random-perturbed method, are studied to avoid the ill-conditioning issues when large number of points.

preprint2021arXiv

Highly accurate operator factorization methods for the integral fractional Laplacian and its generalization

In this paper, we propose a new class of operator factorization methods to discretize the integral fractional Laplacian $(-Δ)^\fracα{2}$ for $α\in (0, 2)$. The main advantage of our method is to easily increase numerical accuracy by using high-degree Lagrange basis functions, but remain the scheme structure and computer implementation unchanged. Moreover, our discretization of the fractional Laplacian results in a symmetric (multilevel) Toeplitz differentiation matrix, which not only saves memory cost in simulations but enables efficient computations via the fast Fourier transforms. The performance of our method in both approximating the fractional Laplacian and solving the fractional Poisson problems was detailedly examined. It shows that our method has an optimal accuracy of ${\mathcal O}(h^2)$ for constant or linear basis functions, while ${\mathcal O}(h^4)$ if quadratic basis functions are used, with $h$ a small mesh size. Note that this accuracy holds for any $α\in (0, 2)$ and can be further increased if higher-degree basis functions are used. If the solution of fractional Poisson problem satisfies $u \in C^{m, l}(\barΩ)$ for $m \in {\mathbb N}$ and $0 < l < 1$, then our method has an accuracy of ${\mathcal O}\big(h^{\min\{m+l,\, 2\}}\big)$ for constant and linear basis functions, while ${\mathcal O}\big(h^{\min\{m+l,\, 4\}}\big)$ for quadratic basis functions. Additionally, our method can be readily applied to study generalized fractional Laplacians with a symmetric kernel function, and numerical study on the tempered fractional Poisson problem demonstrates its efficiency.

preprint2013arXiv

A simple and efficient numerical method for computing the dynamics of rotating Bose-Einstein condensates via a rotating Lagrangian coordinate

We propose a simple, efficient and accurate numerical method for simulating the dynamics of rotating Bose-Einstein condensates (BECs) in a rotational frame with/without a long-range dipole-dipole interaction. We begin with the three-dimensional (3D) Gross-Pitaevskii equation (GPE) with an angular momentum rotation term and/or long-range dipole-dipole interaction, state the two-dimensional (2D) GPE obtained from the 3D GPE via dimension reduction under anisotropic external potential and review some dynamical laws related to the 2D and 3D GPE. By introducing a rotating Lagrangian coordinate system, the original GPEs are re-formulated to GPEs without the angular momentum rotation which is replaced by a time-dependent potential in the new coordinate system. We then cast the conserved quantities and dynamical laws in the new rotating Lagrangian coordinates. Based on the new formulation of the GPE for rotating BECs in the rotating Lagrangian coordinates, a time-splitting spectral method is presented for computing the dynamics of rotating BECs. The new numerical method is explicit, simple to implement, unconditionally stable and very efficient in computation. It is spectral order accurate in space and second-order accurate in time, and conserves the mass in the discrete level. Extensive numerical results are reported to demonstrate the efficiency and accuracy of the new numerical method. Finally, the numerical method is applied to test the dynamical laws of rotating BECs such as the dynamics of condensate width, angular momentum expectation and center-of-mass, and to investigate numerically the dynamics and interaction of quantized vortex lattices in rotating BECs without/with the long-range dipole-dipole interaction.

preprint2013arXiv

An efficient spectral method for computing dynamics of rotating two-component Bose--Einstein condensates via coordinate transformation

In this paper, we propose an efficient and accurate numerical method for computing the dynamics of rotating two-component Bose--Einstein condensates (BECs) which is described by coupled Gross--Pitaevskii equations (CGPEs) with an angular momentum rotation term and an external driving field. By introducing rotating Lagrangian coordinates, we eliminate the angular momentum rotation term from the CGPEs, which allows us to develop an efficient numerical method. Our method has spectral accuracy in all spatial dimensions and moreover it can be easily implemented in practice. To examine its performance, we compare our method with those reported in literature. Numerical results show that to achieve the same accuracy, our method needs much shorter computing time. We also applied our method to study the dynamic properties of rotating two-component BECs. Furthermore, we generalize our method to solve the vector Gross--Pitaevskii equations (VGPEs) which is used to study rotating multi-component BECs.