Papers by Feng-Lin Li
Full-Step-DPO: Self-Supervised Preference Optimization with Step-wise Rewards for Mathematical Reasoning (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to improve long-chain mathematical reasoning focus on the first erroneous step, but ignore all other steps and rely heavily on external signals. |
| Approach: | They propose a DPO framework that leverages step-wise rewards from the entire reasoning chain instead of optimizing only the first erroneous step. |
| Outcome: | The proposed framework improves on in-domain and out-of-domain mathematical reasoning benchmarks. |
REPT: Bridging Language Models and Machine Reading Comprehension via Retrieval-Based Pre-training (2021.findings-acl)
Copied to clipboard
| Challenge: | Pre-trained language models have achieved great success on Machine Reading Comprehension (MRC) however, the poor support in evidence extraction hinders them from further advancing MRC. |
| Approach: | They propose a REtrieval-based pre-training approach that strengthens evidence extraction during pre-training by inherited downstream MRC tasks. |
| Outcome: | The proposed approach strengthens evidence extraction during pre-training, which is further inherited by downstream tasks. |
KACE: Generating Knowledge Aware Contrastive Explanations for Natural Language Inference (2021.acl-long)
Copied to clipboard
| Challenge: | Existing approaches in NLP focus on “WHY A” rather than contrastive “WHA NOT B” Experimental results show that contrastive explanations are beneficial to fit the scenarios by clarifying the difference between the predicted answer and other possible wrong ones. |
| Approach: | They propose to generate contrastive explanations with counterfactual examples in NLI by identifying key phrases from input sentences and using them as key perturbations to generate counterfacts. |
| Outcome: | The proposed framework improves on SNLI and ETPA models by 91.9%. |
SCOPE: Compress Mathematical Reasoning Steps for Efficient Automated Process Annotation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing process annotation approaches are computationally expensive. |
| Approach: | They propose a compression-based approach that transforms reasoning steps into code and normalizes them through Abstract Syntax Tree. |
| Outcome: | The proposed method outperforms existing methods on Best-of-N strategy and ProcessBench. |
Don’t Forget Your Reward Values: Language Model Alignment via Value-based Calibration (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for generating large language models have been criticized for their complexity and instability. |
| Approach: | They propose a value-based calibration method to better align Large Language Models with human preferences. |
| Outcome: | The proposed method surpasses existing methods on AI assistant and summarization datasets, providing impressive generalizability, robustness, and diversity in different settings. |