Papers by Qingjun Cui
Grouped-Attention for Content-Selection and Content-Plan Generation (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Recent neural data-to-text generation models explicitly learn content-plan given a set of attributes as input. |
| Approach: | They propose a neural content-planner that captures local and global contexts . they use a token-level attention constrained within each input attribute . |
| Outcome: | The proposed model outperforms competitors by 4.92%, 4.70%, and 16.56% on real-world datasets. |
GRIL: Knowledge Graph Retrieval-Integrated Learning with Large Language Models (2025.findings-emnlp)
Copied to clipboard
Jialin Chen, Houyu Zhang, Seongjun Yun, Alejandro Mottini, Rex Ying, Xiang Song, Vassilis N. Ioannidis, Zheng Li, Qingjun Cui
| Challenge: | Existing graph RAGs decouple retrieval and reasoning processes, preventing adaptability . existing graph Raggings depend heavily on ground-truth entities, which are often unavailable in open-domain settings. |
| Approach: | They propose a graph retriever that is trained end-to-end with large-scale graphs . structure and semantic features are encoded via soft tokens and the verbalized graph . |
| Outcome: | The proposed approach improves the performance of large-scale graph retrieval models by grounding it with external knowledge. |
InfoPO: On Mutual Information Maximization for Large Language Model Alignment (2025.naacl-long)
Copied to clipboard
Teng Xiao, Zhen Ge, Sujay Sanghavi, Tian Wang, Julian Katz-Samuels, Marc Versage, Qingjun Cui, Trishul Chilimbi
| Challenge: | Recent studies have shown that direct preference optimization and its variants can be useful for fine-tuning large language models with human preferences data. |
| Approach: | They propose a preference fine-tuning algorithm that effectively and efficiently aligns large language models using preference data. |
| Outcome: | Extensive experiments show that the proposed algorithm outperforms established baselines on reasoning tasks. |
OssCSE: Overcoming Surface Structure Bias in Contrastive Learning for Unsupervised Sentence Embedding (2023.emnlp-main)
Copied to clipboard
Zhan Shi, Guoyin Wang, Ke Bai, Jiwei Li, Xiang Li, Qingjun Cui, Belinda Zeng, Trishul Chilimbi, Xiaodan Zhu
| Challenge: | Recent studies show that contrastive learning is effective in sentence representation learning . but, the surface structure bias is a problem in the current model . |
| Approach: | They propose to combine a sentence with a sub-semantic sentence to investigate the surface structure bias. |
| Outcome: | The proposed model achieves state-of-the-art on standard semantic textual similarity tasks using different pre-trained backbones. |
ReAugKD: Retrieval-Augmented Knowledge Distillation For Pre-trained Language Models (2023.acl-short)
Copied to clipboard
Jianyi Zhang, Aashiq Muhamed, Aditya Anantharaman, Guoyin Wang, Changyou Chen, Kai Zhong, Qingjun Cui, Yi Xu, Belinda Zeng, Trishul Chilimbi, Yiran Chen
| Challenge: | Knowledge distillation (KD) is an effective compression technique to derive a smaller student model from a larger teacher model by transferring the knowledge embedded in the teacher's network. |
| Approach: | They propose a framework and loss function that preserves the semantic similarities of teacher and student training examples to enable the student to retrieve from the knowledge base effectively. |
| Outcome: | The proposed framework preserves the semantic similarities of teacher and student training examples to achieve state-of-the-art performance on the GLUE benchmark. |