Papers by Tian Bowen

11 papers
Rethinking Data Selection at Scale: Random Selection is Almost All You Need (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing data selection techniques are designed for small data pools, a study finds . filtering data by token length is an efficient method for improving results .
Approach: They use self-scoring methods that do not rely on external help to perform fine-tuning . they also find that filtering data by token length offers a stable and efficient method .
Outcome: The proposed methods outperform random selection on large datasets on large data pools.
QUITO-X: A New Perspective on Context Compression from the Information Bottleneck Theory (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for compressing context by removing redundant tokens are inconsistent with the objective of retaining the most important tokens when conditioning on a given query.
Approach: They propose a method that uses information bottleneck theory to compress context . they propose to remove redundant tokens using metrics such as self-information or perplexity .
Outcome: The proposed method achieves a 25% increase in compression rate compared to the state-of-the-art .
ReviewRL: Towards Automated Scientific Review with RL (2025.emnlp-main)

Copied to clipboard

Challenge: Existing automated review systems struggle with factual accuracy, rating consistency, and analytical depth.
Approach: They propose a framework for generating comprehensive and factually grounded scientific paper reviews using supervised fine-tuning and reinforcement learning.
Outcome: The proposed framework outperforms existing methods on ICLR 2025 papers.
MDPO: Customized Direct Preference Optimization with a Metric-based Sampler for Question and Answer Generation (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for QA data generation are limited by the dependence of existing evaluation metrics on ground truth labels.
Approach: They propose a set of unsupervised evaluation metrics for QA data that enable multidimensional assessment based on the relationships among context,question and answer.
Outcome: The proposed method outperforms state-of-the-art methods on public datasets and shows that it produces high-quality and domain-specific QA pairs.
QSpell 250K: A Large-Scale, Practical Dataset for Chinese Search Query Spell Correction (2025.naacl-industry)

Copied to clipboard

Challenge: Chinese Search Query Spell Correction is a task designed to identify and correct typographical errors within queries.
Approach: They propose a large-scale benchmark specifically developed for Chinese Query Spell Correction.
Outcome: The proposed benchmark covers a broad range of topics, including formal entities, everyday colloquialisms and idiomatic expressions.
Semi-Supervised Lifelong Language Learning (2022.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to learn languages only focus on supervised learning, and unlabeled data is underexplored.
Approach: They propose a semi-supervised lifelong language learning setting where a model learns sequentially arriving language tasks with both labeled and unlabeled data.
Outcome: The proposed model outperforms baseline models on various language tasks and is effective and superior to existing models.
Intuitive Fine-Tuning: Towards Simplifying Alignment into a Single Process (2025.acl-long)

Copied to clipboard

Challenge: Supervised Fine-Tuning (SFT) and Preference Optimization (PO) are key processes for aligning Language Models with human preferences post pre-training.
Approach: They propose to combine Supervised Fine-Tuning and Preference Optimization (PO) with two sub-processes defined at token level within the Markov Decision Process (MDP)
Outcome: The proposed process performs comparably or even superiorly to SFT and some typical PO methods across several tasks, particularly those requires generation, reasoning, and fact-following abilities.
SDAR: A Synergistic Diffusion-AutoRegression Paradigm for Scalable Sequence Generation (2026.findings-acl)

Copied to clipboard

Challenge: Autoregressive (AR) language models are a dominant paradigm in the field of parallelism and non-causal modeling.
Approach: They propose a blockwise discrete diffusion model that preserves AR-compatible serving while enabling parallel intra-block generation.
Outcome: The proposed model achieves theoretical speedups over 5 and wall-clock speedup of 2.3 on H200 GPUs in latency-critical regimes.
Best Practices for Distilling Large Language Models into BERT for Web Search Ranking (2025.coling-industry)

Copied to clipboard

Challenge: Recent studies have highlighted the potential of Large Language Models (LLMs) as zero-shot relevance rankers.
Approach: They propose to use a ranking loss to transfer ranking knowledge from LLMs to smaller models like BERT.
Outcome: The proposed model has been successfully integrated into a commercial web search engine as of February 2024.
Rethinking Expert Trajectory Utilization in LLM Post-training for Mathematical Reasoning (2026.acl-long)

Copied to clipboard

Challenge: evolving generic Large Language Models into specialized Large Reasoning Models requires effective post-training.
Approach: They propose a plasticity-ceiling framework to harness expert trajectories . they establish the Sequential SFT-then-RL pipeline as the superior standard .
Outcome: The proposed framework overcomes stability and premature convergence deficits in synchronized approaches.
Less Languages, Less Tokens: An Efficient Unified Logic Cross-lingual Chain-of-Thought Reasoning Framework (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for cross-lingual chain-of-thought (XCoT) with self-consistency are costly due to extensive sampling of full trajectories across languages.
Approach: They propose a cross-lingual chain-of-thought framework that minimizes redundancy in token usage and latency.
Outcome: Experiments on polymath show that UL-XCoT reduces decoding token costs and latency by 50% . UL XCot also aggregates remaining high-quality reasoning paths via voting .

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations