Papers by Jiaxi Wang

8 papers
Cut Your Losses! Learning to Prune Paths Early for Efficient Parallel Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Parallel reasoning enhances Large Reasoning Models but incurs prohibitive costs due to futile paths caused by early errors.
Approach: They propose a systematic taxonomy of path pruning to categorize methods by signal source and learnability.
Outcome: The proposed model improves LRMs but incurs prohibitive costs due to futile paths caused by early errors.
Turning the Tide: Repository-based Code Reflection (2025.findings-emnlp)

Copied to clipboard

Challenge: Code large language models (LLMs) enhance programming by understanding and generating code across languages.
Approach: a new benchmark evaluates code understanding and generation in repositories using code large language models.
Outcome: The proposed model improves code understanding and generation in repositories by evaluating 1,888 test cases across 6 programming languages.
SciAssess: Benchmarking LLM Proficiency in Scientific Literature Analysis (2025.findings-naacl)

Copied to clipboard

Challenge: Existing benchmarks fail to adequately evaluate the proficiency of Large Language Models (LLMs) Existing standards do not cover the skills needed to evaluate LLMs in scientific literature analysis.
Approach: They propose a benchmark to evaluate the proficiency of large language models in scientific literature analysis.
Outcome: SciAssess evaluates 11 LLMs on multiple tasks across scientific fields.
START: Self-taught Reasoner with Tools (2025.emnlp-main)

Copied to clipboard

Challenge: Large Reasoning Models (LRMs) have demonstrated remarkable capabilities in complex reasoning through long chain-of-thought, yet they struggle with precise computations and algorithmic operations.
Approach: They propose a training-free approach that activates LRMs’ latent tool-use capabilities through artificial hints and a framework that enables models to learn effective tool utilization through diverse hint patterns and rejection-based data synthesis.
Outcome: Experiments show that START significantly improves state-of-the-art LRMs across challenging benchmarks, including competition-level mathematics (AMC23: 95.0%, AIME24: 75.6%) and graduate-level science questions (GPQA: 64.6%).
Mnemis: Dual-Route Retrieval on Hierarchical Graphs for Long-Term LLM Memory (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for retrieving historical messages are based on similarity-based mechanisms.
Approach: They propose a system that integrates System-1 similarity search with a complementary System-2 mechanism, termed Global Selection.
Outcome: The proposed framework achieves state-of-the-art on long-term memory benchmarks and 93.9 on LoCoMo and 91.6 on LongMemEval-S.
KiPT: Knowledge-injected Prompt Tuning for Event Detection (2022.coling-1)

Copied to clipboard

Challenge: Existing prompt-based methods may suffer from low precision because they lack event-related semantic knowledge.
Approach: They propose a Knowledge-injected Prompt Tuning model to improve prompt tuning . event detection aims to detect events from text by identifying and classifying event triggers .
Outcome: The proposed model outperforms baseline models in few-shot scenarios.
From Completion to Editing: Unlocking Context-Aware Code Infilling via Search-and-Replace Instruction Tuning (2026.acl-long)

Copied to clipboard

Challenge: Fill-in-the-Middle (FIM) models suffer from performance degradation and prohibitive latency.
Approach: They propose a search-and-replace infilling framework that integrates agentic verification and editing into a single-pass inference process.
Outcome: The proposed framework harmonizes completion tasks with the instruction-following priors of Chat LLMs, extending the paradigm from static infilling to dynamic context-aware editing.
APEX: Learning Adaptive Priorities for Multi-Objective Alignment in Vision-Language Generation (2026.findings-acl)

Copied to clipboard

Challenge: APEX optimizes for text-to-image generation by combining learning potential, conflict penalty, and progress need.
Approach: They propose an algorithm that stabilizes heterogeneous rewards and dynamically schedules objectives . they propose a method that achieves better Pareto trade-offs across four heterogenous objectives based on P3 Adaptive Priorities .
Outcome: The proposed algorithm achieves better pareto trade-offs across four heterogeneous objectives while maintaining competitive OCR accuracy.

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