Credal Models for Uncertainty and Logic Treatment
summary
Argues that replacing single probabilities with credal sets (convex sets of distributions) lets models represent ignorance, partial specifications and logical constraints; implements this by converting learned sum–product networks into probabilistic circuits whose sum weights become intervals (epsilon-contamination), then measures per-instance epsilon robustness — the largest perturbation that keeps the same decision. Epsilon is computable for a fixed value in linear time per epsilon (via max/product propagation and tiny knapsack LPs), and experiments show robustness correlates with higher accuracy and useful outlier/uncertainty detection.
AI-written summary · about
chapters (10)
- 0:00Introduction to AI challenges
- 4:37Imprecision in decision making
- 9:18Probabilistic circuits overview
- 13:58Random forests and P(x)
- 17:12Credal sets and robustness
- 22:19Operations on credal sets
- 28:04Epsilon robustness in AI
- 36:04Neuro-symbolic AI integration
- 40:20Q&A and research directions
- 45:17Open problem in graph models
related talks
01h 05mLogic and Probabilistic Circuits 1
01h 03mLogic and Probabilistic Circuits 2
01h 01mLogic and Probabilistic Circuits 4
29mA Pre-Expectation Calculus for Probabilistic Sensitivity
34mDistributional Robustness, Learning, and Empirical Likelihood
07mProbabilistic Reasoning and Learning for Trustworthy AI
37mEfficient Algorithms for Reliable Machine Learning
09mTowards Credible and Effective Data-Driven Decision-Making
