Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Explainable AI in education: Current trends, challenges, and opportunities
A Rachha, M Seyam - SoutheastCon 2023, 2023 - ieeexplore.ieee.org
Explainable Artificial Intelligence (XAI) has garnered significant attention in recent years to
increase the transparency of AI models and systems and aid in decision-making. This is …
increase the transparency of AI models and systems and aid in decision-making. This is …
On the tractability of SHAP explanations
SHAP explanations are a popular feature-attribution mechanism for explainable AI. They
use game-theoretic notions to measure the influence of individual features on the prediction …
use game-theoretic notions to measure the influence of individual features on the prediction …
Cxplain: Causal explanations for model interpretation under uncertainty
Feature importance estimates that inform users about the degree to which given inputs
influence the output of a predictive model are crucial for understanding, validating, and …
influence the output of a predictive model are crucial for understanding, validating, and …
Einsum networks: Fast and scalable learning of tractable probabilistic circuits
Probabilistic circuits (PCs) are a promising avenue for probabilistic modeling, as they permit
a wide range of exact and efficient inference routines. Recent “deep-learning-style” …
a wide range of exact and efficient inference routines. Recent “deep-learning-style” …
Cleanml: A study for evaluating the impact of data cleaning on ml classification tasks
Data quality affects machine learning (ML) model performances, and data scientists spend
considerable amount of time on data cleaning before model training. However, to date, there …
considerable amount of time on data cleaning before model training. However, to date, there …
A compositional atlas of tractable circuit operations for probabilistic inference
Circuit representations are becoming the lingua franca to express and reason about
tractable generative and discriminative models. In this paper, we show how complex …
tractable generative and discriminative models. In this paper, we show how complex …
The computational complexity of understanding binary classifier decisions
S Wäldchen, J Macdonald, S Hauch… - Journal of Artificial …, 2021 - jair.org
For a d-ary Boolean function Φ:{0, 1} d→{0, 1} and an assignment to its variables x=(x 1, x
2,..., xd) we consider the problem of finding those subsets of the variables that are sufficient …
2,..., xd) we consider the problem of finding those subsets of the variables that are sufficient …
Nearest neighbor classifiers over incomplete information: From certain answers to certain predictions
Machine learning (ML) applications have been thriving recently, largely attributed to the
increasing availability of data. However, inconsistency and incomplete information are …
increasing availability of data. However, inconsistency and incomplete information are …
On tractable computation of expected predictions
Computing expected predictions of discriminative models is a fundamental task in machine
learning that appears in many interesting applications such as fairness, handling missing …
learning that appears in many interesting applications such as fairness, handling missing …
GPkit: A human-centered approach to convex optimization in engineering design
We present GPkit, a Python toolkit for Geometric and Signomial Programming that prioritizes
explainability and incremental complexity. GPkit was designed through an ethnographic …
explainability and incremental complexity. GPkit was designed through an ethnographic …