Главная
Study mode:
on
1
Intro
2
References
3
Running Example
4
Learning with Constraints
5
Example: Video
6
Example: Language
7
Example: Deep Learning
8
What are people doing now?
9
Structured Probability Spaces
10
Boolean Constraints
11
Combinatorial Objects: Rankings
12
Encoding Rankings in Logic
13
Structured Space for Paths
14
Logical Circuits
15
Property: Decomposability
16
Property: Determinism
17
Sentential Decision Diagram (SDD)
18
Tractable for Logical Inference
19
PSDD: Probabilistic SDD
20
Tractable for Probabilistic Inference
21
PSDDs are Arithmetic Circuits
22
Parameters are interpretable
23
Learning Algorithms
24
Learning Preference Distributions
25
What happens if you ignore constraints?
26
Structured Naïve Bayes Classifier
27
Structured Datasets
28
Learning from Incomplete Data
29
Structured Queries
30
Conclusions
Description:
Explore a 40-minute lecture on tractable learning in structured probability spaces presented by Adnan Darwiche from UCLA at the Simons Institute. Delve into topics such as representation learning, learning with constraints, and structured probability spaces. Examine examples from video, language, and deep learning domains. Investigate Boolean constraints, combinatorial objects like rankings, and their encoding in logic. Learn about structured spaces for paths, logical circuits, and properties like decomposability and determinism. Discover Sentential Decision Diagrams (SDD) and their probabilistic counterpart, PSDD. Understand how these structures enable tractable logical and probabilistic inference. Explore learning algorithms, preference distributions, and structured datasets. Gain insights into learning from incomplete data and structured queries. Enhance your understanding of advanced machine learning concepts and their applications in various domains.

Tractable Learning in Structured Probability Spaces

Simons Institute
Add to list
0:00 / 0:00