đŸȘŽ Anil's Garden

Explainable artificial intelligence - Wikipedia

02 Apr 202537 min read

Explainable artificial intelligence - Wikipedia

Excerpt

Explainable AI (XAI), often overlapping with interpretable AI, or explainable machine learning (XML), either refers to an artificial intelligence (AI) system over which it is possible for humans to retain intellectual oversight, or refers to the methods to achieve this.[1][2] The main focus is usually on the reasoning behind the decisions or predictions made by the AI[3] which are made more understandable and transparent.[4] This has been brought up again as a topic of active research as users now need to know the safety and explain what automated decision making is in different applications.[5] XAI counters the “black box” tendency of machine learning, where even the AI’s designers cannot explain why it arrived at a specific decision.[6][7]

Explainable AI (XAI), often overlapping with interpretable AI, or explainable machine learning (XML), either refers to an artificial intelligence (AI) system over which it is possible for humans to retain intellectual oversight, or refers to the methods to achieve this.[1][2] The main focus is usually on the reasoning behind the decisions or predictions made by the AI[3] which are made more understandable and transparent.[4] This has been brought up again as a topic of active research as users now need to know the safety and explain what automated decision making is in different applications.[5] XAI counters the “black box” tendency of machine learning, where even the AI’s designers cannot explain why it arrived at a specific decision.[6][7]

XAI hopes to help users of AI-powered systems perform more effectively by improving their understanding of how those systems reason.[8] XAI may be an implementation of the social right to explanation.[9] Even if there is no such legal right or regulatory requirement, XAI can improve the user experience of a product or service by helping end users trust that the AI is making good decisions.[10] XAI aims to explain what has been done, what is being done, and what will be done next, and to unveil which information these actions are based on.[11] This makes it possible to confirm existing knowledge, challenge existing knowledge, and generate new assumptions.[12]

Machine learning (ML) algorithms used in AI can be categorized as white-box or black-box.[13] White-box models provide results that are understandable to experts in the domain. Black-box models, on the other hand, are extremely hard to explain and may not be understood even by domain experts.[14] XAI algorithms follow the three principles of transparency, interpretability, and explainability. A model is transparent “if the processes that extract model parameters from training data and generate labels from testing data can be described and motivated by the approach designer.”[15] Interpretability describes the possibility of comprehending the ML model and presenting the underlying basis for decision-making in a way that is understandable to humans.[16][17][18] Explainability is a concept that is recognized as important, but a consensus definition is not yet available;[15] one possibility is “the collection of features of the interpretable domain that have contributed, for a given example, to producing a decision (e.g., classification or regression)“.[19] In summary, Interpretability refers to the user’s ability to understand model outputs, while Model Transparency includes Simulatability (reproducibility of predictions), Decomposability (intuitive explanations for parameters), and Algorithmic Transparency (explaining how algorithms work). Model Functionality focuses on textual descriptions, visualization, and local explanations, which clarify specific outputs or instances rather than entire models. All these concepts aim to enhance the comprehensibility and usability of AI systems.[20] If algorithms fulfill these principles, they provide a basis for justifying decisions, tracking them and thereby verifying them, improving the algorithms, and exploring new facts.[21]

Sometimes it is also possible to achieve a high-accuracy result with white-box ML algorithms. These algorithms have an interpretable structure that can be used to explain predictions.[22] Concept Bottleneck Models, which use concept-level abstractions to explain model reasoning, are examples of this and can be applied in both image[23] and text[24] prediction tasks. This is especially important in domains like medicine, defense, finance, and law, where it is crucial to understand decisions and build trust in the algorithms.[11] Many researchers argue that, at least for supervised machine learning, the way forward is symbolic regression, where the algorithm searches the space of mathematical expressions to find the model that best fits a given dataset.[25][26][27]

AI systems optimize behavior to satisfy a mathematically specified goal system chosen by the system designers, such as the command “maximize the accuracy of assessing how positive film reviews are in the test dataset.” The AI may learn useful general rules from the test set, such as “reviews containing the word “horrible” are likely to be negative.” However, it may also learn inappropriate rules, such as “reviews containing ‘Daniel Day-Lewis’ are usually positive”; such rules may be undesirable if they are likely to fail to generalize outside the training set, or if people consider the rule to be “cheating” or “unfair.” A human can audit rules in an XAI to get an idea of how likely the system is to generalize to future real-world data outside the test set.[28]

Cooperation between agents – in this case, algorithms and humans – depends on trust. If humans are to accept algorithmic prescriptions, they need to trust them. Incompleteness in formal trust criteria is a barrier to optimization. Transparency, interpretability, and explainability are intermediate goals on the road to these more comprehensive trust criteria.[29] This is particularly relevant in medicine,[30] especially with clinical decision support systems (CDSS), in which medical professionals should be able to understand how and why a machine-based decision was made in order to trust the decision and augment their decision-making process.[31]

AI systems sometimes learn undesirable tricks that do an optimal job of satisfying explicit pre-programmed goals on the training data but do not reflect the more nuanced implicit desires of the human system designers or the full complexity of the domain data. For example, a 2017 system tasked with image recognition learned to “cheat” by looking for a copyright tag that happened to be associated with horse pictures rather than learning how to tell if a horse was actually pictured.[7] In another 2017 system, a supervised learning AI tasked with grasping items in a virtual world learned to cheat by placing its manipulator between the object and the viewer in a way such that it falsely appeared to be grasping the object.[32][33]

One transparency project, the DARPA XAI program, aims to produce “glass box” models that are explainable to a “human-in-the-loop” without greatly sacrificing AI performance. Human users of such a system can understand the AI’s cognition (both in real-time and after the fact) and can determine whether to trust the AI.[34] Other applications of XAI are knowledge extraction from black-box models and model comparisons.[35] In the context of monitoring systems for ethical and socio-legal compliance, the term “glass box” is commonly used to refer to tools that track the inputs and outputs of the system in question, and provide value-based explanations for their behavior. These tools aim to ensure that the system operates in accordance with ethical and legal standards, and that its decision-making processes are transparent and accountable. The term “glass box” is often used in contrast to “black box” systems, which lack transparency and can be more difficult to monitor and regulate.[36] The term is also used to name a voice assistant that produces counterfactual statements as explanations.[37]

Explainability and interpretability techniques

[edit]

There is a subtle difference between the terms explainability and interpretability in the context of AI.[38]

TermDefinitionSource
Interpretability”level of understanding how the underlying (AI) technology works”ISO/IEC TR 29119-11:2020(en), 3.1.42[39]
Explainability”level of understanding how the AI-based system 
 came up with a given result”ISO/IEC TR 29119-11:2020(en), 3.1.31[39]

