← Search

Yao Liu

39 accepted papers

2026

Data Selection for LLM Alignment Using Fine-Grained Preferences

ICLR 2026poster

Large language models (LLMs) alignment aims to ensure that the behavior of LLMs meets human preferences. While collecting data from multiple fine-grained, aspect-specific preferences becomes more and more feasible, existing alignment methods typically work on a single preference and thus struggle wi…

Cited by 0SourceScholar
2026

Human Cognition Inspired RAG with Knowledge Graph for Complex Problem Solving

AAAI 2026technical

Large Language Models (LLMs) have demonstrated significant potential across various domains. However, they often struggle with integrating external knowledge and performing complex reasoning, leading to hallucinations and unreliable outputs. Retrieval Augmented Generation (RAG) has emerged as a prom

Cited by 0SourcePDFScholar
2026

Learning to Focus and Precise Cropping:A Reinforcement Learning Framework with Information Gaps and Grounding Loss for MLLMs

CVPR 2026

To enhance the perception and reasoning capabilities of multimodal large language models in complex visual scenes, recent research has introduced agent-based workflows. In these works, MLLMs autonomously utilize image cropping tool to analyze regions of interest for question answering. While existin

Cited by 0SourcecodeScholar
2026

MMAU-Pro: A Challenging and Comprehensive Benchmark for Holistic Evaluation of Audio General Intelligence

AAAI 2026technical

Audio comprehension—including speech, non-speech sounds, and music—is essential for achieving human-level intelligence. Consequently, AI agents must demonstrate holistic audio understanding to qualify as generally intelligent. However, evaluating auditory intelligence comprehensively remains challen

Cited by 0SourcePDFScholar
2025

AgentOccam: A Simple Yet Strong Baseline for LLM-Based Web Agents

ICLR 2025poster

Autonomy via agents based on large language models (LLMs) that can carry out personalized yet standardized tasks presents a significant opportunity to drive human efficiency. There is an emerging need and interest in automating web tasks (e.g., booking a hotel for a given date within a budget). Bei…

Cited by 13SourcePDFScholar
2025

Ask a Strong LLM Judge when Your Reward Model is Uncertain

NeurIPS 2025poster

Reward model (RM) plays a pivotal role in reinforcement learning with human feedback (RLHF) for aligning large language models (LLMs). However, classical RMs trained on human preferences are vulnerable to reward hacking and generalize poorly to out-of-distribution (OOD) inputs. By contrast, strong…

Cited by 0SourceScholar
2025

Can Large Language Models Act as Ensembler for Multi-GNNs?

EMNLP 2025

Graph Neural Networks (GNNs) have emerged as powerful models for learning from graph-structured data. However, GNNs lack the inherent semantic understanding capability of rich textual node attributes, limiting their effectiveness in applications. On the other hand, we empirically observe that for ex

2025

D3: Diversity, Difficulty, and Dependability-Aware Data Selection for Sample-Efficient LLM Instruction Tuning

IJCAI 2025

Recent advancements in instruction tuning for large language models (LLMs) suggest that a small, high-quality dataset can significantly equip LLMs with instruction-following capabilities, outperforming large datasets often burdened by quality and redundancy issues. However, the challenge lies in aut

Cited by 0SourcePDFScholar
2025

Enhancing LLM-based Hatred and Toxicity Detection with Meta-Toxic Knowledge Graph

ACL 2025finding

The rapid growth of social media platforms has raised significant concerns regarding online content toxicity. When Large Language Models (LLMs) are used for toxicity detection, two key challenges emerge: 1) the absence of domain-specific toxicity knowledge leads to false negatives; 2) the excessive…

2025

GEMS: Generation-Based Event Argument Extraction via Multi-perspective Prompts and Ontology Steering

ACL 2025finding

Generative methods significantly advance event argument extraction by probabilistically generating event argument sequences in a structured format. However, existing approaches primarily rely on a single prompt to generate event arguments in a fixed, predetermined order. Such a rigid approach overlo…

2025

Invisible Prompts, Visible Threats: Malicious Font Injection in External Resources for Large Language Models

EMNLP 2025

Large Language Models (LLMs) are increasingly equipped with capabilities of real-time web search and integrated with protocols like the Model Context Protocol (MCP). This extension could introduce new security vulnerabilities. We present a systematic investigation of LLM vulnerabilities to hidden ad

2025

