Guoheng Sun
Author directory2026
CoIn: Counting the Invisible Reasoning Tokens in Commercial Opaque LLM APIs
Guoheng Sun | Ziyao Wang | Bowei Tian | Meng Liu | Zheyu Shen | Shwai He | Yexiao He | Wanghao Ye | Yiting Wang | Ang Li
Findings of the Association for Computational Linguistics: EMNLP 2026
Guoheng Sun | Ziyao Wang | Bowei Tian | Meng Liu | Zheyu Shen | Shwai He | Yexiao He | Wanghao Ye | Yiting Wang | Ang Li
Findings of the Association for Computational Linguistics: EMNLP 2026
As post-training techniques evolve, large language models (LLMs) are increasingly augmented with structured multi-step reasoning abilities, often optimized through reinforcement learning. These reasoning-enhanced models outperform standard LLMs on complex tasks and now underpin many commercial LLM APIs. However, to protect proprietary behavior and reduce verbosity, providers typically conceal the reasoning traces while returning only the final answer. This opacity introduces a critical transparency gap: users are billed for invisible reasoning tokens, which often account for the majority of the cost, yet have no means to verify their authenticity. This opens the door to token count manipulation, where providers may overreport token usage or inject synthetic, low-effort tokens to inflate charges, a threat that can be carried out at near-zero cost. To address this issue, we propose CoIn, a verification framework that audits both the quantity and semantic validity of hidden tokens. CoIn constructs a verifiable hash tree from token embedding fingerprints to check token counts, and uses embedding-based relevance matching to detect fabricated reasoning content. Experiments demonstrate that CoIn, when deployed as a trusted third-party auditor, can effectively detect token count manipulation with a success rate reaching up to 94.7%, demonstrating a strong ability to restore billing transparency in opaque LLM services. The dataset and code are available at https://github.com/CASE-Lab-UMD/LLM-Auditing-CoIn .
Arctic-Text2SQL-R1: Simple Rewards, Strong Reasoning in Text-to-SQL
Zhewei Yao | Guoheng Sun | Łukasz Borchmann | Zheyu Shen | Minghang Deng | Bohan Zhai | Hao Zhang | Ang Li | Yuxiong He
Findings of the Association for Computational Linguistics: ACL 2026
Zhewei Yao | Guoheng Sun | Łukasz Borchmann | Zheyu Shen | Minghang Deng | Bohan Zhai | Hao Zhang | Ang Li | Yuxiong He
Findings of the Association for Computational Linguistics: ACL 2026
Translating natural language into SQL (Text2SQL) is a longstanding challenge at the intersection of natural language understanding and structured data access. While large language models (LLMs) have significantly improved fluency in SQL generation, producing correct and executable SQL, particularly for complex queries, remains a bottleneck. We present Arctic-Text2SQL-R1, a reinforcement learning (RL) framework and model family designed to generate accurate, executable SQL using a lightweight reward signal based solely on execution correctness. Our approach avoids brittle intermediate supervision and complex reward shaping, promoting stable training and alignment with the end task. Combined with carefully curated data, strong supervised initialization, and effective training practices, Arctic-Text2SQL-R1 achieves state-of-the-art execution accuracy across six diverse Text2SQL benchmarks and ranks among the leading entries on the BIRD leaderboard. Notably, our 7B model outperforms prior 70B-class systems, highlighting the framework’s scalability and efficiency. We further demonstrate inference-time robustness through simple extensions like value retrieval and majority voting. Extensive experiments and ablation studies offer both positive and negative insights, providing practical guidance for future Text2SQL research.
2025
Router-Tuning: A Simple and Effective Approach for Dynamic Depth
Shwai He | Tao Ge | Guoheng Sun | Bowei Tian | Xiaoyang Wang | Dong Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Shwai He | Tao Ge | Guoheng Sun | Bowei Tian | Xiaoyang Wang | Dong Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
The Mixture of Depths (MoD) was introduced to improve computational efficiency by dynamically skipping less important layers, reducing redundant computation while maintaining model capacity. Despite its promise, existing MoD approaches remain under-explored and face two main challenges: (1) high training costs due to the need to train the entire model along with the routers that determine which layers to skip, and (2) performance degradation when important layers are bypassed. In response to the first issue, we propose Router-Tuning, which fine-tunes only the routers on a small dataset, drastically reducing the computational overhead associated with full model training. For the second challenge, we investigate across different architectures and granularities, demonstrating its effectiveness on Attention layers and MoE layers. This method preserves the model’s performance while significantly enhancing computational and memory efficiency. Extensive experiments demonstrate that our approach delivers competitive results while dramatically improving the computation efficiency, e.g., 21% speedup and only a 0.2% performance drop. The code will be released upon acceptance.