Papers by Ran Shen
MReD: A Meta-Review Dataset for Structure-Controllable Text Generation (2022.findings-acl)
Copied to clipboard
| Challenge: | a new text generation dataset is needed to controllable text summarization, but it lacks the domain knowledge. |
| Approach: | They propose to use existing text generation datasets to leverage input and control signals . they propose to annotate each meta-review sentence manually with a control signal . |
| Outcome: | The proposed method can be used to control the structure of a text generation dataset . it can be applied to a variety of tasks, including a task with a large number of meta-review sentences . |
Cold-Start Data Selection for Better Few-shot Language Model Fine-tuning: A Prompt-based Uncertainty Propagation Approach (2023.acl-long)
Copied to clipboard
| Challenge: | Pre-trained language models (PLMs) have achieved competitive performance with limited labeled data for many NLP tasks. |
| Approach: | They propose a prompt-based data selection method for pre-trained language models fine-tuning under cold-start scenarios. |
| Outcome: | The proposed method outperforms the strongest cold-start data selection baselines on six text classification datasets with 128 labels. |
PACE: Prefix-Protected and Difficulty-Aware Compression for Efficient Reasoning (2026.findings-acl)
Copied to clipboard
Ruixiang Feng, Yuntao Wen, Silin Zhou, Ke Shi, Yifan Wang, Ran Le, Zhenwei An, Zongchao Chen, Chen Yang, Guangyue Peng, Yiming Jia, Dongsheng Wang, Tao Zhang, Lisi Chen, Yang Song, Shen Gao, Shuo Shang
| Challenge: | Existing LRMs often suffer from "overthinking" and excessively long reasoning traces . a dual-level framework for length compression of LRM is proposed . |
| Approach: | They propose a framework for prefix-protected and difficulty-aware compression under hierarchical supervision. |
| Outcome: | The proposed framework reduces token usage while improving accuracy on math benchmarks. |
BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Proving (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to theorem proving in large language models rely on value functions and/or Monte Carlo Tree Search (MCTS), but the potential of simpler methods like Best-First Tree Search remains underexplored. |
| Approach: | They propose a scalable expert iteration framework that implements strategic data filtering at each expert iteration round, excluding problems solvable via beam search node expansion to focus on harder cases. |
| Outcome: | The proposed framework achieves a state-of-the-art score of 72.95 on the MiniF2F test set and challenges the perceived necessity of complex tree search methods. |
Lock on Target! Precision Unlearning via Directional Control (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for unlearning harmful, sensitive, or outdated knowledge suffer from two critical limitations: (1) collateral forgetting, where erasing target data inadvertently removes related but desirable knowledge, and (2) generality forgetting degrades the model’s general capabilities. |
| Approach: | They propose a method that identifies and leverages a targeted "unlearning direction" in the model's parameter space and selectively updates along this direction. |
| Outcome: | Experiments show that the proposed method achieves state-of-the-art unlearning precision while preserving both related knowledge and general capabilities. |
Wav2SQL: Direct Generalizable Speech-To-SQL Parsing (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing models for speech-driven SQL parsing are based on a cascaded approach, resulting in data scarcity and inconsistent performance. |
| Approach: | They propose a direct generalizable speech-to-SQL parsing model which avoids error compounding across cascaded systems. |
| Outcome: | The proposed model avoids error compounding and achieves state-of-the-art results by 4.7% improvement over baseline. |