← Search

Junchi Yu

12 accepted papers

2026

ARCHE: A Novel Task to Evaluate LLMs on Latent Reasoning Chain Extraction

AAAI 2026technical

Large language models (LLMs) are increasingly used in scientific domains. While they can produce reasoning-like content via methods such as chain-of-thought prompting, these outputs are typically unstructured and informal, obscuring whether models truly understand the fundamental reasoning paradigms

Cited by 0SourcePDFScholar
2026

Causal Fine-Tuning under Latent Confounded Shift

ICML 2026poster

Adapting to latent confounded shift remains a core challenge in modern AI. This setting is driven by hidden variables that induce spurious correlations between inputs and outputs during training, leading models to rely on non-causal shortcuts. For example, a model may learn to treat metadata (e.g., …

Cited by 0SourceScholar
2026

CausalGame: Benchmarking Causal Thinking of LLM Agents in Games

ICML 2026oral

Recently, it has received growing attention in building AI Scientist agents with Large Language Models (LLMs). Since scientific discovery fundamentally relies on uncovering causal relationships from observations, the capability of causal thinking that distinguish causation from correlation and hidde…

Cited by 0SourceScholar
2026

Deep Research Arena: The First Exam of LLMs’ Research Abilities via Seminar-Grounded Tasks

AAAI 2026technical

Deep research agents have attracted growing attention for their potential to orchestrate multi-stage research workflows, spanning literature synthesis, methodological design, and empirical verification. Despite these strides, evaluating their research capability faithfully is rather challenging due

Cited by 0SourcePDFScholar
2026

Distinguishable Deletion: Unifying Knowledge Erasure and Refusal for Large Language Model Unlearning

ICML 2026poster

Mitigating sensitive and harmful outputs is fundamental to ensuring safe deployment of LLMs. Existing approaches typically follow two paradigms: Knowledge Deletion (KD), which erases undesirable information during training, and Distinguishable Refusal (DR), which steers models away from using sensit…

Cited by 0SourceScholar
2026

From What to Why: A Multi-Agent System for Evidence-based Chemical Reaction Condition Reasoning

ICLR 2026poster

The chemical reaction recommendation is to select proper reaction condition parameters for chemical reactions, which is pivotal to accelerating chemical science.With the rapid development of large language models (LLMs), there is growing interest in leveraging their reasoning and planning capabiliti…

Cited by 0SourceScholar
2026

TRACEDET: HALLUCINATION DETECTION FROM THE DECODING TRACE OF DIFFUSION LARGE LANGUAGE MODELS

ICLR 2026poster

Diffusion large language models (D-LLMs) have recently emerged as a promising alternative to auto-regressive LLMs (AR-LLMs). However, the hallucination problem in D-LLMs remains underexplored, limiting their reliability in real-world applications. Existing hallucination detection methods are designe…

Cited by 0SourcecodeScholar
2025

Can Knowledge-Graph-based Retrieval Augmented Generation Really Retrieve What You Need?

NeurIPS 2025spotlight

Retrieval-Augmented Generation (RAG) based on knowledge graphs (KGs) enhances large language models (LLMs) by providing structured and interpretable external knowledge. However, existing KG-based RAG methods struggle to retrieve accurate and diverse information from text-rich KGs for complex real-wo…

Cited by 0SourceScholar
2024

THOUGHT PROPAGATION: AN ANALOGICAL APPROACH TO COMPLEX REASONING WITH LARGE LANGUAGE MODELS

ICLR 2024poster

Large Language Models (LLMs) have achieved remarkable success in reasoning tasks with the development of prompting methods. However, existing prompting approaches cannot reuse insights of solving similar problems and suffer from accumulated errors in multi-step reasoning, since they prompt LLMs to…

2021

Graph Information Bottleneck for Subgraph Recognition

ICLR 2021poster

Given the input graph and its label/property, several key problems of graph learning, such as finding interpretable subgraphs, graph denoising and graph compression, can be attributed to the fundamental problem of recognizing a subgraph of the original one. This subgraph shall be as informative…