← Search

Tianjun Yao

7 accepted papers

2026

Enhancing Complex Symbolic Logical Rea­soning of Large Language Models via Sparse Multi-Agent Debate

ICLR 2026poster

Large language models (LLMs) struggle with complex logical reasoning. Previous work has primarily explored single-agent methods, with their performance remains fundamentally limited by the capabilities of a single model. To our knowledge, this paper first introduce a multi-agent approach specificall…

Cited by 0SourcecodeScholar
2026

HieraMAS: Optimizing Intra-Node LLM Mixtures and Inter-Node Topology for Multi-Agent Systems

ICML 2026poster

Multi-agent systems (MAS) built on large language models (LLMs) have demonstrated remarkable performance across diverse tasks. Existing approaches optimize communication topology, role assignment, or LLM routing in isolation, while treating each agent as a monolithic unit—failing to exploit internal…

Cited by 1SourceScholar
2026

ParamMem: Augmenting Language Agents with Parametric Reflective Memory

ICML 2026poster

Self-reflection enables language agents to iteratively refine solutions, yet often produces repetitive outputs that limit reasoning performance. Recent studies have attempted to address this limitation through various approaches, among which increasing reflective diversity has shown promise. Our emp…

Cited by 0SourceScholar
2025

Learning Graph Invariance by Harnessing Spuriosity

ICLR 2025poster

Recently, graph invariant learning has become the _de facto_ approach to tackle the Out-of-Distribution (OOD) generalization failure in graph representation learning. They generically follow the framework of invariant risk minimization to capture the invariance of graph data from different environme…

Cited by 0SourcePDFScholar
2025

Pruning Spurious Subgraphs for Graph Out-of-Distribution Generalization

NeurIPS 2025poster

Graph Neural Networks (GNNs) often encounter significant performance degradation under distribution shifts between training and test data, hindering their applicability in real-world scenarios. Recent studies have proposed various methods to address the out-of-distribution (OOD) generalization chall…

Cited by 0SourceScholar
2024

Efficient LLM Jailbreak via Adaptive Dense-to-sparse Constrained Optimization

NeurIPS 2024poster

Recent research indicates that large language models (LLMs) are susceptible to jailbreaking attacks that can generate harmful content. This paper introduces a novel token-level attack method, Adaptive Dense-to-Sparse Constrained Optimization (ADC), which has been shown to successfully jailbreak mult…

2024

Empowering Graph Invariance Learning with Deep Spurious Infomax

ICML 2024poster

Recently, there has been a surge of interest in developing graph neural networks that utilize the invariance principle on graphs to generalize the out-of-distribution (OOD) data. Due to the limited knowledge about OOD data, existing approaches often pose assumptions about the correlation strengths o…