← Search

William Yeoh

11 accepted papers

2026

On Generating Monolithic and Model Reconciling Explanations in Probabilistic Scenarios (Abstract Reprint)

AAAI 2026technical

Explanation generation frameworks aim to make AI systems’ decisions transparent and understandable to human users. However, generating explanations in uncertain environments characterized by incomplete information and probabilistic models remains a significant challenge. In this paper, we propose a

Cited by 0SourcePDFScholar
2025

Does Your AI Agent Get You? A Personalizable Framework for Approximating Human Models from Argumentation-based Dialogue Traces

AAAI 2025technical

Explainable AI is increasingly employing argumentation methods to facilitate interactive explanations between AI agents and human users. While existing approaches typically rely on predetermined human user models, there remains a critical gap in dynamically learning and updating these models during…

2025

EcoLoRA: Communication-Efficient Federated Fine-Tuning of Large Language Models

EMNLP 2025

To address data locality and privacy restrictions, Federated Learning (FL) has recently been adopted to fine-tune large language models (LLMs), enabling improved performance on various downstream tasks without requiring aggregated data. However, the repeated exchange of model updates in FL can resul

Cited by 0SourcePDFScholar
2025

Model Reconciliation via Cost-Optimal Explanations in Probabilistic Logic Programming

NeurIPS 2025poster

In human-AI interaction, effective communication relies on aligning the AI agent’s model with the human user’s mental model -- a process known as model reconciliation. However, existing model reconciliation approaches predominantly assume deterministic models, overlooking the fact that human knowled…

Cited by 0SourceScholar
2025

TRACE-CS: A Synergistic Approach to Explainable Course Scheduling Using LLMs and Logic

AAAI 2025technical

We present TRACE-cs, a novel hybrid system that combines symbolic reasoning with large language models (LLMs) to address contrastive queries in scheduling problems. TRACE-cs leverages SAT solving techniques to encode scheduling constraints and generate explanations for user queries, while utilizing…

2024

Theoretical Study on Multi-objective Heuristic Search

IJCAI 2024poster

This paper provides a theoretical study on Multi-Objective Heuristic Search. We first classify states in the state space into must-expand, maybe-expand, and never-expand states and then transfer these definitions to nodes in the search tree. We then formalize a framework that generalizes A* to Multi…

Cited by 0SourcePDFScholar
2023

A Logic-based Explanation Generation Framework for Classical and Hybrid Planning Problems (Extended Abstract)

IJCAI 2023poster

In human-aware planning systems, a planning agent might need to explain its plan to a human user when that plan appears to be non-feasible or sub-optimal. A popular approach, called model reconciliation, has been proposed as a way to bring the model of the human user closer to the agent's model. In…

2023

Multi-objective Search via Lazy and Efficient Dominance Checks

IJCAI 2023poster

Multi-objective search can be used to model many real-world problems that require finding Pareto optimal paths from a specified start state to a specified goal state, while considering different costmetrics such as distance, time, and fuel. The performance of multi-objective search can be improved b…

Cited by 12SourcePDFScholar
2021

On Exploiting Hitting Sets for Model Reconciliation

AAAI 2021technical

In human-aware planning, a planning agent may need to provide an explanation to a human user on why its plan is optimal. A popular approach to do this is called model reconciliation, where the agent tries to reconcile the differences in its model and the human's model such that the plan is also opti…

2020

To Ask or Not to Ask: A User Annoyance Aware Preference Elicitation Framework for Social Robots

IROS 2020poster

In this paper we investigate how social robots can efficiently gather user preferences without exceeding the allowed user annoyance threshold. To do so, we use a Gazebo based simulated office environment with a TIAGo Steel robot. We then formulate the user annoyance aware preference elicitation prob…

Cited by 6SourceScholar