Papers by Shihao Yang
K-order Ranking Preference Optimization for Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing list-wise methods focus on optimizing list ranking consistency for LLMs to improve ranking abilities. |
| Approach: | They propose to extend the Plackett-Luce model to accommodate top-K ranking by extending the DPO’s Plact-Lucer model to dynamically determine appropriate K for different samples. |
| Outcome: | The proposed model can be extended to accommodate top-K ranking and improve training efficiency. |
Dual Hierarchical Dialogue Policy Learning for Legal Inquisitive Conversational Agents (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing systems for conversational AI are user-driven, but in many real-world situations, they do not extract information to achieve its own objectives. |
| Approach: | They propose an inquisitive conversational agent that learns when and how to ask probing questions . they also propose a framework for a conversational ICA specifically tailored to the court . |
| Outcome: | The proposed method outperforms single-agent RL baselines on a U.S. Supreme Court dataset. |
A Unified Supervised and Unsupervised Dialogue Topic Segmentation Framework Based on Utterance Pair Modeling (2025.naacl-long)
Copied to clipboard
| Challenge: | Unsupervised methods for dialogue topic segmentation are difficult to surpass due to short sentences, serious references and non-standard language. |
| Approach: | They propose a method to divide a dialogue into different topic paragraphs to better understand its structure and content. |
| Outcome: | The proposed method achieves the best results on multiple benchmark datasets across different scenarios. |
Pre3: Enabling Deterministic Pushdown Automata for Faster Structured LLM Generation (2025.acl-long)
Copied to clipboard
Junyi Chen, Shihao Bai, Zaijun Wang, Siyu Wu, Chuheng Du, Hailong Yang, Ruihao Gong, Shengzhong Liu, Fan Wu, Guihai Chen
| Challenge: | Existing methods for structured generation of outputs are inefficient under large inference batches. |
| Approach: | They propose a new LLM-based method that parses LR(1) grammars into a pushdown automaton and exploits deterministic pushdown automation to optimize the constrained LLM decoding efficiency. |
| Outcome: | The proposed method improves time per output token (TPOT) by 40% and throughput by 36% . |
StableToolBench: Towards Stable Large-Scale Benchmarking on Tool Learning of Large Language Models (2024.findings-acl)
Copied to clipboard
Zhicheng Guo, Sijie Cheng, Hao Wang, Shihao Liang, Yujia Qin, Peng Li, Zhiyuan Liu, Maosong Sun, Yang Liu
| Challenge: | Large Language Models (LLMs) have witnessed remarkable advancements in recent years, prompting the exploration of tool learning. |
| Approach: | They propose a virtual API server and stable evaluation system to assess the stability of large-scale real-time APIs. |
| Outcome: | The proposed benchmarks demonstrate the stability of the proposed system and its caching system. |
Orthogonal Representation Editing: Decoupling Semantic Entanglement in Batch Knowledge Editing of LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge editing methods suffer from performance degradation in batch knowledge editing. |
| Approach: | They propose an orthogonal representation editing method which decouples semantic entanglement from edit vectors and enforcing orthogonals on edit vector. |
| Outcome: | The proposed method outperforms existing methods and achieves superior performance in cross-lingual knowledge editing scenarios. |
Focus-dLLM: Accelerating Long-Context Diffusion LLM Inference via Confidence-Guided Context Focusing (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for estimating attention importance for tokens are ineffective . dLLMs require bidirectional attention, which limits inference efficiency . |
| Approach: | They propose a training-free attention sparsification framework for efficient long-context inference . they propose 'sink-aware pruning strategy' to accurately estimate and remove redundant computation . |
| Outcome: | The proposed approach offers 29 lossless speedup under 32K context length. |