Some explainability techniques don’t involve understanding how the model works, and may work across various AI systems. Treating the model as a black box and analyzing how marginal changes to the inputs affect the result sometimes provides a sufficient explanation.

Explainability is useful for ensuring that AI models are not making decisions based on irrelevant or otherwise unfair criteria. For classification and regression models, several popular techniques exist:

  • Partial dependency plots show the marginal effect of an input feature on the predicted outcome.
  • SHAP (SHapley Additive exPlanations) enables visualization of the contribution of each input feature to the output. It works by calculating Shapley values, which measure the average marginal contribution of a feature across all possible combinations of features.[40]
  • Feature importance estimates how important a feature is for the model. It is usually done using permutation importance, which measures the performance decrease when it the feature value randomly shuffled across all samples.
  • LIME approximates locally a model’s outputs with a simpler, interpretable model.[41]
  • Multitask learning provides a large number of outputs in addition to the target classification. These other outputs can help developers deduce what the network has learned.[42]

For images, saliency maps highlight the parts of an image that most influenced the result.[43]

Systems that are expert or knowledge based are software systems that are made my experts. This system consists of a knowledge based encoding for the domain knowledge. This system is usually modeled as production rules, and someone uses this knowledge base which the user can question the system for knowledge. In expert systems, the language and explanations are understood with an explanation for the reasoning or a problem solving activity.[44]

However, these techniques are not very suitable for language models like generative pretrained transformers. Since these models generate language, they can provide an explanation, but which may not be reliable. Other techniques include attention analysis (examining how the model focuses on different parts of the input), probing methods (testing what information is captured in the model’s representations), causal tracing (tracing the flow of information through the model) and circuit discovery (identifying specific subnetworks responsible for certain behaviors). Explainability research in this area overlaps significantly with interpretability and alignment research.[45]

Scholars sometimes use the term “mechanistic interpretability” to refer to the process of reverse-engineering artificial neural networks to understand their internal decision-making mechanisms and components, similar to how one might analyze a complex machine or computer program.[46]

Interpretability research often focuses on generative pretrained transformers. It is particularly relevant for AI safety and alignment, as it may enable to identify signs of undesired behaviors such as sycophancy, deceptiveness or bias, and to better steer AI models.[47]

Studying the interpretability of the most advanced foundation models often involves searching for an automated way to identify “features” in generative pretrained transformers. In a neural network, a feature is a pattern of neuron activations that corresponds to a concept. A compute-intensive technique called “dictionary learning” makes it possible to identify features to some degree. Enhancing the ability to identify and edit features is expected to significantly improve the safety of frontier AI models.[48][49]

For convolutional neural networks, DeepDream can generate images that strongly activate a particular neuron, providing a visual hint about what the neuron is trained to identify.[50]

History and methods

[edit]

During the 1970s to 1990s, symbolic reasoning systems, such as MYCIN,[51] GUIDON,[52] SOPHIE,[53] and PROTOS[54][55] could represent, reason about, and explain their reasoning for diagnostic, instructional, or machine-learning (explanation-based learning) purposes. MYCIN, developed in the early 1970s as a research prototype for diagnosing bacteremia infections of the bloodstream, could explain[56] which of its hand-coded rules contributed to a diagnosis in a specific case. Research in intelligent tutoring systems resulted in developing systems such as SOPHIE that could act as an “articulate expert”, explaining problem-solving strategy at a level the student could understand, so they would know what action to take next. For instance, SOPHIE could explain the qualitative reasoning behind its electronics troubleshooting, even though it ultimately relied on the SPICE circuit simulator. Similarly, GUIDON added tutorial rules to supplement MYCIN’s domain-level rules so it could explain the strategy for medical diagnosis. Symbolic approaches to machine learning relying on explanation-based learning, such as PROTOS, made use of explicit representations of explanations expressed in a dedicated explanation language, both to explain their actions and to acquire new knowledge.[55]

In the 1980s through the early 1990s, truth maintenance systems (TMS) extended the capabilities of causal-reasoning, rule-based, and logic-based inference systems.[57]: 360–362   A TMS explicitly tracks alternate lines of reasoning, justifications for conclusions, and lines of reasoning that lead to contradictions, allowing future reasoning to avoid these dead ends. To provide an explanation, they trace reasoning from conclusions to assumptions through rule operations or logical inferences, allowing explanations to be generated from the reasoning traces. As an example, consider a rule-based problem solver with just a few rules about Socrates that concludes he has died from poison:

By just tracing through the dependency structure the problem solver can construct the following explanation: “Socrates died because he was mortal and drank poison, and all mortals die when they drink poison. Socrates was mortal because he was a man and all men are mortal. Socrates drank poison because he held dissident beliefs, the government was conservative, and those holding conservative dissident beliefs under conservative governments must drink poison.”[58]: 164–165  

By the 1990s researchers began studying whether it is possible to meaningfully extract the non-hand-coded rules being generated by opaque trained neural networks.[59] Researchers in clinical expert systems creating[clarification needed] neural network-powered decision support for clinicians sought to develop dynamic explanations that allow these technologies to be more trusted and trustworthy in practice.[9] In the 2010s public concerns about racial and other bias in the use of AI for criminal sentencing decisions and findings of creditworthiness may have led to increased demand for transparent artificial intelligence.[7] As a result, many academics and organizations are developing tools to help detect bias in their systems.[60]

Marvin Minsky et al. raised the issue that AI can function as a form of surveillance, with the biases inherent in surveillance, suggesting HI (Humanistic Intelligence) as a way to create a more fair and balanced “human-in-the-loop” AI.[61]

Explainable AI has been recently a new topic researched amongst the context of modern deep learning. Modern complex AI techniques, such as deep learning, are naturally opaque.[62] To address this issue, methods have been developed to make new models more explainable and interpretable.[63][17][16][64][65][66] This includes layerwise relevance propagation (LRP), a technique for determining which features in a particular input vector contribute most strongly to a neural network’s output.[67][68] Other techniques explain some particular prediction made by a (nonlinear) black-box model, a goal referred to as “local interpretability”.[69][70][71][72][73][74] We still today cannot explain the output of today’s DNNs without the new explanatory mechanisms, we also can’t by the neural network, or external explanatory components [75] There is also research on whether the concepts of local interpretability can be applied to a remote context, where a model is operated by a third-party.[76][77]

There has been work on making glass-box models which are more transparent to inspection.[22][78] This includes decision trees,[79] Bayesian networks, sparse linear models,[80] and more.[81] The Association for Computing Machinery Conference on Fairness, Accountability, and Transparency (ACM FAccT) was established in 2018 to study transparency and explainability in the context of socio-technical systems, many of which include artificial intelligence.[82][83]

