ZDZhipeng Du

Zhipeng Du

*This is an algorithmically generated author record based on publicly available information.

Zhipeng Du has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Multi-Granular Demonstration Retrieval via Syntax-Derived Representations for Few-Shot NL2GQL

    by Tong Li, Zhipeng Du, Xinyu Hu, Yuanyuan Zhang, Gang Xiao

    Translating natural language into graph query languages (NL2GQL) enables non-expert users to access graph databases, but supervised parsers depend on large annotated corpora and costly retraining whenever the schema evolves. Few-shot in-context learning offers a training-free alternative, yet its effectiveness hinges on demonstration selection, and conventional retrieval based on sentence-level matching and a single similarity signal often overlooks beneficial exemplars. We propose MGDR-SDR, a training-free approach that applies constituency parsing to derive three complementary representations of the utterance: a shallow abstraction preserving fine-grained lexical and syntactic detail, a deep abstraction exposing the intent-level syntactic skeleton, and a noun phrase list capturing concrete graph elements. These representations drive a multi-granular retrieval procedure that aggregates evidence across dense and sparse channels, yielding broader and more precise demonstration coverage. We evaluate MGDR-SDR on SPARQL generation over KQA Pro and Cypher generation over ZOGRASCOPE. Without any training, it reaches 86.58% Hits@1 on KQA Pro, surpassing strong supervised parsers and setting a new state-of-the-art among few-shot methods, and it transfers across GQL formalisms, attaining the best iid accuracy and a balanced generalization profile that surpasses all open-source few-shot baselines on ZOGRASCOPE. These results show that syntax-derived, multi-granular retrieval is an effective and generalizable strategy for few-shot NL2GQL semantic parsing.

  • Open Access

    Heterogeneous Multidimensional Colonel Blotto: Framework and Equilibrium Structure

    by Yuanyuan Zhang, Gang Xiao, Feng Ye, Lingtao Xue, Zhipeng Du, Tong Li

    Classical Colonel Blotto models predict smooth and monotone allocation patterns under a homogeneous-resource benchmark. This paper studies how heterogeneous technologies and partially irreversible deployment reshape equilibrium structure through a unifying reduced-form mechanism, which we call the induced cost geometry. In the compatible linear case developed in the main text, heterogeneous technologies and irreversibility generate battlefield-specific effective marginal costs MCig(μ)=κig+μβig, where μ is the endogenous shadow price of the global budget. We distinguish results that rely on this compatible linear representation from those that extend directly to the more general lower-envelope induced cost object. The induced cost object serves as the central organizing device for the equilibrium analysis and yields three main structural implications. First, under binding budgets, equilibrium effort can be sparse: positive effort is concentrated on battlefields whose effective marginal costs remain sufficiently low relative to their values, generating selective participation even under smooth contest success functions. Second, within a class of local fixed-support equilibrium configurations with binding budgets, an increase in a battlefield’s value can reduce equilibrium effort on that battlefield via the shadow-price channel—a mechanism-identification result for a specific structural regime rather than a general comparative-statics claim. Third, along durability paths, contestability and equilibrium support can exhibit discrete regime changes generated by technology switching within a finite lower-envelope cost structure. We develop a unified reduced-form characterization of equilibrium structure via induced costs and KKT conditions, highlighting how induced cost geometry reshapes both the intensive and extensive margins of strategic allocation within the equilibrium regimes characterized in the paper.

  • Open Access

    CBR2: A Case-Based Reasoning Framework with Dual Retrieval Guidance for Few-Shot KBQA

    by Xinyu Hu, Tong Li, Lingtao Xue, Zhipeng Du, Kai Huang, Gang Xiao, He Tang

    Recent advances in large language models (LLMs) have driven substantial progress in knowledge base question answering (KBQA), particularly under few-shot settings. However, symbolic program generation remains challenging due to its strict structural constraints and high sensitivity to generation errors. Existing few-shot methods often rely on multi-turn strategies, such as rule-based step-by-step reasoning or iterative self-correction, which introduce additional latency and exacerbate error propagation. We present CBR2, a case-based reasoning framework with dual retrieval guidance for single-pass symbolic program generation. Instead of generating programs interactively, CBR2 constructs a unified structure-aware prompt that integrates two complementary types of retrieval: (1) structured knowledge from ontologies and factual triples, and (2) reasoning exemplars retrieved via semantic and function-level similarity. A lightweight similarity model is trained to retrieve structurally aligned programs, enabling effective transfer of abstract reasoning patterns. Experiments on KQA Pro and MetaQA demonstrate that CBR2 achieves significant improvements in both accuracy and syntactic robustness. Specifically on KQA Pro, it boosts Hits@1 from 72.70% to 82.13% and reduces syntax errors by 25%, surpassing the previous few-shot state-of-the-art.