Arrow Research search

Author name cluster

Jiaming Fan

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

AAAI Conference 2026 Conference Paper

GraphIC: A Graph-Based In-Context Example Retrieval Model for Multi-Step Reasoning

  • Jiale Fu
  • Yaqing Wang
  • Simeng Han
  • Jiaming Fan
  • Xu Yang

In-context learning (ICL) enhances large language models (LLMs) by incorporating demonstration examples, yet its effectiveness heavily depends on the quality of selected examples. Current methods typically use text embeddings to measure semantic similarity, which often introduces bias in multi-step reasoning tasks. This occurs because text embeddings contain irrelevant semantic information and lack deeper reasoning structures. To address this, we propose GraphIC, a graph-based retrieval model that leverages reasoning-aware representation and specialized similarity metric for in-context example retrieval. GraphIC first constructs thought graphs—directed, node-attributed graphs that explicitly model reasoning steps and their dependencies—for candidate examples and queries. This approach filters out superficial semantics while preserving essential reasoning processes. Next, GraphIC retrieves examples using a novel similarity metric tailored for these graphs, capturing sequential reasoning patterns and asymmetry between examples. Comprehensive evaluations across mathematical reasoning, code generation, and logical reasoning tasks demonstrate that GraphIC outperforms 10 baseline methods. Our results highlight the importance of reasoning-aware retrieval in ICL, offering a robust solution for enhancing LLM performance in multi-step reasoning scenarios.

ICML Conference 2025 Conference Paper

Fast Large Language Model Collaborative Decoding via Speculation

  • Jiale Fu
  • Yuchu Jiang
  • Junkai Chen
  • Jiaming Fan
  • Xin Geng 0001
  • Xu Yang 0021

Large Language Model (LLM) collaborative decoding techniques improve output quality by combining the outputs of multiple models at each generation step, but they incur high computational costs. In this paper, we introduce Collaborative decoding via Speculation (CoS), a novel framework that accelerates collaborative decoding without compromising performance. Inspired by Speculative Decoding—where a small proposal model generates tokens sequentially, and a larger target model verifies them in parallel, our approach builds on two key insights: (1) the verification distribution can be the combined distribution of both the proposal and target models, and (2) alternating each model as the proposer and verifier can further enhance efficiency. We generalize this method to collaboration among n models and theoretically prove that CoS is never slower than standard collaborative decoding, typically achieving faster speed. Extensive experiments demonstrate CoS is 1. 11x–2. 23x faster than standard collaborative decoding without compromising generation quality. Our code is available at https: //github. com/Kamichanw/CoS/.

EAAI Journal 2022 Journal Article

UAV trajectory planning in cluttered environments based on PF-RRT* algorithm with goal-biased strategy

  • Jiaming Fan
  • Xia Chen
  • Yu Wang
  • Xiangmin Chen

In recent decades, Rapidly-exploring Random Tree star(RRT*) with asymptotic optimality has attracted much attention in path planning algorithm, but it suffers from slow convergence. Hence to solve the drawback, this paper proposes a novel Unmanned Aerial Vehicle(UAV) trajectory planning in cluttered environments based on PF-RRT* algorithm with goal-biased strategy. It creates a novel parent node for the new node near the obstacle by dichotomy method, instead of updating the parent node in the existing random tree nodes, which considerably decreases the path cost. The improved artificial potential field(APF) is proposed to guide the growth of the random tree towards the target point by adding random point attraction, target point attraction and obstacle repulsion, which not only addresses the local minimum problem, but also boosts the search rate of the random tree. The algorithm proposed in this paper combines with goal-biased strategy to obtain higher quality sampling points during the sampling process. Finally, the simulation verifies that the proposed algorithm is greatly optimized in terms of the number of iterations, convergence rate and path cost.

v2026.09.13