Papers by Hang Yin
Beta Distribution Guided Aspect-aware Graph for Aspect Category Sentiment Analysis with Affective Knowledge (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for aspect category sentiment analysis do not necessarily occur in a sentence. |
| Approach: | They propose a Beta Distribution-guided aspect-aware graph construction based on external knowledge . they use aspect-related words as the pivots to derive aspect-relevant weights . |
| Outcome: | The proposed approach outperforms the state-of-the-art methods on 6 benchmark datasets. |
Turn Waste into Worth: Rectifying Top-k Router of MoE (2024.emnlp-main)
Copied to clipboard
Zhiyuan Zeng, Qipeng Guo, Zhaoye Fei, Zhangyue Yin, Yunhua Zhou, Linyang Li, Tianxiang Sun, Hang Yan, Dahua Lin, Xipeng Qiu
| Challenge: | Top-k router suffers from redundancy computation and memory costs due to unbalanced routing . some experts are overflow, where exceeding tokens are dropped, while others are empty, which are padded with zeros, negatively impacting model performance. |
| Approach: | They propose a top-k router that is unbalanced and uses a multi-gPU system to handle dropped tokens and padding. |
| Outcome: | The proposed model surpasses the top-1 router by 4.7% in terms of performance . the top-k router suffers from redundancy computation and memory costs . |
TP-RAG: Benchmarking Retrieval-Augmented Large Language Model Agents for Spatiotemporal-Aware Travel Planning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on large language models (LLMs) focus on basic plan validity, but neglect critical aspects such as route efficiency, POI appeal, and real-time adaptability. |
| Approach: | They propose a benchmark for retrieval-augmented, spatiotemporal-aware travel planning that integrates retrieved trajectories with LLMs’ intrinsic reasoning. |
| Outcome: | The proposed framework improves spatial efficiency and POI rationality while challenging universality and robustness due to conflicting references and noisy data. |
Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transport (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for answering complex queries on knowledge graphs lack a local and global scoring function. |
| Approach: | They propose a convolution-based algorithm for linear time computation and a block diagonal kernel to enforce the trade-off between local and global embeddings. |
| Outcome: | The proposed model outperforms existing methods on standard datasets, evaluation sets with combinatorially complex queries, and hierarchical knowledge graphs. |
AutoBreach: Universal and Adaptive Jailbreaking with Efficient Wordplay-Guided Optimization via Multi-LLMs (2025.findings-naacl)
Copied to clipboard
| Challenge: | Existing jailbreak research exhibits limitations in universality, validity, and efficiency . Existing methods for jailbreaking LLMs have limited validity and effectiveness . |
| Approach: | They propose a black-box approach that uses wordplay-guided mapping rule sampling to create universal adversarial prompts. |
| Outcome: | The proposed method efficiently identifies security vulnerabilities across various LLMs, achieving an average success rate of over 80% with fewer than 10 queries. |
Enhancing Transformers for Generalizable First-Order Logical Entailment (2025.acl-long)
Copied to clipboard
Tianshi Zheng, Jiazheng Wang, Zihao Wang, Jiaxin Bai, Hang Yin, Zheye Deng, Yangqiu Song, Jianxin Li
| Challenge: | Moreover, transformers have demonstrated proficiency in logical reasoning over natural language. |
| Approach: | They propose a logic-aware architecture that improves the performance in generalizable first-order logical entailment by combining distribution shifts and unseen knowledge. |
| Outcome: | The proposed architecture outperforms methods designed specifically for knowledge graph query answering on a dataset with a large dataset. |
Red Teaming Large Reasoning Models (2026.acl-long)
Copied to clipboard
| Challenge: | Large Reasoning Models (LRMs) have emerged as a powerful advancement in multi-step reasoning tasks, but they introduce safety and reliability risks, such as CoT-hijacking and prompt-induced inefficiencies. |
| Approach: | They propose a unified benchmark to assess the trustworthiness of Large Reasoning Models. |
| Outcome: | The proposed benchmark evaluates truthfulness, safety and efficiency on 26 models. |
Extending Complex Logical Queries on Uncertain Knowledge Graphs (2025.acl-long)
Copied to clipboard
| Challenge: | Existing studies on logical queries on knowledge graphs overlook the incompleteness of KGs. |
| Approach: | They propose an ML-based approach to answer soft queries on uncertain knowledge . they propose to use forward inference and backward calibration to avoid catastrophic errors . |
| Outcome: | The proposed method ensures there are no catastrophic cascading errors while maintaining the same complexity as state-of-the-art inference algorithms for first-order queries. |
Unified Active Retrieval for Retrieval Augmented Generation (2024.findings-emnlp)
Copied to clipboard
Qinyuan Cheng, Xiaonan Li, Shimin Li, Qin Zhu, Zhangyue Yin, Yunfan Shao, Linyang Li, Tianxiang Sun, Hang Yan, Xipeng Qiu
| Challenge: | Existing active retrieval methods struggle with handling various types of instructions. |
| Approach: | They propose a unified active retrieval framework for retrieval-augmented generation . they propose to combine four orthogonal criteria into plug-and-play classification tasks . |
| Outcome: | The proposed framework outperforms existing methods on four representative types of user instructions on four types of instructions. |
LCO: LLM-based Constraint Optimization for Safer Agentic LLMs in Real-world Tasks (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing defense methods are insufficient to address in-context reward hacking (ICRH), where LLMs iteratively optimize their behavior to maximize proxy objectives, resulting in harmful side effects. |
| Approach: | They propose a framework that reduces in-context reward hacking (ICRH) through repeated interactions with the environment. |
| Outcome: | The proposed framework reduces ICRH without model fine-tuning while maintaining task performance. |