Papers by Silin Yang
LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing path planning algorithms suffer from significant computational and memory inefficiencies as the state space grows . large language models excel in environmental analysis but fall short in detailed spatial and temporal reasoning . |
| Approach: | They propose a new path planning method that synergistically combines A* and LLMs to improve pathfinding efficiency. |
| Outcome: | The proposed method improves pathfinding efficiency while maintaining integrity of path validity in large-scale scenarios. |
Logical DA: Enhancing Data Augmentation for Logical Reasoning via a Multi-Agent System (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing data augmentation paradigms isolate data synthesis from label validation, thereby reducing their utility for complex reasoning tasks. |
| Approach: | They propose a framework for enhancing reasoning-focused data augmentation in few-shot learning scenarios that integrates four agents through two synergistic phases: diverse data generation and label verification. |
| Outcome: | The proposed framework achieves the highest average improvement in task accuracy in both fine-tuning and in-context learning paradigms. |
TALON: A Multi-Agent Framework for Long-Table Exploration and Question Answering (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to query-relevant content retrieval fail to retrieve contextually relevant data. |
| Approach: | They propose a multi-agent framework for table question answering over long tables . TALON features a planning agent that iteratively invokes a tool agent to access tabular data . |
| Outcome: | The proposed framework achieves average accuracy improvements of 7.5% and 12.0% across all language models. |
PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning (2026.findings-acl)
Copied to clipboard
Ruixiang Feng, Yuntao Wen, Silin Zhou, Ke Shi, Yifan Wang, Ran Le, Zhenwei An, Zongchao Chen, Chen Yang, Guangyue Peng, Yiming Jia, Dongsheng Wang, Tao Zhang, Lisi Chen, Yang Song, Shen Gao, Shuo Shang
| Challenge: | Existing LRMs often suffer from "overthinking" and excessively long reasoning traces . a dual-level framework for length compression of LRM is proposed . |
| Approach: | They propose a framework for prefix-protected and difficulty-aware compression under hierarchical supervision. |
| Outcome: | The proposed framework reduces token usage while improving accuracy on math benchmarks. |
CORES: Code-Oriented Reasoning for Complex Text-to-SQL and Generalizable TableQA (2026.findings-acl)
Copied to clipboard
Meng Zhang, Ruochun Jin, Yuanxi Peng, Wenjing Yang, Haotian Wang, Liting Sun, Kun Hu, Silin Yang, Zhang Ke-di
| Challenge: | Text-to-SQL models struggle with complex analytical tasks such as generating simple SQL queries. |
| Approach: | They propose a text-to-sql model that leverages Python as a procedural reasoning pivot to enhance both complex SQL generation and tabular reasoning. |
| Outcome: | The proposed model outperforms baseline models on six text-to-SQL benchmarks by 6.44% on average while maintaining good capability on three tableQA benchmarks. |