Explanation: A(N Abridged) Survey

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=SydtUn-7OAc


Duration: 38:32
261 views
3

Joe Halpern (Cornell University)
https://simons.berkeley.edu/talks/explanation-abridged-survey
Interpretable Machine Learning in Natural and Social Sciences

I consider a definition of (causal) explanation that is a variant of one Judea Pearl and I gave. The definition is based on the notion of actual cause. Essentially, an explanation is a fact that is not known for certain but, if found to be true, would constitute an actual cause of the fact to be explained, regardless of the agent's initial uncertainty. I show that the definition handles well a number of problematic examples from the literature, and discuss various notions of partial explanation.



Other Videos By Simons Institute for the Theory of Computing


2022-07-01Platform-supported Auditing Of Social Media Algorithms For Public Interest
2022-07-01Legal Barriers To Interpretable Machine Learning
2022-06-30Interpretability and Algorithmic Fairness
2022-06-30Panel on Interpretability in the Biological Sciences
2022-06-30Machine Learning, Deep Networks and Interpretability in Systems, Cognitive and...
2022-06-30Interpreting Deep Learning Models Of Functional Genomics Data To Decode Regulatory Sequence...
2022-06-30Panel on Interpretability in the Physical Sciences
2022-06-30Interpreting Machine Learning From the Perspective of Nonequilibrium Systems
2022-06-29Interpretability In Atomic-Scale Machine Learning
2022-06-29Panel on Causality
2022-06-29Explanation: A(N Abridged) Survey
2022-06-29Conceptual Challenges In Connecting Interpretability And Causality
2022-06-29Panel on Societal Dimensions of Explanation
2022-06-29Accuracy and Interpretability Through the Lens of Human-AI Teaming
2022-06-28Goals And Interpretable Variables In Neuroscience
2022-06-18Continuous LWE is as Hard as LWE
2022-06-18Batch Arguments for NP and SNARGs for P from LWE
2022-06-18Lattice-based Zero-knowledge Proofs
2022-06-18Candidate Witness Encryption from Lattice Techniques
2022-06-17Optimal Broadcast Encryption and More from Evasive LWE
2022-06-17Single-Server Private Information Retrieval with Sublinear Amortized Time


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Interpretable Machine Learning in Natural and Social Sciences
Joe Halpern