MuRL-DTI: A Multimodal Feature Fusion Reinforcement Learning Approach for Cold Start in Drug-Target Interactions

ICASSP 2025accepted

Drug Target Interaction (DTI) focuses on exploring the interactions between specific drug molecules and their biological targets to assess the efficacy and safety of drugs. Significant advancements have been made in integrating computational techniques compared to traditional approaches, including m…

Cited by 0SourceScholar
2025

SCE: Semantic Consistency Enhanced Reinforcement Learning for Multi-Hop Knowledge Graph Reasoning

EMNLP 2025

Multi-hop reasoning with reinforcement learning has proven effective in discovering inference paths in incomplete knowledge graphs. However, a major challenge remains: spurious paths (incorrect reasoning paths that accidentally lead to correct answers) often arise due to reward mechanisms that prior

Cited by 0SourcePDFScholar
2025

Weakly-supervised VLM-guided Partial Contrastive Learning for Visual Language Navigation

IROS 2025

Visual Language Navigation (VLN) is a fundamental task within the field of Embodied AI, focusing on the ability of agents to navigate complex environments based on natural language instructions. Despite the progress made by existing methods, these methods often present some common challenges. First,

Cited by 5SourceScholar
2025

WebAgent-R1: Training Web Agents via End-to-End Multi-Turn Reinforcement Learning

EMNLP 2025

While reinforcement learning (RL) has demonstrated remarkable success in enhancing large language models (LLMs), it has primarily focused on single-turn tasks such as solving math problems. Training effective web agents for multi-turn interactions remains challenging due to the complexity of long-ho

2024

Cognitive Bias in Decision-Making with LLMs

EMNLP 2024finding

Large language models (LLMs) offer significant potential as tools to support an expanding range of decision-making tasks. Given their training on human (created) data, LLMs have been shown to inherit societal biases against protected groups, as well as be subject to bias functionally resembling cogn…

Cited by 22SourcePDFScholar
2024

EXTRACT: Efficient Policy Learning by Extracting Transferable Robot Skills from Offline Data

CoRL 2024poster

Most reinforcement learning (RL) methods focus on learning optimal policies over low-level action spaces. While these methods can perform well in their training environments, they lack the flexibility to transfer to new tasks. Instead, RL agents that can act over useful, temporally extended skills…

Cited by 2SourceScholar
2024

Heuristic-Driven, Type-Specific Embedding in Parallel Spaces for Enhancing Knowledge Graph Reasoning

ICASSP 2024accepted

Knowledge Graph Reasoning aims to derive new insights from existing Knowledge Graphs (KGs) and address any missing or incomplete data. Existing models primarily rely on explicit information while neglecting the implicit constraints imposed by entity types on relations types. For example, when the en…

Cited by 0SourceScholar
2024

InstructGraph: Boosting Large Language Models via Graph-centric Instruction Tuning and Preference Alignment

ACL 2024findings

Do current large language models (LLMs) better solve graph reasoning and generation tasks with parameter updates? In this paper, we propose InstructGraph, a framework that empowers LLMs with the abilities of graph reasoning and generation by instruction tuning and preference alignment. Specifically,…

2024

TAIL: Task-specific Adapters for Imitation Learning with Large Pretrained Models

ICLR 2024poster

The full potential of large pretrained models remains largely untapped in control domains like robotics. This is mainly because of the scarcity of data and the computational challenges associated with training or fine-tuning these large models for such applications. Prior work mainly emphasizes eith…

Cited by 24SourcePDFScholar
2024

Texture-Unet: A Texture-Aware Network for Bone Marrow Smear Whole-Slide Image Region of Interest Segmentation

ICASSP 2024accepted

Bone marrow smear cytology involves observing and analyzing the morphological features of bone marrow cells, and identifying regions of interest (ROI) where the cells are morphologically clear and evenly distributed is a crucial part of this process. However, existing deep learning methods for selec…

Cited by 0SourceScholar
2024

patchDPCC: A Patchwise Deep Compression Framework for Dynamic Point Clouds

AAAI 2024technical

When compressing point clouds, point-based deep learning models operate points in a continuous space, which has a chance to minimize the geometric fidelity loss introduced by voxelization in preprocessing. But these methods could hardly scale to inputs with arbitrary points. Furthermore, the point c…

2023

MedEval: A Multi-Level, Multi-Task, and Multi-Domain Medical Benchmark for Language Model Evaluation

