Xuanxiang Huang

Orcid: 0000-0002-3722-7191

According to our database1, Xuanxiang Huang authored at least 32 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Feature Necessity and Relevancy in Machine Learning Explanations.
J. Autom. Reason., June, 2026

Towards Rigorous Explainability by Feature Attribution.
CoRR, April, 2026

A Parallel Approach to Counting Exact Covers Based on Decomposability Property.
CoRR, April, 2026

Rigorous Explanations for Tree Ensembles.
CoRR, March, 2026

Unifying Formal Explanations: A Complexity-Theoretic Perspective.
CoRR, February, 2026

2025
Uncovering Bugs in Formal Explainers: A Case Study with PyXAI.
CoRR, November, 2025

Rigorous Feature Importance Scores based on Shapley Value and Banzhaf Index.
CoRR, August, 2025

The Explanation Game - Rekindled (Extended Version).
CoRR, January, 2025

Towards Trustable SHAP Scores.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
Explainability Is <i>Not</i> a Game.
Commun. ACM, July, 2024

On the failings of Shapley values for explainability.
Int. J. Approx. Reason., 2024

SHAP scores fail pervasively even when Lipschitz succeeds.
CoRR, 2024

From SHAP Scores to Feature Importance Scores.
CoRR, 2024

On Correcting SHAP Scores.
CoRR, 2024

Distance-Restricted Explanations: Theoretical Underpinnings & Efficient Implementation.
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning, 2024

Updates on the Complexity of SHAP Scores.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
On computing probabilistic abductive explanations.
Int. J. Approx. Reason., August, 2023

Recent advances in formal explainability. (Progrès récents en matière d'explicabilité formelle).
PhD thesis, 2023

Refutation of Shapley Values for XAI - Additional Evidence.
CoRR, 2023

A Refutation of Shapley Values for Explainability.
CoRR, 2023

Explainability is NOT a Game.
CoRR, 2023

From Robustness to Explainability and Back Again.
CoRR, 2023

The Inadequacy of Shapley Values for Explainability.
CoRR, 2023

Feature Necessity & Relevancy in ML Classifier Explanations.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

From Decision Trees to Explained Decision Sets.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Solving Explainability Queries with Quantification: The Case of Feature Relevancy.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
On Deciding Feature Membership in Explanations of SDD & Related Classifiers.
CoRR, 2022

Tractable Explanations for d-DNNF Classifiers.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Efficient Explanations for Knowledge Compilation Languages.
CoRR, 2021

On Efficiently Explaining Graph-Based Classifiers.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

2020
Dynamic Minimization of Bi-Kronecker Functional Decision Diagrams.
Proceedings of the IEEE/ACM International Conference On Computer Aided Design, 2020

2019
Bi-Kronecker Functional Decision Diagrams: A Novel Canonical Representation of Boolean Functions.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019


  Loading...