Papers by Binbin Lin
Adaptive Hyper-parameter Learning for Deep Semantic Retrieval (2023.emnlp-industry)
Copied to clipboard
| Challenge: | Existing methods for deep semantic retrieval are highly sensitive to hyper-parameters . a novel adaptive metric learning method is proposed to overcome this limitation . |
| Approach: | They propose a method that adaptively obtains hyper-parameters without fixed or extra-trainable hyper-parmeters . they adopt a symmetric metric learning method to mitigate model collapse issues . |
| Outcome: | The proposed method outperforms existing methods on a real-world dataset and brings economic benefits. |
WR-One2Set: Towards Well-Calibrated Keyphrase Generation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Experimental results show that keyphrase generation has serious calibration errors . ONE2SET generates short phrases summarizing an input document . |
| Approach: | They propose a paradigm for keyphrase generation that generates short phrases summarizing an input document. |
| Outcome: | The proposed model over-estimates tokens and makes it well-calibrated on common datasets. |
Beyond Templates: Dynamic Adaptation of Reasoning Demonstrations via Feasibility-Aware Exploration (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reasoning datasets that are designed for powerful LLMs often lead to degraded performance when directly applied to weaker models. |
| Approach: | They propose a data adaptation framework that bridges the capability gap between expert reasoning trajectories and diverse SLMs by employing a selective imitation strategy guided by step-wise adaptability estimation via solution simulation. |
| Outcome: | The proposed framework improves generalization and data efficiency over static fine-tuning and can be applied to large models with limited model capacity. |
MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sample-Efficient LLM Reasoning (2026.acl-long)
Copied to clipboard
Xiaoliang Fu, Jiaye Lin, Yangyi Fang, Binbin Zheng, Chaowen Hu, Zekai Shao, Cong Qin, Lu Pan, Ke Zeng, Xunliang Cai
| Challenge: | Existing RLVR algorithms rely on rigid, uniform, and symmetric trust region mechanisms . current algorithms lack robustness, asymmetric signal reliability and inefficient gradient utilization . |
| Approach: | They propose a framework to harmonize three dimensions of RLVR algorithms, a paper argues . a binary cutoff is used to discard valuable reinforcement signals, they argue . |
| Outcome: | The proposed framework outperforms baselines in evaluating a robust RLVR solution. |
From log 𝜋 to 𝜋: Taming Divergence in Soft Clipping via Bilateral Decoupled Decay of Probability Gradient Weight (2026.acl-long)
Copied to clipboard
Xiaoliang Fu, Jiaye Lin, Yangyi Fang, Chaowen Hu, Cong Qin, Zekai Shao, Binbin Zheng, Lu Pan, Ke Zeng
| Challenge: | Standard algorithms for Large Language Models (LLMs) enforce stability via "hard clipping" but relying on log-probability gradient yields divergent weights as probabilities vanish, destabilizing LLM training. |
| Approach: | They propose a decoupled gradient policy optimization that uses a decay mechanism to decouple the probability of a boundary token. |
| Outcome: | The proposed algorithm outperforms baselines on various mathematical benchmarks. |
Enhancing Chain-of-Thought Reasoning with Critical Representation Fine-tuning (2025.acl-long)
Copied to clipboard
Chenxi Huang, Shaotian Yan, Liang Xie, Binbin Lin, Sinan Fan, Yue Xin, Deng Cai, Chen Shen, Jieping Ye
| Challenge: | Representation Fine-tuning (ReFT) is a proposed method for improving parameter efficiency . however, it yields suboptimal performance, as fixed-position representations have uncertain impact on outputs . |
| Approach: | They propose a method that fine-tunes critical representations in a low-rank linear subspace while freezing the base model. |
| Outcome: | The proposed method improves accuracy of LLaMA-2-7B and ReFT by 18.2 and 3.8 on GSM8K. |
Breaking the Hourglass Phenomenon of Residual Quantization: Enhancing the Upper Bound of Generative Retrieval (2024.emnlp-industry)
Copied to clipboard
Zhirui Kuai, Zuxu Chen, Huimu Wang, Mingming Li, Dadong Miao, Wang Binbin, Xusong Chen, Li Kuang, Yuxing Han, Jiaxing Wang, Guoyu Tang, Lin Liu, Songlin Wang, Jingwei Zhuo
| Challenge: | Generative retrieval (GR) is a transformative paradigm in search and recommender systems . however, data sparsity and long-tailed distribution hinder the full utilization of GR . |
| Approach: | They propose a method to reduce the "Hourglass" phenomenon in RQ-SID where codebook tokens become overly concentrated. |
| Outcome: | The proposed methods improve retrieval efficiency and generalization capabilities. |