Some techniques allow visualisations of the inputs to which individual software neurons respond to most strongly. Several groups found that neurons can be aggregated into circuits that perform human-comprehensible functions, some of which reliably arise across different networks trained independently.[84][85]

There are various techniques to extract compressed representations of the features of given inputs, which can then be analysed by standard clustering techniques. Alternatively, networks can be trained to output linguistic explanations of their behaviour, which are then directly human-interpretable.[86] Model behaviour can also be explained with reference to training data—for example, by evaluating which training inputs influenced a given behaviour the most.[87]

The use of explainable artificial intelligence (XAI) in pain research, specifically in understanding the role of electrodermal activity for automated pain recognition: hand-crafted features and deep learning models in pain recognition, highlighting the insights that simple hand-crafted features can yield comparative performances to deep learning models and that both traditional feature engineering and deep feature learning approaches rely on simple characteristics of the input time-series data.[88]

As regulators, official bodies, and general users come to depend on AI-based dynamic systems, clearer accountability will be required for automated decision-making processes to ensure trust and transparency. The first global conference exclusively dedicated to this emerging discipline was the 2017 International Joint Conference on Artificial Intelligence: Workshop on Explainable Artificial Intelligence (XAI).[89] It has evolved over the years, with various workshops organised and co-located to many other international conferences, and it has now a dedicated global event, “The world conference on eXplainable Artificial Intelligence”, with its own proceedings.[90][91]

The European Union introduced a right to explanation in the General Data Protection Right (GDPR) to address potential problems stemming from the rising importance of algorithms. The implementation of the regulation began in 2018. However, the right to explanation in GDPR covers only the local aspect of interpretability. In the United States, insurance companies are required to be able to explain their rate and coverage decisions.[92] In France the Loi pour une République numérique (Digital Republic Act) grants subjects the right to request and receive information pertaining to the implementation of algorithms that process data about them.

Despite ongoing endeavors to enhance the explainability of AI models, they persist with several inherent limitations.

Adversarial parties

[edit]

By making an AI system more explainable, we also reveal more of its inner workings. For example, the explainability method of feature importance identifies features or variables that are most important in determining the model’s output, while the influential samples method identifies the training samples that are most influential in determining the output, given a particular input.[93] Adversarial parties could take advantage of this knowledge.

For example, competitor firms could replicate aspects of the original AI system in their own product, thus reducing competitive advantage.[94] An explainable AI system is also susceptible to being “gamed”—influenced in a way that undermines its intended purpose. One study gives the example of a predictive policing system; in this case, those who could potentially “game” the system are the criminals subject to the system’s decisions. In this study, developers of the system discussed the issue of criminal gangs looking to illegally obtain passports, and they expressed concerns that, if given an idea of what factors might trigger an alert in the passport application process, those gangs would be able to “send guinea pigs” to test those triggers, eventually finding a loophole that would allow them to “reliably get passports from under the noses of the authorities”.[95]

Adaptive Integration and Explanation

[edit]

Many approaches that it uses provides explanation in general, it doesn’t take account for the diverse backgrounds and knowledge level of the users. This leads to challenges with accurate comprehension for all users. Expert users can find the explanations lacking in depth, and are oversimplified, while a beginner user may struggle understanding the explanations as they are complex. This limitation downplays the ability of the XAI techniques to appeal to their users with different levels of knowledge, which can impact the trust from users and who uses it. The quality of explanations can be different amongst their users as they all have different expertise levels, including different situation and conditions[96]

Technical complexity

[edit]

A fundamental barrier to making AI systems explainable is the technical complexity of such systems. End users often lack the coding knowledge required to understand software of any kind. Current methods used to explain AI are mainly technical ones, geared toward machine learning engineers for debugging purposes, rather than toward the end users who are ultimately affected by the system, causing “a gap between explainability in practice and the goal of transparency”.[93] Proposed solutions to address the issue of technical complexity include either promoting the coding education of the general public so technical explanations would be more accessible to end users, or providing explanations in layperson terms.[94]

The solution must avoid oversimplification. It is important to strike a balance between accuracy – how faithfully the explanation reflects the process of the AI system – and explainability – how well end users understand the process. This is a difficult balance to strike, since the complexity of machine learning makes it difficult for even ML engineers to fully understand, let alone non-experts.[93]

Understanding versus trust

[edit]

The goal of explainability to end users of AI systems is to increase trust in the systems, even “address concerns about lack of ‘fairness’ and discriminatory effects”.[94] However, even with a good understanding of an AI system, end users may not necessarily trust the system.[97] In one study, participants were presented with combinations of white-box and black-box explanations, and static and interactive explanations of AI systems. While these explanations served to increase both their self-reported and objective understanding, it had no impact on their level of trust, which remained skeptical.[98]

This outcome was especially true for decisions that impacted the end user in a significant way, such as graduate school admissions. Participants judged algorithms to be too inflexible and unforgiving in comparison to human decision-makers; instead of rigidly adhering to a set of rules, humans are able to consider exceptional cases as well as appeals to their initial decision.[98] For such decisions, explainability will not necessarily cause end users to accept the use of decision-making algorithms. We will need to either turn to another method to increase trust and acceptance of decision-making algorithms, or question the need to rely solely on AI for such impactful decisions in the first place.

However, some emphasize that the purpose of explainability of artificial intelligence is not to merely increase users’ trust in the system’s decisions, but to calibrate the users’ level of trust to the correct level.[99] According to this principle, too much or too little user trust in the AI system will harm the overall performance of the human-system unit. When the trust is excessive, the users are not critical of possible mistakes of the system and when the users do not have enough trust in the system, they will not exhaust the benefits inherent in it.

Some scholars have suggested that explainability in AI should be considered a goal secondary to AI effectiveness, and that encouraging the exclusive development of XAI may limit the functionality of AI more broadly.[100][101] Critiques of XAI rely on developed concepts of mechanistic and empiric reasoning from evidence-based medicine to suggest that AI technologies can be clinically validated even when their function cannot be understood by their operators.[100]

Some researchers advocate the use of inherently interpretable machine learning models, rather than using post-hoc explanations in which a second model is created to explain the first. This is partly because post-hoc models increase the complexity in a decision pathway and partly because it is often unclear how faithfully a post-hoc explanation can mimic the computations of an entirely separate model.[22] However, another view is that what is important is that the explanation accomplishes the given task at hand, and whether it is pre or post-hoc doesn’t matter. If a post-hoc explanation method helps a doctor diagnose cancer better, it is of secondary importance whether it is a correct/incorrect explanation.

