Yi Fang
Author directoryOther people with similar names: Yi Fang, Yi Fang
Unverified author pages with similar names: Yi Fang
2026
Answer Probing-Guided Search for Diverse Solution Exploration of LLMs
Yi Fang | Que Shen | Chengpeng Li | Boyi Deng | Wei Shi | Wenjie Wang | Fuli Feng | Fengli Xu | Dayiheng Liu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Yi Fang | Que Shen | Chengpeng Li | Boyi Deng | Wei Shi | Wenjie Wang | Fuli Feng | Fengli Xu | Dayiheng Liu
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Generating multiple diverse and high-quality solutions is valuable for many applications, such as code-test generation and drug discovery. However, Large Language Models (LLMs) tend to converge on a single high-confidence solution during inference, limiting exploration of alternative valid solution paths. Existing test-time methods promote diversity through tree-like search and prune semantically similar branches using response-level semantic embeddings. However, we find that such embeddings are easily confounded by linguistic and stylistic similarities, making it difficult to distinguish genuinely distinct solution paths. To address this, we introduce Answer Probing, which probes the potential answer an LLM would reach from an intermediate reasoning path. We demonstrate that the hidden states of probed answers more effectively differentiate distinct solution paths than semantic embeddings, and the perplexity of probed answers serves as a practical proxy for reasoning correctness. Based on these findings, we propose Answer Probing-Guided Tree Search (APTS), which guides the tree search by the probed answers’ hidden state similarity and perplexity. Experiments on three reasoning tasks across two LLMs show that APTS consistently enhances solution diversity, demonstrating its effectiveness and robustness.
Controllable LLM Reasoning via Sparse Autoencoder-Based Steering
Yi Fang | Wenjie Wang | Mingfeng Xue | Boyi Deng | Fengli Xu | Dayiheng Liu | Fuli Feng
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yi Fang | Wenjie Wang | Mingfeng Xue | Boyi Deng | Fengli Xu | Dayiheng Liu | Fuli Feng
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large Reasoning Models (LRMs) exhibit human-like cognitive reasoning strategies (e.g. backtracking, cross-verification) during reasoning process, which improves their performance on complex tasks. Currently, reasoning strategies are autonomously selected by LRMs themselves. However, such autonomous selection often produces inefficient or even erroneous reasoning paths. To make reasoning more reliable and flexible, it is important to develop methods for controlling reasoning strategies. Existing methods struggle to control fine-grained reasoning strategies due to conceptual entanglement in LRMs’ hidden states. To address this, we leverage Sparse Autoencoders (SAEs) to decompose strategy-entangled hidden states into a disentangled feature space. To identify the few strategy-specific features from the vast pool of SAE features, we propose SAE-Steering, an efficient two-stage feature identification pipeline. SAE-Steering first recalls features that amplify the logits of strategy-specific keywords, filtering out over 99% of features, and then ranks the remaining features by their control effectiveness. Using the identified strategy-specific features as control vectors, SAE-Steering outperforms existing methods by over 15% in control effectiveness. Furthermore, controlling reasoning strategies can redirect LRMs from erroneous paths to correct ones, achieving a 7% absolute accuracy improvement.