SearcharxivSearch

arXiv subjects

Yimeng Tian

Publications and source records attributed to Yimeng Tian.

3 recordsLinked to original sources

HarnessEvolve: Learning from Reference Trajectories for Reliable Agent Self-Evolution

Self-evolving agents advance toward autonomy by optimizing their harness---prompts, skills, tools, and execution logic---based on environmental feedback. This paradigm, however, is hampered by three challenges: \textit{credit assignment failure}, where terminal success/failure feedback makes it ambiguous which step caused the error; \textit{shortcut learning}, where agents memorize task-specific patterns rather than acquire generalizable capabilities; and \textit{catastrophic forgetting}, where unguarded updates degrade previously acquired competence. In this paper, we introduce HarnessEvolve, a self-evolving framework that learns from reference trajectories to achieve reliable agent self-evolution. HarnessEvolve decouples the execution agent from the evolutionary pipeline, assigning execution, evaluation, optimization, and gating to independent agent modules, enabling generalizable and stable harness improvements. Specifically, HarnessEvolve overcomes credit assignment failure by generating reference trajectories (execution paths produced when given the ground-truth answers) and aligning failed executions against them to extract error signals, which are clustered to reveal systematic failure patterns. To prevent shortcut learning and catastrophic forgetting, candidate harness updates must pass two gates: a quality gate that filters data leakage and prompt bloat, and a performance gate that accepts each update if it improves on the current batch without degrading recent batches, with epoch-end validation on a held-out set selecting the best-performing accepted agent snapshot. We conduct extensive experiments on several benchmarks spanning open-domain and enterprise scenarios, using different models and agent frameworks. Results demonstrate that HarnessEvolve consistently outperforms state-of-the-art baselines across all benchmarks and settings, confirming reliability across task domains.

cs.LG

Strict positivity property of inhomogeneous subdiffusion equations and its application to coupled subdiffusion systems

The positivity of solutions to subdiffusion equations has been widely studied, mainly in the context of homogeneous problems for single equations. In this article, we fill the missing strict positivity for inhomogeneous subdiffusion equations with nonnegative and nontrivial source terms by connecting Green's functions for fractional and classical diffusion equations via special functions. As a direct application, we further investigate the strict positivity property of coupled subdiffusion systems with nonnegative and partially nontrivial initial values or sources. Under suitable cooperativeness and connectivity conditions, the strict positivity turns out to propagate not only in time but also across different components of the system, reflecting the intrinsic interactions induced by the coupling structure. These results provide a unified framework for understanding positivity properties of both scalar and coupled subdiffusion equations, offering new insights beyond the classical maximum principle approach.

math.AP

ALM-PINNs Algorithms for Solving Nonlinear PDEs and Parameter Inversion Problems

This paper focuses on the PINNs algorithm by proposing the ALM-PINNs computational framework to solve various nonlinear partial differential equations and corresponding parameters identification problems. The numerical solutions obtained by the ALM-PINNs algorithm are compared with both the exact solutions and the numerical solutions implemented from the PINNs algorithm. This demonstrates that under the same machine learning framework (TensorFlow 2.0) and neural network architecture, the ALM-PINNs algorithm achieves higher accuracy compared to the standard PINNs algorithm. Additionally, this paper systematically analyzes the construction principles of the loss function by introducing the probability distribution of random errors as prior information, and provides a theoretical basis for algorithm improvement.

math.NA