Seungkyu Lee
Author directory2026
In-N-Out: A Parameter-Level API Graph Dataset for Tool Agents
Seungkyu Lee | Nalim Kim | Yohan Jo
Transactions of the Association for Computational Linguistics, Volume 14
Seungkyu Lee | Nalim Kim | Yohan Jo
Transactions of the Association for Computational Linguistics, Volume 14
Tool agents—LLM-based systems that interact with external APIs—offer a way to execute real-world tasks. However, as tasks become increasingly complex, these agents struggle to identify and call the correct APIs in the proper order. To tackle this problem, we investigate converting API documentation into a structured API graph that captures API dependencies and leveraging it for multi-tool queries that require compositional API calls. To support this, we introduce In-N-Out, the first expert-annotated dataset of API graphs built from two real-world API benchmarks and their documentation. Using In-N-Out significantly improves performance on both tool retrieval and multi-tool query generation, nearly doubling that of LLMs using documentation alone. Moreover, graphs generated by models fine-tuned on In-N-Out close 90% of this gap, showing that our dataset helps models learn to comprehend API documentation and parameter relationships. Our findings highlight the promise of using explicit API graphs for tool agents and the utility of In-N-Out as a valuable resource. We release our dataset and code at https://github.com/holi-lab/In-N-Out-API-Graph.
ThinkBrake: Efficient Reasoning via Log-Probability Margin Guided Decoding
Sangjun Song | Minjae Oh | Seungkyu Lee | Sungmin Jo | Yohan Jo
Findings of the Association for Computational Linguistics: ACL 2026
Sangjun Song | Minjae Oh | Seungkyu Lee | Sungmin Jo | Yohan Jo
Findings of the Association for Computational Linguistics: ACL 2026
Large Reasoning Models (LRMs) allocate substantial inference-time compute to Chain-of-Thought (CoT) reasoning, improving performance on mathematics, scientific QA, and tool usage. However, this introduces overthinking: LRMs often reach a correct intermediate solution, continue reasoning, and overwrite it with an incorrect answer. We first demonstrate that oracle stopping—where we inject lt;/think gt; at every sentence boundary and select the best stopping point in hindsight—improves average accuracy by 8% while reducing thinking tokens by 72%, exposing substantial overthinking. Motivated by this finding, we propose ThinkBrake, which monitors the log-probability margin between the top continuation token and lt;/think gt; at sentence boundaries, stopping reasoning when this margin narrows. ThinkBrake requires no training and achieves favorable accuracy–efficiency trade-offs across math, scientific QA, and tool usage benchmarks, reducing thinking token usage by up to 30%. Furthermore, we provide theoretical analysis showing that ThinkBrake is equivalent to test-time realignment with a reward bonus for the lt;/think gt; token.