The goals of XAI amount to a form of lossy compression that will become less effective as AI models grow in their number of parameters. Along with other factors this leads to a theoretical limit for explainability.[102]

Explainability was studied also in social choice theory. Social choice theory aims at finding solutions to social decision problems, that are based on well-established axioms. Ariel D. Procaccia[103] explains that these axioms can be used to construct convincing explanations to the solutions. This principle has been used to construct explanations in various subfields of social choice.

Cailloux and Endriss[104] present a method for explaining voting rules using the axioms that characterize them. They exemplify their method on the Borda voting rule .

Peters, Procaccia, Psomas and Zhou[105] present an algorithm for explaining the outcomes of the Borda rule using O(m2) explanations, and prove that this is tight in the worst case.

Participatory budgeting

[edit]

Yang, Hausladen, Peters, Pournaras, Fricker and Helbing[106] present an empirical study of explainability in participatory budgeting. They compared the greedy and the equal shares rules, and three types of explanations: mechanism explanation (a general explanation of how the aggregation rule works given the voting input), individual explanation (explaining how many voters had at least one approved project, at least 10000 CHF in approved projects), and group explanation (explaining how the budget is distributed among the districts and topics). They compared the perceived trustworthiness and fairness of greedy and equal shares, before and after the explanations. They found out that, for MES, mechanism explanation yields the highest increase in perceived fairness and trustworthiness; the second-highest was Group explanation. For Greedy, Mechanism explanation increases perceived trustworthiness but not fairness, whereas Individual explanation increases both perceived fairness and trustworthiness. Group explanation decreases the perceived fairness and trustworthiness.

Nizri, Azaria and Hazon[107] present an algorithm for computing explanations for the Shapley value. Given a coalitional game, their algorithm decomposes it to sub-games, for which it is easy to generate verbal explanations based on the axioms characterizing the Shapley value. The payoff allocation for each sub-game is perceived as fair, so the Shapley-based payoff allocation for the given game should seem fair as well. An experiment with 210 human subjects shows that, with their automatically generated explanations, subjects perceive Shapley-based payoff allocation as significantly fairer than with a general standard explanation.

  1. ^ Longo, Luca; et al. (2024). “Explainable Artificial Intelligence (XAI) 2.0: A manifesto of open challenges and interdisciplinary research directions”. Information Fusion. 106. doi:10.1016/j.inffus.2024.102301.
  2. ^ MihĂĄly, HĂ©der (2023). “Explainable AI: A Brief History of the Concept” (PDF). ERCIM News (134): 9–10.
  3. ^ Phillips, P. Jonathon; Hahn, Carina A.; Fontana, Peter C.; Yates, Amy N.; Greene, Kristen; Broniatowski, David A.; Przybocki, Mark A. (2021-09-29). “Four Principles of Explainable Artificial Intelligence”. NIST. doi:10.6028/nist.ir.8312.
  4. ^ Vilone, Giulia; Longo, Luca (2021). “Notions of explainability and evaluation approaches for explainable artificial intelligence”. Information Fusion. December 2021 - Volume 76: 89–106. doi:10.1016/j.inffus.2021.05.009.
  5. ^ Confalonieri, Roberto; Coba, Ludovik; Wagner, Benedikt; Besold, Tarek R. (January 2021). “A historical perspective of explainable Artificial Intelligence”. WIREs Data Mining and Knowledge Discovery. 11 (1). doi:10.1002/widm.1391. ISSN 1942-4787.
  6. ^ Castelvecchi, Davide (2016-10-06). “Can we open the black box of AI?“. Nature. 538 (7623): 20–23. Bibcode:2016Natur.538
20C. doi:10.1038/538020a. ISSN 0028-0836. PMID 27708329. S2CID 4465871.
  7. ^ Jump up to: a b c Sample, Ian (5 November 2017). “Computer says no: why making AIs fair, accountable and transparent is crucial”. The Guardian. Retrieved 30 January 2018.
  8. ^ Alizadeh, Fatemeh (2021). “I Don’t Know, Is AI Also Used in Airbags?: An Empirical Study of Folk Concepts and People’s Expectations of Current and Future Artificial Intelligence”. Icom. 20 (1): 3–17. doi:10.1515/icom-2021-0009 (inactive 3 December 2024). S2CID 233328352.
  9. ^ Jump up to: a b Edwards, Lilian; Veale, Michael (2017). “Slave to the Algorithm? Why a ‘Right to an Explanation’ Is Probably Not the Remedy You Are Looking For”. Duke Law and Technology Review. 16: 18. SSRN 2972855.
  10. ^ Do Couto, Mark (February 22, 2024). “Entering the Age of Explainable AI”. TDWI. Retrieved 2024-09-11.
  11. ^ Jump up to: a b Gunning, D.; Stefik, M.; Choi, J.; Miller, T.; Stumpf, S.; Yang, G.-Z. (2019-12-18). “XAI-Explainable artificial intelligence”. Science Robotics. 4 (37): eaay7120. doi:10.1126/scirobotics.aay7120. ISSN 2470-9476. PMID 33137719.
  12. ^ Rieg, Thilo; Frick, Janek; Baumgartl, Hermann; Buettner, Ricardo (2020-12-17). “Demonstration of the potential of white-box machine learning approaches to gain insights from cardiovascular disease electrocardiograms”. PLOS ONE. 15 (12): e0243615. Bibcode:2020PLoSO..1543615R. doi:10.1371/journal.pone.0243615. ISSN 1932-6203. PMC 7746264. PMID 33332440.
  13. ^ Vilone, Giulia; Longo, Luca (2021). “Classification of Explainable Artificial Intelligence Methods through Their Output Formats”. Machine Learning and Knowledge Extraction. 3 (3): 615–661. doi:10.3390/make3030032.
  14. ^ Loyola-González, O. (2019). “Black-Box vs. White-Box: Understanding Their Advantages and Weaknesses From a Practical Point of View”. IEEE Access. 7: 154096–154113. Bibcode:2019IEEEA
7o4096L. doi:10.1109/ACCESS.2019.2949286. ISSN 2169-3536.
  15. ^ Jump up to: a b Roscher, R.; Bohn, B.; Duarte, M. F.; Garcke, J. (2020). “Explainable Machine Learning for Scientific Insights and Discoveries”. IEEE Access. 8: 42200–42216. arXiv:1905.08883. Bibcode:2020IEEEA
