Qixin Xu
Author directory2026
PRISM: Promoting Sampling Diversity of Large Language Models with Implicit Stochastic Modulation
Qixin Xu | Zihan Zhu | Xiaojiang Liu | Bohan Lyu
Findings of the Association for Computational Linguistics: EMNLP 2026
Qixin Xu | Zihan Zhu | Xiaojiang Liu | Bohan Lyu
Findings of the Association for Computational Linguistics: EMNLP 2026
Large language models (LLMs) exhibit mode collapse, where their output distribution concentrates on familiar semantic modes. When diversity disappears, repeated sampling becomes semantic repetition rather than discovery, making rare but stronger solutions unlikely to surface and leaving self-evolution and continual learning difficult to sustain. Most remedies intervene only at inference time, shaping samples without making diversity a model capability. We propose PRISM, a training-time framework that internalizes diversity within the model. PRISM combines (i) submodular curation that pairs each prompt with diverse-yet-correct multi-teacher solutions, and (ii) stochastic embedding modulation, which turns special-token perturbations into implicit signals for sampling distinct outputs. A theoretical analysis establishes the stability of this mechanism. On WritingPrompts and BookMIA, PRISM moves the quality-diversity frontier outward, achieving the best generation quality in all model-benchmark settings while maintaining the strongest or near-strongest semantic diversity across two open-weight model families. It also improves sampling efficiency on math and code benchmarks. Beyond inference, PRISM yields a stronger initialization for reinforcement learning, sustaining diverse rollouts and mitigating the diversity collapse commonly observed during RL fine-tuning.
Masking Stale Observations Helps Search Agents — Until It Doesn’t: A Regime Map and Its Mechanism
Haoxiang Zhang | Qixin Xu | Zhuofeng Li | Lei Zhang | Pengcheng Jiang | Yu Zhang | Julian McAuley
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Haoxiang Zhang | Qixin Xu | Zhuofeng Li | Lei Zhang | Pengcheng Jiang | Yu Zhang | Julian McAuley
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Long-horizon search agents accumulate large amounts of retrieved content across many tool calls, making context-budget efficiency increasingly important. A minimal intervention is to mask stale observations from the context as the trajectory progresses, but it remains unclear when this form of context management helps and why. We study observation masking through a systematic sweep over various agent backbones (4B to 284B parameters) and three retrievers on offline and live-web agentic search benchmarks. We find that the accuracy gain from masking follows an asymmetric inverted-U shape when plotted against the model’s accuracy without context management: a plateau under weak retrievers, a peak in the *mismatch regime* (strong retriever × mid-capacity model), and a sharp collapse when the model is saturated. This pattern reflects the interaction between retriever recall and the model’s implicit filtering capacity, rather than either factor in isolation. Mechanistically, masking implements a token-for-turn trade-off: it removes observations the model has largely stopped attending to and pages the agent rarely re-opens. The added turns help when they convert failures into successes, but they fail when masking removes evidence the model would otherwise have used. We therefore reframe context management as a regime-dependent intervention (rather than a default choice), providing a new, holistic viewpoint that unifies the understanding of agentic deep search.
2019
Leveraging Frequent Query Substructures to Generate Formal Queries for Complex Question Answering
Jiwei Ding | Wei Hu | Qixin Xu | Yuzhong Qu
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)
Jiwei Ding | Wei Hu | Qixin Xu | Yuzhong Qu
Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)
Formal query generation aims to generate correct executable queries for question answering over knowledge bases (KBs), given entity and relation linking results. Current approaches build universal paraphrasing or ranking models for the whole questions, which are likely to fail in generating queries for complex, long-tail questions. In this paper, we propose SubQG, a new query generation approach based on frequent query substructures, which helps rank the existing (but nonsignificant) query structures or build new query structures. Our experiments on two benchmark datasets show that our approach significantly outperforms the existing ones, especially for complex questions. Also, it achieves promising performance with limited training data and noisy entity/relation linking results.