Arrow Research search

Author name cluster

Yi 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.

7 papers
1 author row

Possible papers

7

AAMAS Conference 2026 Conference Paper

SAT: Sequential Agent Tuning for Coordinator-Free Plug-and-Play Multi-LLM Training with Monotonic Improvement Guarantees

  • Yi Xie
  • Yangyang Xu
  • Yi Fan
  • Bo Liu

Large language models (LLMs) with a large number of parameters achieve strong performance but are often prohibitively expensive to deploy. Recent work explores using teams of smaller, more efficient LLMs that collectively match or even outperform a single large model. However, jointly updating multiple agents introduces compounding distribution shifts, making coordination and stability during training difficult. We address this by introducing Sequential Agent Tuning (SAT), a coordinator-free training paradigm. SAT represents the team as a factorized policy and employs blockcoordinate updates over agents, enabling scalable, decentralized training without a central controller. Specifically, we develop a sequence-aware, on-policy advantage estimator that conditions on the evolving team policy, coupled with per-agent KL trust regions that isolate occupancy drift. Theoretically, this framework provides two critical guarantees. First, it ensures monotonic improvement, stabilizing the training process. Second, it establishes provable plugand-playinvariance: anyagentcanbeupgradedtoastrongermodel without retraining the rest of the team, with a formal guarantee that the performance bound improves. Empirically, a team of three 4B agents (12B total) trained with SAT surpasses the much larger Qwen3-32B on AIME24/25 benchmarks by 3. 9% on average. We validate our plug-and-play theory by swapping in two 8B agents, which boosts the composite score by 10. 4%. We provide code and appendix of proof at https: //github. com/Yydc/SAT-AAMAS

NeurIPS Conference 2025 Conference Paper

TF-MAS: Training-free Mamba2 Architecture Search

  • Yi Fan
  • Yu-Bin Yang

The Mamba-type neural networks have gained significant popularity recently. To effectively and efficiently establish model architectures of Mamba, it is natural to introduce Neural Architecture Search (NAS) methods into Mamba. However, existing NAS methods tailored for Mamba are training-based, leading to substantial time and computational resource expenditure. To address this issue, and considering that Mamba2 is an improved version of the original Mamba, we propose a training-free NAS method specifically designed for Mamba2. Based on rank collapse in stacked State Space Duality (SSD) blocks, we design a proxy that only requires the computation of the transformation matrix and its gradient between two tensors within the network. Additionally, we develop a corresponding search space and introduce a novel approach for determining adjustable hyperparameter ranges. Experimental results show that our method outperforms all existing training-free NAS approaches in terms of both ranking correlation and the performance of search results for Mamba2 architecture. To the best of our knowledge, this is the first training-free NAS method designed for Mamba-type architectures. Our codes are available at https: //github. com/fanyi-plus/tf-nas.

EAAI Journal 2023 Journal Article

On some bridges to complex evidence theory

  • Junjie Huang
  • Yi Fan
  • Fuyuan Xiao

Complex evidence theory, an extension of Dempster–Shafer evidence theory, is a generalized evidence theory based on complex values, which has been widely used to solve decision making of uncertainty information. In order to make a step development based on previous researches, we set out to make a connection between CET and other uncertainty theories like possibility theory, modal logic, fuzzy set theory and probability theory. With a restricted condition of a special generalized consonant belief function, it is found that possibility and necessity measure can be regarded as generalized plausibility measure and belief measure in possibility theory, and the standard interpretation of fuzzy sets in complex evidence theory is obtained by summing up the experience of predecessors and modifying the upper bound of fuzzy sets in this paper. In addition, we established the relationship between generalized plausibility, belief function and modal logic, and elaborate how to explain the complex basic belief distribution with the general semantics of modern modal logic. Finally, the transformation algorithm between complex basic belief assignment and probability distribution is proposed by using the transformation of uncertainty invariance principle, and some properties of them are derived.

EAAI Journal 2020 Journal Article

TDIFS: Two dimensional intuitionistic fuzzy sets

  • Yi Fan
  • Fuyuan Xiao