842200R. doi:10.1109/ACCESS.2020.2976199. ISSN 2169-3536.
  16. ^ Jump up to: a b Murdoch, W. James; Singh, Chandan; Kumbier, Karl; Abbasi-Asl, Reza; Yu, Bin (2019-01-14). “Interpretable machine learning: definitions, methods, and applications”. Proceedings of the National Academy of Sciences of the United States of America. 116 (44): 22071–22080. arXiv:1901.04592. doi:10.1073/pnas.1900654116. PMC 6825274. PMID 31619572.
  17. ^ Jump up to: a b Lipton, Zachary C. (June 2018). “The Mythos of Model Interpretability: In machine learning, the concept of interpretability is both important and slippery”. Queue. 16 (3): 31–57. doi:10.1145/3236386.3241340. ISSN 1542-7730.
  18. ^ “Explainable Artificial Intelligence (XAI): Concepts, Taxonomies, Opportunities and Challenges toward Responsible AI”. DeepAI. 2019-10-22. Retrieved 2021-01-13.
  19. ^ Montavon, GrĂ©goire; Samek, Wojciech; MĂŒller, Klaus-Robert (2018-02-01). “Methods for interpreting and understanding deep neural networks”. Digital Signal Processing. 73: 1–15. arXiv:1706.07979. Bibcode:2018DSP
73
1M. doi:10.1016/j.dsp.2017.10.011. ISSN 1051-2004.
  20. ^ Notovich, Aviv., Chalutz-Ben Gal, Hila, & Ben-Gal, Irad (2023). “Explainable Artificial Intelligence (XAI): Motivation, Terminology, and Taxonomy” (PDF). In Machine Learning for Data Science Handbook: Data Mining and Knowledge Discovery Handbook (pp. 971-985). Cham: Springer International Publishing.
  21. ^ Adadi, A.; Berrada, M. (2018). “Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)“. IEEE Access. 6: 52138–52160. Bibcode:2018IEEEA
