Papers by Ruihui Zhao
Guiding the Growth: Difficulty-Controllable Question Generation through Step-by-Step Rewriting (2021.acl-long)
Copied to clipboard
| Challenge: | Existing QG systems perform substantially worse in answering multi-hop questions than single-hop ones. |
| Approach: | They propose a framework that progressively increases question difficulty through step-by-step rewriting under the guidance of an extracted reasoning chain. |
| Outcome: | The proposed framework increases question difficulty through step-by-step rewriting under the guidance of an extracted reasoning chain. |
Integrating Semantics and Neighborhood Information with Graph-Driven Generative Models for Document Retrieval (2021.acl-long)
Copied to clipboard
Zijing Ou, Qinliang Su, Jianxing Yu, Bang Liu, Jingwen Wang, Ruihui Zhao, Changyou Chen, Yefeng Zheng
| Challenge: | Existing methods for document hashing combine only one of semantics and neighborhood information, lacking a theoretical principle to guide the integration process. |
| Approach: | They propose to encode neighborhood information with a graph-induced Gaussian distribution and integrate it with generative models. |
| Outcome: | The proposed model can be trained as efficiently as state-of-the-art methods on benchmark datasets. |
Imperfect also Deserves Reward: Multi-Level and Sequential Reward Modeling for Better Dialog Management (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing research on taskoriented dialog systems mainly includes pipeline and end-to-end methods due to its non-differentiable nature. |
| Approach: | They propose a multi-level reward modeling approach that factorizes a reward into a three-level hierarchy: domain, act, and slot. |
| Outcome: | The proposed approach significantly improves performance and speed of training in a wide range of dialog systems. |
Improving Multi-turn Emotional Support Dialogue Generation with Lookahead Strategy Planning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing research on building ES conversation systems only considered single-turn interactions with users, which is over-simplified and has limited support for multi-turn systems. |
| Approach: | They propose a multi-turn ES conversation system that uses lookahead heuristics to estimate future user feedback after using particular strategies. |
| Outcome: | The proposed system significantly outperforms baselines in both dialogue generation and strategy planning. |
Efficient and Accurate Prompt Optimization: the Benefit of Memory in Exemplar-Guided Reflection (2025.acl-long)
Copied to clipboard
Cilin Yan, Jingyun Wang, Lin Zhang, Ruihui Zhao, Xiaopu Wu, Kai Xiong, Qingsong Liu, Guoliang Kang, Yangyang Kang
| Challenge: | Recent work utilizes feedbacks generated from erroneous cases to guide prompt optimization . previous methods rely on computational resources and powerful GPUs . |
| Approach: | They propose an automatic prompt engineering method that leverages feedbacks from erroneous cases to guide prompt optimization. |
| Outcome: | The proposed method surpasses state-of-the-art methods with less steps and lower computational resources. |
Refining BERT Embeddings for Document Hashing via Mutual Information Maximization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing unsupervised document hashing methods are mostly established on generative models . due to the difficulties of capturing long dependency structures, these methods rarely model the raw documents directly . |
| Approach: | They propose to learn hash codes from BERT embeddings by modifying existing models . they use mutual information maximization principle to maximize mutual information . |
| Outcome: | The proposed method outperforms existing methods learned from BERT embeddings on three benchmark datasets. |
ICA-Proto: Iterative Cross Alignment Prototypical Network for Incremental Few-Shot Relation Classification (2023.findings-eacl)
Copied to clipboard
Wangjie Jiang, Zhihao Ye, Bang Liu, Ruihui Zhao, Jianguang Zheng, Mengyao Li, Zhiyong Li, Yujiu Yang, Yefeng Zheng
| Challenge: | Existing methods for relation classification suffer from the scarcity of manually annotated data. |
| Approach: | They propose a novel relation classification model that incorporates query representation into the encoding of novel prototypes and utilizes iteratively to achieve more interaction. |
| Outcome: | The proposed model outperforms the state-of-the-art model on two benchmark datasets. |