← Search

Mengyue Yang

22 accepted papers

2026

Belief-Contraction-Driven Active Inverse Source Localization and Characterization

IJCAI 2026

Active inverse source localization and characterization (ISLC) in dynamic fields requires sequential decision making under partial observability, where a mobile sensor must infer latent source parameters from sparse, noisy readings. We introduce a belief-contraction-driven approach that unifies infe

Cited by 0Scholar
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

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

Learning to Memorize with Attributive and Associative Memory for Online Test-Time Adaptation of Vision-Language Models

ICML 2026poster

Memory-based test-time adaptation (TTA) assigns streaming test samples into class-specific memory slots based on pseudo-labels predicted by models like CLIP, and retrieves them to facilitate subsequent predictions under distribution shift. However, this process introduces two challenges: ❶ **Each sa…

Cited by 0SourceScholar
2026

ProcMEM: Learning Reusable Procedural Memory from Experience via Non-Parametric PPO for LLM Agents

ICML 2026spotlight

LLM-driven agents demonstrate strong performance in sequential decision-making but often rely on on-the-fly reasoning, re-deriving solutions even in recurring scenarios. This insufficient experience reuse leads to computational redundancy and execution instability. To bridge this gap, we propose Pro…

Cited by 16SourceScholar
2025

A Principle of Targeted Intervention for Multi-Agent Reinforcement Learning

NeurIPS 2025poster

Steering cooperative multi-agent reinforcement learning (MARL) towards desired outcomes is challenging, particularly when the global guidance from a human on the whole multi-agent system is impractical in a large-scale MARL. On the other hand, designing external mechanisms (e.g., intrinsic rewards a…

Cited by 0SourceScholar
2025

Causal Representation Learning from Multimodal Biomedical Observations

ICLR 2025poster

Prevalent in biomedical applications (e.g., human phenotype research), multimodal datasets can provide valuable insights into the underlying physiological mechanisms. However, current machine learning (ML) models designed to analyze these datasets often lack interpretability and identifiability guar…

Cited by 0SourcePDFScholar
2025

Causal Sufficiency and Necessity Improves Chain-of-Thought Reasoning

NeurIPS 2025poster

Chain-of-Thought (CoT) prompting plays an indispensable role in endowing large language models (LLMs) with complex reasoning capabilities. However, CoT currently faces two fundamental challenges: (1) Sufficiency, which ensures that the generated intermediate inference steps comprehensively cover and…

Cited by 0SourceScholar
2025

Curious Causality-Seeking Agents Learn Meta Causal World

NeurIPS 2025poster

When building a world model, a common assumption is that the environment has a single, unchanging underlying causal rule, like applying Newton's laws to every situation. However, in truly open-ended environments, the apparent causal mechanism may drift over time because the agent continually encount…

Cited by 0SourceScholar
2025

Decentralized Dynamic Cooperation of Personalized Models for Federated Continual Learning

NeurIPS 2025poster

Federated continual learning (FCL) has garnered increasing attention for its ability to support distributed computation in environments with evolving data distributions. However, the emergence of new tasks introduces both temporal and cross-client shifts, making catastrophic forgetting a critical ch…

Cited by 0SourcecodeScholar
2025

Efficient Reinforcement Learning with Large Language Model Priors

ICLR 2025poster

In sequential decision-making (SDM) tasks, methods like reinforcement learning (RL) and heuristic search have made notable advances in specific cases. However, they often require extensive exploration and face challenges in generalizing across diverse environments due to their limited grasp of the u…

Cited by 4SourcePDFScholar
2025

Large Language Models are Demonstration Pre-Selectors for Themselves

ICML 2025poster

In-context learning with large language models (LLMs) delivers strong few-shot performance by choosing few-shot demonstrations from the entire training dataset. However, previous few-shot in-context learning methods, which calculate similarity scores for choosing demonstrations, incur high computati…

Cited by 0SourcePDFScholar
2025

MF-LLM: Simulating Population Decision Dynamics via a Mean-Field Large Language Model Framework

NeurIPS 2025poster

Simulating collective decision-making involves more than aggregating individual behaviors; it emerges from dynamic interactions among individuals. While large language models (LLMs) offer strong potential for social simulation, achieving quantitative alignment with real-world data remains a key chal…

Cited by 0SourcecodeScholar
2025

Unveiling Extraneous Sampling Bias with Data Missing-Not-At-Random

NeurIPS 2025poster

Selection bias poses a widely recognized challenge for unbiased evaluation and learning in many industrial scenarios. For example, in recommender systems, it arises from the users' selective interactions with items. Recently, doubly robust and its variants have been widely studied to achieve debiase…

Cited by 0SourcecodeScholar
2025

When Can Proxies Improve the Sample Complexity of Preference Learning?

ICML 2025poster

We address the problem of reward hacking, where maximising a proxy reward does not necessarily increase the true reward. This is a key concern for Large Language Models (LLMs), as they are often fine-tuned on human preferences that may not accurately reflect a true objective. Existing work uses vari…

Cited by 0SourcePDFScholar
2023

ChessGPT: Bridging Policy Learning and Language Modeling

NeurIPS 2023poster

When solving decision-making tasks, humans typically depend on information from two key sources: (1) Historical policy data, which provides interaction replay from the environment, and (2) Analytical insights in natural language form, exposing the invaluable thought process or strategic consideratio…

2023

Invariant Learning via Probability of Sufficient and Necessary Causes

NeurIPS 2023spotlight

Out-of-distribution (OOD) generalization is indispensable for learning models in the wild, where testing distribution typically unknown and different from the training. Recent methods derived from causality have shown great potential in achieving OOD generalization. However, existing methods mainly…

2023

Lending Interaction Wings to Recommender Systems with Conversational Agents

NeurIPS 2023poster

An intelligent conversational agent (a.k.a., chat-bot) could embrace conversational technologies to obtain user preferences online, to overcome inherent limitations of recommender systems trained over the offline historical user behaviors. In this paper, we propose CORE, a new offline-training and o…

Cited by 15SourcePDFScholar
2021

CausalVAE: Disentangled Representation Learning via Neural Structural Causal Models

CVPR 2021poster

Learning disentanglement aims at finding a low dimensional representation which consists of multiple explanatory and generative factors of the observational data. The framework of variational autoencoder (VAE) is commonly used to disentangle independent factors from observations. However, in real sc…

Cited by 337PDFScholar