652138A. doi:10.1109/ACCESS.2018.2870052. ISSN 2169-3536.
  22. ^ Jump up to: a b c Rudin, Cynthia (2019). “Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead”. Nature Machine Intelligence. 1 (5): 206–215. arXiv:1811.10154. doi:10.1038/s42256-019-0048-x. ISSN 2522-5839. PMC 9122117. PMID 35603010.
  23. ^ Koh, P. W.; Nguyen, T.; Tang, Y. S.; Mussmann, S.; Pierson, E.; Kim, B.; Liang, P. (November 2020). “Concept bottleneck models”. International Conference on Machine Learning. PMLR. pp. 5338–5348.
  24. ^ Ludan, J. M.; Lyu, Q.; Yang, Y.; Dugan, L.; Yatskar, M.; Callison-Burch, C. (2023). “Interpretable-by-Design Text Classification with Iteratively Generated Concept Bottleneck”. arXiv:2310.19660 [cs.CL].
  25. ^ Wenninger, Simon; Kaymakci, Can; Wiethe, Christian (2022). “Explainable long-term building energy consumption prediction using QLattice”. Applied Energy. 308. Elsevier BV: 118300. Bibcode:2022ApEn..30818300W. doi:10.1016/j.apenergy.2021.118300. ISSN 0306-2619. S2CID 245428233.
  26. ^ Christiansen, Michael; Wilstrup, Casper; Hedley, Paula L. (2022). “Explainable “white-box” machine learning is the way forward in preeclampsia screening”. American Journal of Obstetrics and Gynecology. 227 (5). Elsevier BV: 791. doi:10.1016/j.ajog.2022.06.057. ISSN 0002-9378. PMID 35779588. S2CID 250160871.
  27. ^ Wilstup, Casper; Cave, Chris (2021-01-15), Combining symbolic regression with the Cox proportional hazards model improves prediction of heart failure deaths, Cold Spring Harbor Laboratory, doi:10.1101/2021.01.15.21249874, S2CID 231609904
  28. ^ “How AI detectives are cracking open the black box of deep learning”. Science. 5 July 2017. Retrieved 30 January 2018..
  29. ^ Dosilovic, Filip; Brcic, Mario; Hlupic, Nikica (2018-05-25). “Explainable Artificial Intelligence: A Survey” (PDF). MIPRO 2018 - 41st International Convention Proceedings. MIPRO 2018. Opatija, Croatia. pp. 210–215. doi:10.23919/MIPRO.2018.8400040. ISBN 978-953-233-095-3. Archived from the original (PDF) on 2018-12-10. Retrieved 2018-12-09.
  30. ^ Bernal, Jose; Mazo, Claudia (2022-10-11). “Transparency of Artificial Intelligence in Healthcare: Insights from Professionals in Computing and Healthcare Worldwide”. Applied Sciences. 12 (20): 10228. doi:10.3390/app122010228. ISSN 2076-3417.
  31. ^ Antoniadi, Anna Markella; Du, Yuhan; Guendouz, Yasmine; Wei, Lan; Mazo, Claudia; Becker, Brett A.; Mooney, Catherine (January 2021). “Current Challenges and Future Opportunities for XAI in Machine Learning-Based Clinical Decision Support Systems: A Systematic Review”. Applied Sciences. 11 (11): 5088. doi:10.3390/app11115088. ISSN 2076-3417.
  32. ^ “DeepMind Has Simple Tests That Might Prevent Elon Musk’s AI Apocalypse”. Bloomberg.com. 11 December 2017. Retrieved 30 January 2018.
  33. ^ “Learning from Human Preferences”. OpenAI Blog. 13 June 2017. Retrieved 30 January 2018.
  34. ^ “Explainable Artificial Intelligence (XAI)“. DARPA. Retrieved 17 July 2017.
  35. ^ Biecek, Przemyslaw (23 June 2018). “DALEX: explainers for complex predictive models”. Journal of Machine Learning Research. 19: 1–5. arXiv:1806.08915.
  36. ^ Rai, Arun. “Explainable AI: From black box to glass box.” Journal of the Academy of Marketing Science 48 (2020): 137-141.
  37. ^ Sokol, Kacper; Flach, Peter (2018). “Glass-Box: Explaining AI Decisions With Counterfactual Statements Through Conversation With a Voice-enabled Virtual Assistant”. Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. pp. 5868–5870. doi:10.24963/ijcai.2018/865. ISBN 9780999241127. S2CID 51608978.
  38. ^ Broniatowski, David A. (2021). “Psychological Foundations of Explainability and Interpretability in Artificial Intelligence”. NIST Pubs.
  39. ^ Jump up to: a b ISO/IEC TR 29119-11:2020, Software and systems engineering, Software testing, Part 11: Guidelines on the testing of AI-based systems. ISO. 2020. Retrieved 25 November 2023.
  40. ^ Verma, Yugesh (2021-12-25). “Complete Guide to SHAP - SHAPley Additive exPlanations for Practitioners”. Analytics India Magazine. Retrieved 2024-07-10.
  41. ^ Rothman, Denis (2020-10-07). “Exploring LIME Explanations and the Mathematics Behind It”. Codemotion Magazine. Retrieved 2024-07-10.
  42. ^ Christian, Brian (2020). “TELL ME EVERYTHING: MULTITASK NETS”. The Alignment Problem: Machine learning and human values. W. W. Norton & Company. ISBN 978-0-393-86833-3.
  43. ^ Sharma, Abhishek (2018-07-11). “What Are Saliency Maps In Deep Learning?“. Analytics India Magazine. Retrieved 2024-07-10.
  44. ^ Confalonieri, Roberto; Coba, Ludovik; Wagner, Benedikt; Besold, Tarek R. (January 2021). “A historical perspective of explainable Artificial Intelligence”. WIREs Data Mining and Knowledge Discovery. 11 (1). doi:10.1002/widm.1391. ISSN 1942-4787.
  45. ^ Luo, Haoyan; Specia, Lucia (2024-02-21). “From Understanding to Utilization: A Survey on Explainability for Large Language Models”. arXiv:2401.12874 [cs.CL].
  46. ^ Olah, Chris (June 27, 2022). “Mechanistic Interpretability, Variables, and the Importance of Interpretable Bases”. www.transformer-circuits.pub. Retrieved 2024-07-10.
  47. ^ Mittal, Aayush (2024-06-17). “Understanding Sparse Autoencoders, GPT-4 & Claude 3 : An In-Depth Technical Exploration”. Unite.AI. Retrieved 2024-07-10.
  48. ^ Ropek, Lucas (2024-05-21). “New Anthropic Research Sheds Light on AI’s ‘Black Box’“. Gizmodo. Retrieved 2024-05-23.
  49. ^ Perrigo, Billy (2024-05-21). “Artificial Intelligence Is a ‘Black Box.’ Maybe Not For Long”. Time. Retrieved 2024-05-24.
  50. ^ Barber, Gregory. “Inside the ‘Black Box’ of a Neural Network”. Wired. ISSN 1059-1028. Retrieved 2024-07-10.
  51. ^ Fagan, L. M.; Shortliffe, E. H.; Buchanan, B. G. (1980). “Computer-based medical decision making: from MYCIN to VM”. Automedica. 3 (2): 97–108.
  52. ^ Clancey, William (1987). Knowledge-Based Tutoring: The GUIDON Program. Cambridge, Massachusetts: The MIT Press.
  53. ^ Brown, John S.; Burton, R. R.; De Kleer, Johan (1982). “Pedagogical, natural language, and knowledge engineering techniques in SOPHIE I, II, and III”. Intelligent Tutoring Systems. Academic Press. ISBN 0-12-648680-8.
  54. ^ Bareiss, Ray; Porter, Bruce; Weir, Craig; Holte, Robert (1990). “Protos: An Exemplar-Based Learning Apprentice”. Machine Learning. Vol. 3. Morgan Kaufmann Publishers Inc. pp. 112–139. ISBN 1-55860-119-8.
  55. ^ Jump up to: a b Bareiss, Ray (1989). Exemplar-Based Knowledge Acquisition: A Unified Approach to Concept Representation, Classification, and Learning. Perspectives in Artificial Intelligence. Academic Press.
  56. ^ Van Lent, M.; Fisher, W.; Mancuso, M. (July 2004). “An explainable artificial intelligence system for small-unit tactical behavior”. Proceedings of the National Conference on Artificial Intelligence. San Jose, CA: AAAI Press. pp. 900–907. ISBN 0262511835.
  57. ^ Russell, Stuart; Norvig, Peter (2003). Artificial Intelligence: A Modern Approach. Prentice Hall Series in Artificial Intelligence (Second ed.). Upper Saddle River, New Jersey: Prentice Hall, Pearson Education. ISBN 0-13-790395-2.
  58. ^ Forbus, Kenneth; De Kleer, Johan (1993). Building Problem Solvers. Cambridge, Massachusetts: The MIT Press. ISBN 0-262-06157-0.
  59. ^ Tickle, A. B.; Andrews, R.; Golea, M.; Diederich, J. (November 1998). “The truth will come to light: directions and challenges in extracting the knowledge embedded within trained artificial neural networks”. IEEE Transactions on Neural Networks. 9 (6): 1057–1068. doi:10.1109/72.728352. ISSN 1045-9227. PMID 18255792. S2CID 11111578.
  60. ^ “Accenture Unveils Tool to Help Companies Insure Their AI Is Fair”. Bloomberg.com. June 2018. Retrieved 5 August 2018.
  61. ^ Minsky, et al., “The Society of Intelligent Veillance” IEEE ISTAS2013, pages 13-17.
  62. ^ Mukherjee, Siddhartha (27 March 2017). “A.I. Versus M.D.” The New Yorker. Retrieved 30 January 2018.
  63. ^ Csiszár, Orsolya; Csiszár, Gábor; Dombi, József (2020-07-08). “Interpretable neural networks based on continuous-valued logic and multicriteria decision operators”. Knowledge-Based Systems. 199: 105972. arXiv:1910.02486. doi:10.1016/j.knosys.2020.105972. ISSN 0950-7051.
  64. ^ Doshi-Velez, Finale; Kim, Been (2017-02-27). “Towards A Rigorous Science of Interpretable Machine Learning”. arXiv:1702.08608 [stat.ML].
  65. ^ Abdollahi, Behnoush, and Olfa Nasraoui. (2016). “Explainable Restricted Boltzmann Machines for Collaborative Filtering”. arXiv:1606.07129 [stat.ML].
  66. ^ Dombi, József; Csiszår, Orsolya (2021). Explainable Neural Networks Based on Fuzzy Logic and Multi-criteria Decision Tools. Studies in Fuzziness and Soft Computing. Vol. 408. doi:10.1007/978-3-030-72280-7. ISBN 978-3-030-72279-1. ISSN 1434-9922. S2CID 233486978.
  67. ^ Bach, Sebastian; Binder, Alexander; Montavon, GrĂ©goire; Klauschen, Frederick; MĂŒller, Klaus-Robert; Samek, Wojciech (2015-07-10). Suarez, Oscar Deniz (ed.). “On Pixel-Wise Explanations for Non-Linear Classifier Decisions by Layer-Wise Relevance Propagation”. PLOS ONE. 10 (7): e0130140. Bibcode:2015PLoSO..1030140B. doi:10.1371/journal.pone.0130140. ISSN 1932-6203. PMC 4498753. PMID 26161953.
  68. ^ Sample, Ian (5 November 2017). “Computer says no: why making AIs fair, accountable and transparent is crucial”. The Guardian. Retrieved 5 August 2018.
  69. ^ Martens, David; Provost, Foster (2014). “Explaining data-driven document classifications” (PDF). MIS Quarterly. 38: 73–99. doi:10.25300/MISQ/2014/38.1.04. S2CID 14238842.
  70. ^ ""Why Should I Trust You?” | Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining”. doi:10.1145/2939672.2939778. S2CID 13029170.
  71. ^ Lundberg, Scott M; Lee, Su-In (2017), Guyon, I.; Luxburg, U. V.; Bengio, S.; Wallach, H. (eds.), “A Unified Approach to Interpreting Model Predictions” (PDF), Advances in Neural Information Processing Systems 30, Curran Associates, Inc., pp. 4765–4774, arXiv:1705.07874, retrieved 2020-03-13
  72. ^ Carter, Brandon; Mueller, Jonas; Jain, Siddhartha; Gifford, David (2019-04-11). “What made you do this? Understanding black-box decisions with sufficient input subsets”. The 22nd International Conference on Artificial Intelligence and Statistics: 567–576.
  73. ^ Shrikumar, Avanti; Greenside, Peyton; Kundaje, Anshul (2017-07-17). “Learning Important Features Through Propagating Activation Differences”. International Conference on Machine Learning: 3145–3153.
  74. ^ “Axiomatic attribution for deep networks | Proceedings of the 34th International Conference on Machine Learning - Volume 70”. dl.acm.org. Icml’17: 3319–3328. 6 August 2017. Retrieved 2020-03-13.
  75. ^ Xu, Feiyu; Uszkoreit, Hans; Du, Yangzhou; Fan, Wei; Zhao, Dongyan; Zhu, Jun (2019), Tang, Jie; Kan, Min-Yen; Zhao, Dongyan; Li, Sujian (eds.), “Explainable AI: A Brief Survey on History, Research Areas, Approaches and Challenges”, Natural Language Processing and Chinese Computing, vol. 11839, Cham: Springer International Publishing, pp. 563–574, doi:10.1007/978-3-030-32236-6_51, ISBN 978-3-030-32235-9, retrieved 2024-12-03
  76. ^ Le Merrer, Erwan; TrĂ©dan, Gilles (September 2020). “Remote explainability faces the bouncer problem”. Nature Machine Intelligence. 2 (9): 529–539. arXiv:1910.01432. doi:10.1038/s42256-020-0216-z. ISSN 2522-5839. S2CID 225207140.
  77. ^ Aivodji, Ulrich; Arai, Hiromi; Fortineau, Olivier; Gambs, SĂ©bastien; Hara, Satoshi; Tapp, Alain (2019-05-24). “Fairwashing: the risk of rationalization”. International Conference on Machine Learning. PMLR: 161–170. arXiv:1901.09749.
  78. ^ Singh, Chandan; Nasseri, Keyan; Tan, Yan Shuo; Tang, Tiffany; Yu, Bin (4 May 2021). “imodels: a python package for fitting interpretable models”. Journal of Open Source Software. 6 (61): 3192. Bibcode:2021JOSS
