Papers by Tianshu Yu
Dependency-aware Prototype Learning for Few-shot Relation Classification (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for few-shot relation classification fail to distinguish multiple relations that co-exist in one sentence. |
| Approach: | They propose a dependency-aware prototype learning method for few-shot relation classification . they utilize dependency trees and shortest dependency paths as structural information . |
| Outcome: | The proposed method achieves better performance than baselines on the FewRel dataset. |
Learning Language-guided Adaptive Hyper-modality Representation for Multimodal Sentiment Analysis (2023.emnlp-main)
Copied to clipboard
| Challenge: | Multimodal Sentiment Analysis (MSA) is effective when using rich information from multiple sources, but the potential sentiment-irrelevant information across modalities may hinder the performance from being further improved. |
| Approach: | They propose an Adaptive Language-guided Multimodal Transformer (ALMT) that learns an irrelevance/conflict-suppressing representation from visual and audio features under guidance of language features at different scales. |
| Outcome: | The proposed model achieves state-of-the-art on several popular datasets and an abundance of ablation shows the effectiveness of the proposed model. |
AOT*: Efficient Synthesis Planning via LLM-Empowered AND-OR Tree Search (2026.findings-acl)
Copied to clipboard
| Challenge: | Experimental evaluation shows that AOT* achieves competitive solve rates using 3-5 fewer iterations than existing LLM-based approaches. |
| Approach: | They propose a framework that integrates LLM-generated chemical synthesis pathways with systematic AND-OR tree search. |
| Outcome: | Experimental results show that AOT* improves search efficiency and solves faster than existing approaches. |
Training Language Model to Critique for Better Refinement (2025.findings-acl)
Copied to clipboard
Tianshu Yu, Chao Xiang, Mingchuan Yang, Pei Ke, Bosi Wen, Cunxiang Wang, Jiale Cheng, Li Zhang, Xinyu Mu, Chuxiong Sun, Minlie Huang
| Challenge: | Large language models (LLMs) have remarkable evaluation and critique capabilities, providing insightful feedback and identifying flaws in various tasks. |
| Approach: | They propose a framework to train critic models using refinement signals to generate feedback loops where critiques guide the model in refining its responses. |
| Outcome: | The proposed framework outperforms traditional methods and open-source models in terms of critique quality and refinement outcomes. |
Speech-Text Pre-training for Spoken Dialog Understanding with Explicit Cross-Modal Alignment (2023.acl-long)
Copied to clipboard
Tianshu Yu, Haoyu Gao, Ting-En Lin, Min Yang, Yuchuan Wu, Wentao Ma, Chao Wang, Fei Huang, Yongbin Li
| Challenge: | Existing speech-text pre-training methods are limited to one or two specific tasks, despite their success in speech-language processing tasks. |
| Approach: | They propose a temporal position prediction task to capture the speech-text alignment . they use a textual dialog pre-training task to generalize a response selection task . |
| Outcome: | The proposed model is superior in learning speech-text alignment and multi-turn dialog context. |
Federated Learning for Semantic Parsing: Task Formulation, Evaluation Setup, New Algorithms (2023.acl-long)
Copied to clipboard
| Challenge: | Neural semantic parsers have achieved remarkable performance in recent years, but they are data-hungry and require annotators to have intimate knowledge of formal programs. |
| Approach: | They propose a task where multiple clients collaboratively train one global model without sharing their semantic parsing data. |
| Outcome: | The proposed model improves performance on three widely adopted FL algorithms (FedAvg, FedOPT and FedProx) and clients with smaller datasets enjoy faster performance. |
ReKG-MCTS: Reinforcing LLM Reasoning on Knowledge Graphs via Training-Free Monte Carlo Tree Search (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to combining knowledge graphs with large language models face limitations in path exploration strategies or excessive computational overhead. |
| Approach: | They propose a training-free framework that synergizes Monte Carlo Tree Search with LLM capabilities to enable dynamic reasoning over KGs. |
| Outcome: | The proposed framework outperforms existing training-free methods and achieves competitive performance compared to fine-tuned baselines. |
Unsupervised Speech-text word-level alignment with Dynamic Programming (2025.findings-naacl)
Copied to clipboard
| Challenge: | Word-level alignment in speech-text pretraining models is limited by word-level annotated data . authors propose an iterative training method for USDP that reduces the dependency on scarce annotation resources. |
| Approach: | They propose an Unsupervised Speech-text word-level alignment with Dynamic Programming (USDP) this method uses Dynamic programming principles to iteratively refine temporal alignment predictions . |
| Outcome: | The proposed method significantly improves on speech-text pretraining tasks compared to existing methods. |