← Search

Wen-Da Wei

8 accepted papers

2026

ChinaTravel: An Open-Ended Travel Planning Benchmark with Compositional Constraint Validation for Language Agents

ICLR 2026poster

Travel planning stands out among real-world applications of \emph{Language Agents} because it couples significant practical demand with a rigorous constraint-satisfaction challenge. However, existing benchmarks primarily operate on a slot-filling paradigm, restricting agents to synthetic queries wit…

Cited by 0SourcecodeScholar
2026

GraphIF: Enhancing Multi-Turn Instruction Following for Large Language Models with Relation Graph Prompt

AAAI 2026technical

Multi-turn instruction following is essential for building intelligent conversational systems that can consistently adhere to instructions across dialogue turns. However, existing approaches to enhancing multi-turn instruction following primarily rely on collecting or generating large-scale multi-tu

Cited by 0SourcePDFScholar
2026

Quantitative Estimation of Target Task Performance from Unsupervised Pretext Task in Semi/Self-Supervised Learning

ICML 2026poster

The effectiveness of unlabeled data in Semi/Self-Supervised Learning (SSL) depends on appropriate assumptions for specific scenarios, thereby enabling the selection of beneficial unsupervised pretext tasks. However, existing research has paid limited attention to assumptions in SSL, resulting in pra…

Cited by 0SourceScholar
2026

Stabilizing Recurrent Dynamics for Test-Time Scalable Latent Reasoning in Looped Language Models

ICML 2026poster

Looped Language Models (LoopLMs) enable efficient latent reasoning through depth recurrence, yet exhibit unreliable test-time scaling behavior: performance often peaks at a certain iteration depth and then collapses with further recurrence. Through latent dynamics analysis, we find an inherent trade…

Cited by 0SourceScholar
2026

Step Back to Leap Forward: Self-Backtracking for Symbolic Reasoning and Planning in Language Models

AAAI 2026technical

Although autoregressive language models demonstrated remarkable performance across various tasks, their effectiveness in symbolic reasoning and decision-making scenarios remains constrained. Recent research indicates that training language models to emulate symbolic search algorithms (e.g. depth-fi

Cited by 0SourcePDFScholar
2025

CARTS: Advancing Neural Theorem Proving with Diversified Tactic Calibration and Bias-Resistant Tree Search

ICLR 2025poster

Recent advancements in neural theorem proving integrate large language models with tree search algorithms like Monte Carlo Tree Search (MCTS), where the language model suggests tactics and the tree search finds the complete proof path. However, many tactics proposed by the language model converge to…

Cited by 0SourcePDFScholar
2024

Analysis for Abductive Learning and Neural-Symbolic Reasoning Shortcuts

ICML 2024poster

Abductive learning models (ABL) and neural-symbolic predictive models (NeSy) have been recently shown effective, as they allow us to infer labels that are consistent with some prior knowledge by reasoning over high-level concepts extracted from sub-symbolic inputs. However, their generalization abil…

Cited by 6SourcePDFScholar