Probabilistic Reasoning and Learning for Trustworthy AI

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


Duration: 17:31
861 views
19

YooJung Choi (Arizona State University)
https://simons.berkeley.edu/talks/yoojung-choi-arizona-state-university-2023-09-08
Meet the Fellows Welcome Event Fall 2023

There is an increasing interest and need for artificial intelligence and machine learning systems that are fair, robust, interpretable, and generally trustworthy. In this talk, I will discuss how probabilistic reasoning and learning can provide a unified language and framework under which we can develop trustworthy AI systems. This is motivated by the fact that properties about model behavior often depend on the underlying distribution and that we wish to handle uncertainties that arise when deploying a system in the real world. I will talk about some recent work in algorithmic fairness in this direction, as well as efforts in developing tractable probabilistic models and inference to support it.



Other Videos By Simons Institute for the Theory of Computing


2023-09-19Dynamic Algorithms for 𝑘-center on Graphs
2023-09-19A Blackbox Reduction for Adaptive Adversaries using Differential Privacy
2023-09-19Recent Progress on Sublinear Time Algorithms for Maximum Matching: Upper Bounds
2023-09-18Parallelism in Dynamic Graph Algorithms
2023-09-18Optimizing Dynamic-Graph Data Structures on Multicores with the Locality-First Strategy
2023-09-18Recent Advances in Diversity Maximization in the Offline and Composable Coreset Models
2023-09-18Approximating Edit Distance in the Fully Dynamic Model
2023-09-18Lightning Talks
2023-09-12Dynamic Graph Algorithms: What We Know and What We Don’t | Richard M. Karp Distinguished Lecture
2023-09-08Probabilistic and Logical Circuits for Tractable Causal Reasoning
2023-09-08Probabilistic Reasoning and Learning for Trustworthy AI
2023-09-08Sampling and Approximately Counting CNF Formula Solutions in the Local Lemma Regime
2023-09-08Massively Parallel Join Algorithms
2023-09-08Relational Programming
2023-09-08Title: Research Interests and Latest Works
2023-09-08What can the demand analyst learn from machine learning?
2023-09-08From Robustness to Privacy and Back
2023-09-08Decoding the Maze: New Frontiers in Achieving Nash Equilibrium in AI Architectures
2023-09-08Risk Convergence and Algorithmic Regularization of Discrete-Stepsize (Stochastic) Gradient Descent
2023-09-08Quantum Cryptography in Algorithmica
2023-09-08Noncommutative constraint satisfaction problems


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event Fall 2023
YooJung Choi