EMNLP 2023long main

Curated datasets for healthcare are often limited due to the need of human annotations from experts. In this paper, we present MedEval, a multi-level, multi-task, and multi-domain medical benchmark to facilitate the development of language models for healthcare. MedEval is comprehensive and consists…

Cited by 0SourceScholar
2023

TD Convergence: An Optimization Perspective

NeurIPS 2023poster

We study the convergence behavior of the celebrated temporal-difference (TD) learning algorithm. By looking at the algorithm through the lens of optimization, we first argue that TD can be viewed as an iterative optimization algorithm where the function to be minimized changes per iteration. By care…

Cited by 8SourcePDFScholar
2022

Generalized Federated Learning via Sharpness Aware Minimization

ICML 2022spotlight

Federated Learning (FL) is a promising framework for performing privacy-preserving, distributed learning with a set of clients. However, the data distribution among clients often exhibits non-IID, i.e., distribution shift, which makes efficient optimization difficult. To tackle this problem, many FL…

Cited by 182SourcePDFScholar
2022

Provably sample-efficient RL with side information about latent dynamics

NeurIPS 2022accept

We study reinforcement learning (RL) in settings where observations are high-dimensional, but where an RL agent has access to abstract knowledge about the structure of the state space, as is the case, for example, when a robot is tasked to go to a specific room in a building using observations from…

Cited by 2SourcePDFScholar
2021

Asynchronous Teacher Guided Bit-wise Hard Mining for Online Hashing

AAAI 2021technical

Online hashing for streaming data has attracted increasing attention recently. However, most existing algorithms focus on batch inputs and instance-balanced optimization, which is limited in the single datum input case and does not match the dynamic training in online hashing. Furthermore, constantl…

Cited by 9SourcePDFScholar
2021

Learning to Guide Human Attention on Mobile Telepresence Robots with 360° Vision

IROS 2021poster

Mobile telepresence robots (MTRs) allow people to navigate and interact with a remote environment that is in a place other than the person’s true location. Thanks to the recent advances in 360° vision, many MTRs are now equipped with an all-degree visual perception capability. However, people’s visu…

Cited by 11SourceScholar
2020

Interpretable Off-Policy Evaluation in Reinforcement Learning by Highlighting Influential Transitions

ICML 2020poster

Off-policy evaluation in reinforcement learning offers the chance of using observational data to improve future outcomes in domains such as healthcare and education, but safe deployment in high stakes settings requires ways of assessing its validity. Traditional measures such as confidence intervals…

2020

Provably Good Batch Off-Policy Reinforcement Learning Without Great Exploration

NeurIPS 2020poster

Batch reinforcement learning (RL) is important to apply RL algorithms to many high stakes tasks. Doing batch RL in a way that yields a reliable new policy in large domains is challenging: a new decision policy may visit states and actions outside the support of the batch data, and function approxima…

Cited by 246SourcePDFScholar
2020

Understanding the Curse of Horizon in Off-Policy Evaluation via Conditional Importance Sampling

ICML 2020poster

Off-policy policy estimators that use importance sampling (IS) can suffer from high variance in long-horizon domains, and there has been particular excitement over new IS methods that leverage the structure of Markov decision processes. We analyze the variance of the most popular approaches through…

Cited by 47SourcePDFScholar
2019

Combining parametric and nonparametric models for off-policy evaluation

ICML 2019oral

We consider a model-based approach to perform batch off-policy evaluation in reinforcement learning. Our method takes a mixture-of-experts approach to combine parametric and non-parametric models of the environment such that the final value estimate has the least expected error. We do so by first es…

Cited by 40SourcePDFScholar
2019

Off-Policy Policy Gradient with Stationary Distribution Correction

UAI 2019poster

We study the problem of off-policy policy optimization in Markov decision processes, and develop a novel off-policy policy gradient method. Prior off-policy policy gradient approaches have generally ignored the mismatch between the distribution of states visited under the behavior policy used to col…

Cited by 38SourcePDFScholar
2018

Representation Balancing MDPs for Off-policy Policy Evaluation

NeurIPS 2018poster

We study the problem of off-policy policy evaluation (OPPE) in RL. In contrast to prior work, we consider how to estimate both the individual policy value and average policy value accurately. We draw inspiration from recent work in causal reasoning, and propose a new finite sample generalization err…

Cited by 87SourcePDFScholar