← Search

Shicheng Xu

5 accepted papers

2026

RLKD: Distilling LLMs’ Reasoning via Reinforcement Learning

AAAI 2026technical

Distilling reasoning paths from teacher to student models via supervised fine-tuning (SFT) provides a shortcut for improving the reasoning ability of the smaller Large Language Models (LLMs). However, the reasoning paths generated by teacher models often reflect only surface-level traces of their un

Cited by 0SourcePDFScholar
2025

A Theory for Token-Level Harmonization in Retrieval-Augmented Generation

ICLR 2025poster

Retrieval-augmented generation (RAG) utilizes retrieved texts to enhance large language models (LLMs). Studies show that while RAG provides valuable external information (benefit), it may also mislead LLMs (detriment) with noisy or incorrect retrieved texts. Although many existing methods attempt to…

Cited by 1SourcePDFScholar
2025

Cross-Modal Safety Mechanism Transfer in Large Vision-Language Models

ICLR 2025poster

Vision-language alignment in Large Vision-Language Models (LVLMs) successfully enables LLMs to understand visual input. However, we find that existing vision-language alignment methods fail to transfer the existing safety mechanism for text in LLMs to vision, which leads to vulnerabilities in toxic…

Cited by 3SourcePDFScholar
2024

Unsupervised Information Refinement Training of Large Language Models for Retrieval-Augmented Generation

ACL 2024long

Retrieval-augmented generation (RAG) enhances large language models (LLMs) by incorporating additional information from retrieval. However, studies have shown that LLMs still face challenges in effectively using the retrieved information, even ignore it or be misled by it. The key reason is that the…

2023

BERM: Training the Balanced and Extractable Representation for Matching to Improve Generalization Ability of Dense Retrieval

ACL 2023long

Dense retrieval has shown promise in the first-stage retrieval process when trained on in-domain labeled datasets. However, previous studies have found that dense retrieval is hard to generalize to unseen domains due to its weak modeling of domain-invariant and interpretable feature (i.e., matching…