Papers by Jialian Wu
Self-Taught Agentic Long Context Understanding (2025.acl-long)
Copied to clipboard
Yufan Zhuang, Xiaodong Yu, Jialian Wu, Ximeng Sun, Ze Wang, Jiang Liu, Yusheng Su, Jingbo Shang, Zicheng Liu, Emad Barsoum
| Challenge: | Extensive experiments across seven long-context tasks demonstrate that AgenticLU significantly outperforms state-of-the-art prompting methods and specialized long-consumer LLMs. |
| Approach: | They propose a framework to enhance an LLM's understanding of long-context questions by integrating targeted self-clarification with contextual grounding within an agentic workflow. |
| Outcome: | The proposed framework outperforms state-of-the-art prompting methods and specialized long-context LLMs in seven long-constitut tasks. |
Agent Laboratory: Using LLM Agents as Research Assistants (2025.findings-emnlp)
Copied to clipboard
Samuel Schmidgall, Yusheng Su, Ze Wang, Ximeng Sun, Jialian Wu, Xiaodong Yu, Jiang Liu, Michael Moor, Zicheng Liu, Emad Barsoum
| Challenge: | Agent Laboratory is an autonomous LLM-based framework that can complete the entire research process. |
| Approach: | Agent Laboratory is an autonomous LLM-based framework that can complete the entire research process. |
| Outcome: | Agent Laboratory is an autonomous LLM-based framework that can complete the entire research process. |
Stabilizing Efficient Reasoning with Step-Level Advantage Selection (2026.findings-acl)
Copied to clipboard
| Challenge: | Large language models generate long and verbose reasoning traces at inference time . short context post-training alone induces substantial reasoning compression . |
| Approach: | They propose a step-level advantage selection approach that reduces reasoning length by over 30% . they propose to use GRPO without any length-aware objective to train models in a shorter context window . |
| Outcome: | The proposed approach reduces average reasoning length by over 30% while improving Pass@1 accuracy by 3.79 points over the strongest length-aware baseline. |
Reliable Use of Lemmas via Eligibility Reasoning and Section-Aware Reinforcement Learning (2026.acl-short)
Copied to clipboard
| Challenge: | Recent large language models (LLMs) perform strongly on mathematical benchmarks but often import conclusions without validating assumptions. |
| Approach: | They propose a model that encodes a lemma specification and trains with reinforcement learning and section-aware loss masking to assign penalty to the section responsible for errors. |
| Outcome: | The proposed model performs well on benchmarks but often misapplyes lemmas . the model is able to encode the specification and train with reinforcement learning . |
TTT-Bench: A Benchmark for Evaluating Reasoning Ability with Simple and Novel Tic-Tac-Toe-style Games (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in large reasoning models (LRMs) have driven significant breakthroughs across various reasoning tasks including deductive, arithmetic, commonsense, relational, and symbolic reasoning. |
| Approach: | They propose a programmatic approach to evaluate basic strategic, spatial, and logical reasoning abilities in large reasoning models through four two-player Tic-Tac-Toe-style games that humans can effortlessly solve from a young age. |
| Outcome: | The proposed model performs 41% lower on TTT-Bench than MATH 500 and AIME 2024 models, while the larger models perform better on longer reasoning traces. |
DRIFT: Transferring Reasoning Priors for Efficient MLLM Fine-Tuning (2026.findings-acl)
Copied to clipboard
Chao Huang, Zeliang Zhang, Jiang Liu, Ximeng Sun, Jialian Wu, Xiaodong Yu, Ze Wang, Chenliang Xu, Emad Barsoum, Zicheng Liu
| Challenge: | Multimodal large language models (MLLMs) have made rapid progress in perception and alignment, but their reasoning ability often lags behind strong text-only LLMs. |
| Approach: | They propose a method that transfers reasoning knowledge in the gradient space while preserving multimodal alignment. |
| Outcome: | Experiments on multimodal reasoning benchmarks show that DRIFT outperforms naive merging and standard SFT. |