Papers by Jianxing Liu
From Selection to Refinement: Iterative Optimization for Instruction Data (2026.acl-long)
Copied to clipboard
Hang Hu, Ziyan Liu, Rujie Wen, Ruihui Hou, Xueyan Wu, Mu Zhang, Jianxing Yu, Tong Ruan, Jingping Liu
| Challenge: | Existing methods to optimize instruction tuning datasets face two main challenges: unreasonable pruning of potentially valuable low-quality data and the persistence of noise or semantic drift during revision. |
| Approach: | They propose an automated iterative framework for instruction data optimization that prunes low-quality data and refines low quality data using feedback-driven iteration. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on seven public benchmark datasets with high data efficiency. |
Low-Resource Generation of Multi-hop Reasoning Questions (2020.acl-main)
Copied to clipboard
| Challenge: | Existing methods to generate valid and fluent questions from text are limited and insufficient for training. |
| Approach: | They propose to generate multi-hop reasoning questions from the raw text in a low resource circumstance by deducing over multiple relations on several sentences in the text. |
| Outcome: | The proposed model can be applied to the task of machine reading comprehension and achieve significant performance improvements. |
Integrating Semantics and Neighborhood Information with Graph-Driven Generative Models for Document Retrieval (2021.acl-long)
Copied to clipboard
Zijing Ou, Qinliang Su, Jianxing Yu, Bang Liu, Jingwen Wang, Ruihui Zhao, Changyou Chen, Yefeng Zheng
| Challenge: | Existing methods for document hashing combine only one of semantics and neighborhood information, lacking a theoretical principle to guide the integration process. |
| Approach: | They propose to encode neighborhood information with a graph-induced Gaussian distribution and integrate it with generative models. |
| Outcome: | The proposed model can be trained as efficiently as state-of-the-art methods on benchmark datasets. |
Boost, Disentangle, and Customize: A Robust System2-to-System1 Pipeline for Code Generation (2025.findings-acl)
Copied to clipboard
Kounianhua Du, Hanjing Wang, Jianxing Liu, Jizheng Chen, Xinyi Dai, Yasheng Wang, Ruiming Tang, Yong Yu, Jun Wang, Weinan Zhang
| Challenge: | Existing systems 2 methods for code generation are difficult to implement due to the complex hidden reasoning process and heterogeneous data distribution. |
| Approach: | They propose a framework that Boosts reasoning exploration via multi-agent collaboration and Disentangles heterogeneous data into specialized experts. |
| Outcome: | The proposed framework outperforms state-of-the-art methods on APPS and CodeContest benchmarks and achieves 73.8% accuracy on hard problems. |
HopWeaver: Cross-Document Synthesis of High-Quality and Authentic Multi-Hop Questions (2026.acl-long)
Copied to clipboard
| Challenge: | Multi-Hop Question Answering (MHQA) is a critical benchmark for evaluating the model’s ability to integrate information from diverse sources. |
| Approach: | They propose a framework that synthesizes authentic multi-hop questions without manual annotation without the need for manual guidance. |
| Outcome: | The proposed framework synthesizes bridge and comparison questions without human intervention and achieves comparable or superior quality to human-annotated datasets at a lower cost. |
Generating Deep Questions with Commonsense Reasoning Ability from the Text by Disentangled Adversarial Inference (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for commonsense question generation produce shallow questions that can be answered by simple word matching. |
| Approach: | They propose a task of commonsense question generation that aims to yield deep-level questions from the text. |
| Outcome: | The proposed model can yield deep-level and to-the-point questions from the text. |
WIST: Web-Grounded Iterative Self-Play Tree for Domain-Targeted Reasoning Improvement (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for self-improvement of large language models with verifiable rewards (RLVR) can drift over iterations, while corpus-grounded approaches rely on curated data environments. |
| Approach: | They propose a Web-grounded Iterative Self-play Tree framework for domain-targeted reasoning improvement that learns directly from the open-web without requiring any pre-arranged domain corpus. |
| Outcome: | The proposed framework outperforms both purely endogenous self-evolution and corpus-grounded self-play baselines and is domain-steerable. |
Refining BERT Embeddings for Document Hashing via Mutual Information Maximization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing unsupervised document hashing methods are mostly established on generative models . due to the difficulties of capturing long dependency structures, these methods rarely model the raw documents directly . |
| Approach: | They propose to learn hash codes from BERT embeddings by modifying existing models . they use mutual information maximization principle to maximize mutual information . |
| Outcome: | The proposed method outperforms existing methods learned from BERT embeddings on three benchmark datasets. |
Graph Counselor: Adaptive Graph Exploration via Multi-Agent Synergy to Enhance LLM Reasoning (2025.acl-long)
Copied to clipboard
| Challenge: | Existing methods for enhancing LLM reliability suffer from inefficient information aggregation and rigid reasoning schemes. |
| Approach: | They propose a method that explicitly models external knowledge integration capabilities by explicitly modeling knowledge relationships. |
| Outcome: | The proposed method outperforms existing methods in multiple graph reasoning tasks. |
SMR: State Memory Replay for Long Sequence Modeling (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing state space models (SSMs) address non-uniform sampling, but their recursive structures impede efficient SSM computation via convolution. |
| Approach: | They propose a plug-and-play mechanism to solve the Non-Stable State problem by adjusting input sequences with early memories. |
| Outcome: | The proposed method overcomes the non-uniform sample processing problem . it can achieve Sampling Step Adaptation (SSA) by adjusting input sequences with early memories. |