~/talk

Credal Models for Uncertainty and Logic Treatment

links:none on file
slides:none on file

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

  1. 0:00Introduction to AI challenges
  2. 4:37Imprecision in decision making
  3. 9:18Probabilistic circuits overview
  4. 13:58Random forests and P(x)
  5. 17:12Credal sets and robustness
  6. 22:19Operations on credal sets
  7. 28:04Epsilon robustness in AI
  8. 36:04Neuro-symbolic AI integration
  9. 40:20Q&A and research directions
  10. 45:17Open problem in graph models
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.