Intuitionistic fuzzy sets (IFS) are widely used in multi-attribute decision-making (MADM) because of its strong ability to express uncertainty in terms of membership degree, non-membership degree and hesitancy degree. Additionally, Z-number is a novel two-dimension framework to handle uncertainty problems by introducing the reliability of expert evaluation. However, a simple index in the framework of Z-number is not enough to express the evaluation of experts. In order to integrate the uncertainty and reliability expressions of IFS, inspired by Z-number, we propose a two-dimensional intuitionistic fuzzy set (TDIFS) model in this paper. In TDIFS model, the first dimensionality is the evaluation data from experts with regard to attributes, and the second dimensionality represents the reliability of expert in terms of the first component of TDIFS. Moreover, for each dimensionality, it is expressed as an ordered pair of intuitionistic fuzzy set, which can carry more information than a simple index. Furthermore, a novel combination rule is proposed for fusing TDIFSs. The TDIFS combination rule fully integrates expert evaluation and expert reliability, where it can reduce the uncertainty during combination process, so that more convincing results can be obtained. In addition, a new MADM method is proposed based on TDIFS model and TDIFS combination rule. Through comparing with the existing methods in an application of pattern recognition, it is demonstrated that the proposed MADM method is more effective, which can achieve higher robustness and better recognition results.

IJCAI Conference 2017 Conference Paper

Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques with Evaluations in Clustering Aggregation

  • Yi Fan
  • Nan Li
  • Chengqian Li
  • Zongjie Ma
  • Longin Jan Latecki
  • Kaile Su

The Maximum Vertex Weight Clique (MVWC) problem is NP-hard and also important in real-world applications. In this paper we propose to use the restart and the random walk strategies to improve local search for MVWC. If a solution is revisited in some particular situation, the search will restart. In addition, when the local search has no other options except dropping vertices, it will use random walk. Experimental results show that our solver outperforms state-of-the-art solvers in DIMACS and finds a new best-known solution. Also it is the unique solver which is comparable with state-of-the-art methods on both BHOSLIB and large crafted graphs. Furthermore we evaluated our solver in clustering aggregation. Experimental results on a number of real data sets demonstrate that our solver outperforms the state-of-the-art for solving the derived MVWC problem and helps improve the final clustering results.

IJCAI Conference 2013 Conference Paper

Reasoning about State Constraints in the Situation Calculus

  • Naiqi Li
  • Yi Fan
  • Yongmei Liu

In dynamic systems, state constraints are formulas that hold in every reachable state. It has been shown that state constraints can be used to greatly reduce the planning search space. They are also useful in program verification. In this paper, we propose a sound but incomplete method for automatic verification and discovery of ∀∗ ∃∗ state constraints for a class of action theories that include many planning benchmarks. Our method is formulated in the situation calculus, theoretically based on Skolemization and Herbrand Theorem, and implemented with SAT solvers. Basically, we verify a state constraint by strengthening it in a novel and smart way so that it becomes a state invariant. We experimented with the blocks world, logistics and satellite domains, and the results showed that, almost all known state constraints can be verified in a reasonable amount of time, and meanwhile succinct and intuitive related state constraints are discovered.

AAAI Conference 2012 Conference Paper

A First-Order Interpreter for Knowledge-Based Golog with Sensing based on Exact Progression and Limited Reasoning

  • Yi Fan
  • Minghui Cai
  • Naiqi Li
  • Yongmei Liu

While founded on the situation calculus, current implementations of Golog are mainly based on the closedworld assumption or its dynamic versions or the domain closure assumption. Also, they are almost exclusively based on regression. In this paper, we propose a first-order interpreter for knowledge-based Golog with sensing based on exact progression and limited reasoning. We assume infinitely many unique names and handle first-order disjunctive information in the form of the so-called proper+ KBs. Our implementation is based on the progression and limited reasoning algorithms for proper+ KBs proposed by Liu, Lakemeyer and Levesque. To improve efficiency, we implement the two algorithms by grounding via a trick based on the unique name assumption. The interpreter is online but the programmer can use two operators to specify offline execution for parts of programs. The search operator returns a conditional plan, while the planning operator is used when local closed-world information is available and calls a modern planner to generate a sequence of actions.

v2026.09.13