Demo Data from EDBT 2026 / reviewers in the wild / expert
Xuanting Cai
dblp:127/6396
· DBLP profile ↗
4ranked-venue papers
0as first author
4since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 4 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
3 papers |
Trustworthy machine learning · 86% Representation and self-supervised learning · 14% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
interpretability |
2.0 | 3 | 2024 | TVE: Learning Meta-attribution for Transferable Vision Explainer · ICML 2024 CoRTX: Contrastive Framework for Real-time Explanation · ICLR 2023 Accelerating Shapley Explanation via Contributive Cooperator Selection · ICML 2022 |
Machine learning › Trustworthy machine learning › interpretability
model explanation |
0.8 | 1 | 2024 | TVE: Learning Meta-attribution for Transferable Vision Explainer · ICML 2024 |
Machine learning › Representation and self-supervised learning
contrastive learning |
0.7 | 1 | 2023 | CoRTX: Contrastive Framework for Real-time Explanation · ICLR 2023 |
Machine learning › Trustworthy machine learning › interpretability › attribution methods
feature attribution |
0.6 | 1 | 2022 | Accelerating Shapley Explanation via Contributive Cooperator Selection · ICML 2022 |
Machine learning › Trustworthy machine learning › interpretability › shapley value
shapley value explanation |
0.6 | 1 | 2022 | Accelerating Shapley Explanation via Contributive Cooperator Selection · ICML 2022 |
Machine learning › Trustworthy machine learning › neural network interpretability
vision model explanation |
0.2 | 1 | 2024 | TVE: Learning Meta-attribution for Transferable Vision Explainer · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
pre-training · 0.8meta-attribution · 0.8contrastive learning · 0.7shapley value · 0.6coalition selection · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | TVE: Learning Meta-attribution for Transferable Vision ExplainerabstractExplainable machine learning significantly improves the transparency of deep neural networks. However, existing work is constrained to explaining the behavior of individual model predictions, and lacks the ability to transfer the explanation across various models and tasks. This limitation results in explaining various tasks being time- and resource-consuming. To address this problem, we introduce a Transferable Vision Explainer (TVE) that can effectively explain various vision models in downstream tasks. Specifically, the transferability of TVE is realized through a pre-training process on large-scale datasets towards learning the meta-attribution. This meta-attribution leverages the versatility of generic backbone encoders to comprehensively encode the attribution knowledge for the input instance, which enables TVE to seamlessly transfer to explaining various downstream tasks, without the need for training on task-specific data. Empirical studies involve explaining three different architectures of vision models across three diverse downstream datasets. The experiment results indicate TVE is effective in explaining these tasks without the need for additional training on downstream data. Guanchu Wang, Yu-Neng Chuang, Fan Yang 0023, Mengnan Du, Chia-Yuan Chang 0002, Shaochen Zhong, Zirui Liu 0001, Zhaozhuo Xu, Kaixiong Zhou, Xuanting Cai, Xia Ben Hu |
ICML | 10 |
| 2023 | CoRTX: Contrastive Framework for Real-time Explanation
Yu-Neng Chuang, Guanchu Wang, Fan Yang 0023, Pushkar Tripathi, Xuanting Cai, Xia Ben Hu |
ICLR | 6 |
| 2022 | BED: A Real-Time Object Detection System for Edge DevicesabstractDeploying deep neural networks (DNNs) on edge devices provides efficient and effective solutions for the real-world tasks. Edge devices have been used for collecting a large volume of data efficiently in different domains. DNNs have been an effective tool for data processing and analysis. However, designing DNNs on edge devices is challenging due to the limited computational resources and memory. To tackle this challenge, we demonstrate oBject detection system for Edge Devices (BED) on the MAX78000 DNN accelerator. It integrates on-device DNN inference with a camera and an LCD display for image acquisition and detection exhibition, respectively. BED is a concise, effective and detailed solution, including model training, quantization, synthesis and deployment. The entire repository is open-sourced on Github1, including a Graphical User Interface (GUI) for on-chip debugging. Experiment results indicate that BED can produce accurate detection with a 300-KB tiny DNN model, which takes only 91.9 ms of inference time and 1.845 mJ of energy. The real-time detection is available at YouTube. Guanchu Wang, Zaid Pervaiz Bhat, Zhimeng Jiang, Yi-Wei Chen, Daochen Zha, Alfredo Costilla-Reyes, Afshin Niktash, Mehmet Görkem Ulkar, Osman Erman Okman, Xuanting Cai, Xia Ben Hu |
CIKM | 10 |
| 2022 | Accelerating Shapley Explanation via Contributive Cooperator SelectionabstractEven though Shapley value provides an effective explanation for a DNN model prediction, the computation relies on the enumeration of all possible input feature coalitions, which leads to the exponentially growing complexity. To address this problem, we propose a novel method SHEAR to significantly accelerate the Shapley explanation for DNN models, where only a few coalitions of input features are involved in the computation. The selection of the feature coalitions follows our proposed Shapley chain rule to minimize the absolute error from the ground-truth Shapley values, such that the computation can be both efficient and accurate. To demonstrate the effectiveness, we comprehensively evaluate SHEAR across multiple metrics including the absolute error from the ground-truth Shapley value, the faithfulness of the explanations, and running speed. The experimental results indicate SHEAR consistently outperforms state-of-the-art baseline methods across different evaluation metrics, which demonstrates its potentials in real-world applications where the computational resource is limited. Guanchu Wang, Yu-Neng Chuang, Mengnan Du, Fan Yang 0023, Pushkar Tripathi, Xuanting Cai, Xia Ben Hu |
ICML | 7 |