Skip to content

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Open access Aug 2026

Trustworthy LLM-Based Agents for Data-Centric AI

Large language model (LLM) based agents are evolving from conversational chatbots into autonomous decision-makers that plan, reason, wield tools, and collaborate across high-stakes domains such as healthcare, finance, and scientific discovery. Yet this power brings a fundamental challenge: trustworthiness. How can we guarantee that an agent remains robust when real-world data shifts, degrades, or is deliberately poisoned? What defenses exist against memory injection, tool-based exploits, or cascade failures in multi-agent systems? Can we embed domain-specific causal validity, clinical safety, or fairness directly into agent reasoning? And how do we measure trust when it spans robustness, security, reliability, and alignment — each with its own irreconcilable trade-offs? This tutorial delivers a systematic, data-centric roadmap to build LLM agents that are not merely capable but provably trustworthy. We organize the landscape into four interconnected pillars: (i) generalizability under distribution shift, noise, and adversarial inputs; (ii) security architectures that defend against emerging threats — from indirect prompt injection to supply-chain vulnerabilities; (iii) domain-grounded trust in science, engineering, medicine, and commerce, where agents must respect theories, systems, clinical causality, and fairness constraints; and (iv) multi-dimensional evaluation benchmarks that expose trade-offs rather than collapsing them into a single score. By unifying advances in LLM agents, robust machine learning, and data-centric AI, we equip the audience with both foundational principles and actionable recipes to design, deploy, and ultimately trust the next generation of autonomous agent systems.

Tianlong Chen, Jian Pei, Minxing Zhang et al. · 0 citations
Book Open access Aug 2026

Counterfactual Analysis on Large Graphs

Counterfactual analysis aims to identify minimal and semantically meaningful changes that alter a model's prediction. Existing perturbation approaches generate counterfactuals by directly editing nodes, edges, or attributes, often producing explanations that are model-dependent and detached from the underlying data distribution. In this paper, we introduce Counterfactual Subgraph Retrieval (CF-SGR), a dataset-grounded formulation that retrieves from a large graph subgraphs that are structurally and semantically similar to a query but induce different predictions under the same model, yielding domain-valid and verifiable counterfactual explanations. To solve CF-SGR, we propose Concept-guided Counterfactual Subgraph Retrieval (CCSGR), which operates in a shared multi-scale graph concept space aligned with a trained GNN and replaces fine-grained node-level edits with concept-level reasoning. CCSGR performs retrieval via concept-based filtering, robustness-aware ranking, and diversity-aware selection, enabling scalable and non-redundant search over large graphs. We provide theoretical guarantees on correctness, robustness, and efficiency and demonstrate that CCSGR improves retrieval quality by up to 40% while achieving speedups of 20× on large-scale graphs across six real-world datasets spanning five domains.

Hsi-Wen Chen, Jian Pei, De-Nian Yang et al. · 0 citations