6.3192S. doi:10.21105/joss.03192. ISSN 2475-9066. S2CID 235529515.
  79. ^ Vidal, Thibaut; Schiffer, Maximilian (2020). “Born-Again Tree Ensembles”. International Conference on Machine Learning. 119. PMLR: 9743–9753. arXiv:2003.11132.
  80. ^ Ustun, Berk; Rudin, Cynthia (1 March 2016). “Supersparse linear integer models for optimized medical scoring systems”. Machine Learning. 102 (3): 349–391. doi:10.1007/s10994-015-5528-6. ISSN 1573-0565. S2CID 207211836.
  81. ^ Bostrom, N., & Yudkowsky, E. (2014). The ethics of artificial intelligence. The Cambridge Handbook of Artificial Intelligence, 316-334.
  82. ^ “FAT* Conference”.
  83. ^ “Computer programs recognise white men better than black women”. The Economist. 2018. Retrieved 5 August 2018.
  84. ^ Olah, Chris; Cammarata, Nick; Schubert, Ludwig; Goh, Gabriel; Petrov, Michael; Carter, Shan (10 March 2020). “Zoom In: An Introduction to Circuits”. Distill. 5 (3): e00024.001. doi:10.23915/distill.00024.001. ISSN 2476-0757.
  85. ^ Li, Yixuan; Yosinski, Jason; Clune, Jeff; Lipson, Hod; Hopcroft, John (8 December 2015). “Convergent Learning: Do different neural networks learn the same representations?“. Feature Extraction: Modern Questions and Challenges. PMLR: 196–212.
  86. ^ Hendricks, Lisa Anne; Akata, Zeynep; Rohrbach, Marcus; Donahue, Jeff; Schiele, Bernt; Darrell, Trevor (2016). “Generating Visual Explanations”. Computer Vision – ECCV 2016. Lecture Notes in Computer Science. Vol. 9908. Springer International Publishing. pp. 3–19. arXiv:1603.08507. doi:10.1007/978-3-319-46493-0_1. ISBN 978-3-319-46492-3. S2CID 12030503.
  87. ^ Koh, Pang Wei; Liang, Percy (17 July 2017). “Understanding Black-box Predictions via Influence Functions”. International Conference on Machine Learning. PMLR: 1885–1894. arXiv:1703.04730.
  88. ^ Gouverneur, Philip; Li, FrĂ©dĂ©ric; Shirahama, Kimiaki; Luebke, Luisa; Adamczyk, WacƂaw M.; Szikszay, Tibor M.; Luedtke, Kerstin; Grzegorzek, Marcin (2023-02-09). “Explainable Artificial Intelligence (XAI) in Pain Research: Understanding the Role of Electrodermal Activity for Automated Pain Recognition”. Sensors. 23 (4): 1959. Bibcode:2023Senso..23.1959G. doi:10.3390/s23041959. ISSN 1424-8220. PMC 9960387. PMID 36850556.
  89. ^ “IJCAI 2017 Workshop on Explainable Artificial Intelligence (XAI)” (PDF). Earthlink. IJCAI. Archived from the original (PDF) on 4 April 2019. Retrieved 17 July 2017.
  90. ^ Explainable Artificial Intelligence, First World Conference, xAI 2023, Lisbon, Portugal, July 26–28, 2023, Proceedings, Parts I/II/III. Communications in Computer and Information Science. Vol. 1903. springer. 2023. doi:10.1007/978-3-031-44070-0. ISBN 978-3-031-44070-0.
  91. ^ Explainable Artificial Intelligence, Second World Conference, xAI 2024, Valletta, Malta, July 17–19, 2024, Proceedings, Part I/II/III/IV. Communications in Computer and Information Science. Vol. 2153. springer. 2024. doi:10.1007/978-3-031-63787-2. ISBN 978-3-031-63787-2.
  92. ^ Kahn, Jeremy (12 December 2018). “Artificial Intelligence Has Some Explaining to Do”. Bloomberg Businessweek. Retrieved 17 December 2018.
  93. ^ Jump up to: a b c Bhatt, Umang; Xiang, Alice; Sharma, Shubham; Weller, Adrian; Taly, Ankur; Jia, Yunhan; Ghosh, Joydeep; Puri, Richir; M.F. Moura, JosĂ©; Eckersley, Peter (2022). “Explainable Machine Learning in Deployment”. Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency. pp. 648–657. doi:10.1145/3351095.3375624. ISBN 9781450369367. S2CID 202572724.
  94. ^ Jump up to: a b c Burrel, Jenna (2016). “How the machine ‘thinks’: Understanding opacity in machine learning algorithms”. Big Data & Society. 3 (1). doi:10.1177/2053951715622512. S2CID 61330970.
  95. ^ Veale, Michael; Van Kleek, Max; Binns, Reuben (2018). “Fairness and Accountability Design Needs for Algorithmic Support in High-Stakes Public Sector Decision-Making”. Proceedings of the 2018 CHI Conference on Human Factors in Computing Systems. Vol. 40. pp. 1–14. doi:10.1145/3173574.3174014. ISBN 9781450356206. S2CID 3639135.
  96. ^ Yang, Wenli; Wei, Yuchen; Wei, Hanyu; Chen, Yanyu; Huang, Guan; Li, Xiang; Li, Renjie; Yao, Naimeng; Wang, Xinyi; Gu, Xiaotong; Amin, Muhammad Bilal; Kang, Byeong (2023-08-10). “Survey on Explainable AI: From Approaches, Limitations and Applications Aspects”. Human-Centric Intelligent Systems. 3 (3): 161–188. doi:10.1007/s44230-023-00038-y. ISSN 2667-1336.
  97. ^ Hu, Tongxi; Zhang, Xuesong; Bohrer, Gil; Liu, Yanlan; Zhou, Yuyu; Martin, Jay; LI, Yang; Zhao, Kaiguang (2023). “Crop yield prediction via explainable AI and interpretable machine learning: Dangers of black box models for evaluating climate change impacts on crop yield”. Agricultural and Forest Meteorology. 336: 109458. doi:10.1016/j.agrformet.2023.109458. S2CID 258552400.
  98. ^ Jump up to: a b Cheng, Hao-Fei; Wang, Ruotang; Zhang, Zheng; O’Connell, Fiona; Gray, Terrance; Harper, F. Maxwell; Zhu, Haiyi (2019). Explaining Decision-Making Algorithms through UI: Strategies to Help Non-Expert Stakeholders. Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems. Vol. 559. pp. 1–12. doi:10.1145/3290605.3300789. ISBN 9781450359702. S2CID 140281803.
  99. ^ Liel, Yotam; Zalmanson, Lior (August 2023). “Turning Off Your Better Judgment – Conformity to Algorithmic Recommendations”. Academy of Management Proceedings. 2023 (1). doi:10.5465/AMPROC.2023.277bp. ISSN 0065-0668. S2CID 260212999.
  100. ^ Jump up to: a b McCoy, Liam G.; Brenna, Connor T. A.; Chen, Stacy S.; Vold, Karina; Das, Sunit (2021-11-05). “Believing in black boxes: machine learning for healthcare does not need explainability to be evidence-based”. Journal of Clinical Epidemiology. 142 (Online ahead of print): 252–257. doi:10.1016/j.jclinepi.2021.11.001. ISSN 0895-4356. PMID 34748907. S2CID 243810442.
  101. ^ Ghassemi, Marzyeh; Oakden-Rayner, Luke; Beam, Andrew L. (2021-11-01). “The false hope of current approaches to explainable artificial intelligence in health care”. The Lancet Digital Health. 3 (11): e745–e750. doi:10.1016/S2589-7500(21)00208-9. ISSN 2589-7500. PMID 34711379. S2CID 239963176.
  102. ^ Sarkar, Advait (2022). “Is explainable AI a race against model complexity?” (PDF). Workshop on Transparency and Explanations in Smart Systems (TeXSS), in Conjunction with ACM Intelligent User Interfaces (IUI 2022): 192–199. arXiv:2205.10119 – via CEUR Workshop Proceedings.
  103. ^ Procaccia, Ariel D. (2019), Laslier, Jean-François; Moulin, HervĂ©; Sanver, M. Remzi; Zwicker, William S. (eds.), “Axioms Should Explain Solutions”, The Future of Economic Design: The Continuing Development of a Field as Envisioned by Its Researchers, Studies in Economic Design, Cham: Springer International Publishing, pp. 195–199, doi:10.1007/978-3-030-18050-8_27, ISBN 978-3-030-18050-8, retrieved 2024-03-21
  104. ^ Cailloux, Olivier; Endriss, Ulle (2016-05-09). “Arguing about Voting Rules”. Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems. AAMAS ‘16. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems: 287–295. ISBN 978-1-4503-4239-1.
  105. ^ Peters, Dominik; Procaccia, Ariel D; Psomas, Alexandros; Zhou, Zixin (2020). “Explainable Voting”. Advances in Neural Information Processing Systems. 33. Curran Associates, Inc.: 1525–1534.
  106. ^ Yang, Joshua C.; Hausladen, Carina I.; Peters, Dominik; Pournaras, Evangelos; Regula HĂ€enggli Fricker; Helbing, Dirk (2024). “Designing Digital Voting Systems for Citizens: Achieving Fairness and Legitimacy in Participatory Budgeting”. Digital Government: Research and Practice. 5 (3): 1–30. arXiv:2310.03501. doi:10.1145/3665332.
  107. ^ Nizri, Meir; Hazon, Noam; Azaria, Amos (2022-06-28). “Explainable Shapley-Based Allocation (Student Abstract)“. Proceedings of the AAAI Conference on Artificial Intelligence. 36 (11): 13023–13024. doi:10.1609/aaai.v36i11.21648. ISSN 2374-3468. S2CID 250296641.

Graph View

Backlinks