Markov Logic

1. Markov Logic Stanley Kok Dept. of Computer Science & Eng. University of Washington Joint work with Pedro Domingos, Daniel Lowd, Hoifung Poon, Matt Richardson, Parag Singla and Jue Wang

2. Overview • Motivation • Background • Markov logic • Inference • Learning • Software • Applications

3. Most learners assume i.i.d. data(independent and identically distributed) One type of object Objects have no relation to each other Real applications:dependent, variously distributed data Multiple types of objects Relations between objects Motivation

4. Examples • Web search • Medical diagnosis • Computational biology • Social networks • Information extraction • Natural language processing • Perception • Ubiquitous computing • Etc.

5. Costs/Benefits of Markov Logic • Benefits • Better predictive accuracy • Better understanding of domains • Growth path for machine learning • Costs • Learning is much harder • Inference becomes a crucial issue • Greater complexity for user

6. Overview • Motivation • Background • Markov logic • Inference • Learning • Software • Applications

7. Markov Networks Smoking Cancer • Undirected graphical models Asthma Cough • Potential functions defined over cliques

8. Markov Networks Smoking Cancer • Undirected graphical models Asthma Cough • Log-linear model: Weight of Feature i Feature i

9. Hammersley-Clifford Theorem If Distribution is strictly positive (P(x) > 0) And Graph encodes conditional independences Then Distribution is product of potentials over cliques of graph Inverse is also true. (“Markov network = Gibbs distribution”)

10. Markov Nets vs. Bayes Nets

11. First-Order Logic • Constants, variables, functions, predicatesE.g.: Anna, x, MotherOf(x), Friends(x, y) • Literal: Predicate or its negation • Clause: Disjunction of literals • Grounding: Replace all variables by constantsE.g.: Friends (Anna, Bob) • World (model, interpretation):Assignment of truth values to all ground predicates

12. Overview • Motivation • Background • Markov logic • Inference • Learning • Software • Applications

13. Markov Logic: Intuition • A logical KB is a set of hard constraintson the set of possible worlds • Let’s make them soft constraints:When a world violates a formula,It becomes less probable, not impossible • Give each formula a weight(Higher weight  Stronger constraint)

14. Markov Logic: Definition • A Markov Logic Network (MLN) is a set of pairs (F, w) where • F is a formula in first-order logic • w is a real number • Together with a set of constants,it defines a Markov network with • One node for each grounding of each predicate in the MLN • One feature for each grounding of each formula F in the MLN, with the corresponding weight w

15. Example: Friends & Smokers

16. Example: Friends & Smokers

17. Example: Friends & Smokers

18. Example: Friends & Smokers Two constants: Anna (A) and Bob (B)

19. Example: Friends & Smokers Two constants: Anna (A) and Bob (B) Smokes(A) Smokes(B) Cancer(A) Cancer(B)

20. Example: Friends & Smokers Two constants: Anna (A) and Bob (B) Friends(A,B) Friends(A,A) Smokes(A) Smokes(B) Friends(B,B) Cancer(A) Cancer(B) Friends(B,A)

21. Example: Friends & Smokers Two constants: Anna (A) and Bob (B) Friends(A,B) Friends(A,A) Smokes(A) Smokes(B) Friends(B,B) Cancer(A) Cancer(B) Friends(B,A)

22. Example: Friends & Smokers Two constants: Anna (A) and Bob (B) Friends(A,B) Friends(A,A) Smokes(A) Smokes(B) Friends(B,B) Cancer(A) Cancer(B) Friends(B,A)

23. Markov Logic Networks • MLN is template for ground Markov nets • Probability of a world x: • Typed variables and constants greatly reduce size of ground Markov net • Functions, existential quantifiers, etc. • Infinite and continuous domains Weight of formula i No. of true groundings of formula i in x

24. Special cases: Markov networks Markov random fields Bayesian networks Log-linear models Exponential models Max. entropy models Gibbs distributions Boltzmann machines Logistic regression Hidden Markov models Conditional random fields Obtained by making all predicates zero-arity Markov logic allows objects to be interdependent (non-i.i.d.) Relation to Statistical Models

25. Relation to First-Order Logic • Infinite weights  First-order logic • Satisfiable KB, positive weights Satisfying assignments = Modes of distribution • Markov logic allows contradictions between formulas

26. Overview • Motivation • Background • Markov logic • Inference • Learning • Software • Applications

27. MAP/MPE Inference • Problem: Find most likely state of world given evidence Query Evidence

28. MAP/MPE Inference • Problem: Find most likely state of world given evidence

29. MAP/MPE Inference • Problem: Find most likely state of world given evidence

30. MAP/MPE Inference • Problem: Find most likely state of world given evidence • This is just the weighted MaxSAT problem • Use weighted SAT solver(e.g., MaxWalkSAT [Kautz et al., 1997]) • Potentially faster than logical inference (!)

31. The WalkSAT Algorithm fori← 1 to max-triesdo solution = random truth assignment for j ← 1 tomax-flipsdo if all clauses satisfied then return solution c ← random unsatisfied clause with probabilityp flip a random variable in c else flip variable in c that maximizes number of satisfied clauses return failure

32. The MaxWalkSAT Algorithm fori← 1 to max-triesdo solution = random truth assignment for j ← 1 tomax-flipsdo if ∑ weights(sat. clauses) > thresholdthen return solution c ← random unsatisfied clause with probabilityp flip a random variable in c else flip variable in c that maximizes ∑ weights(sat. clauses) return failure, best solution found

33. But … Memory Explosion • Problem:If there are n constantsand the highest clause arity is c,the ground network requires O(n ) memory • Solution:Exploit sparseness; ground clauses lazily→ LazySAT algorithm [Singla & Domingos, 2006] c

34. Computing Probabilities • P(Formula|MLN,C) = ? • MCMC: Sample worlds, check formula holds • P(Formula1|Formula2,MLN,C) = ? • If Formula2 = Conjunction of ground atoms • First construct min subset of network necessary to answer query (generalization of KBMC) • Then apply MCMC (or other) • Can also do lifted inference [Braz et al, 2005]

35. Ground Network Construction network←Ø queue← query nodes repeat node← front(queue) remove node from queue add node to network if node not in evidence then add neighbors(node) to queue until queue = Ø

36. MCMC: Gibbs Sampling state← random truth assignment fori← 1 tonum-samples do for each variable x sample x according to P(x|neighbors(x)) state←state with new value of x P(F) ← fraction of states in which F is true

37. But … Insufficient for Logic • Problem:Deterministic dependencies break MCMCNear-deterministic ones make it veryslow • Solution:Combine MCMC and WalkSAT→MC-SAT algorithm [Poon & Domingos, 2006]

38. Overview • Motivation • Background • Markov logic • Inference • Learning • Software • Applications

39. Learning • Data is a relational database • Closed world assumption (if not: EM) • Learning parameters (weights) • Learning structure (formulas)

40. No. of times clause i is true in data Expected no. times clause i is true according to MLN Generative Weight Learning • Maximize likelihood • Numerical optimization (gradient or 2nd order) • No local maxima • Requires inference at each step (slow!)

41. Pseudo-Likelihood • Likelihood of each variable given its neighbors in the data • Does not require inference at each step • Widely used in vision, spatial statistics, etc. • But PL parameters may not work well forlong inference chains

42. Discriminative Weight Learning • Maximize conditional likelihood of query (y) given evidence (x) • Approximate expected counts with: • counts in MAP state of y given x(with MaxWalkSAT) • with MC-SAT No. of true groundings of clause i in data Expected no. true groundings of clause i according to MLN

43. Structure Learning • Generalizes feature induction in Markov nets • Any inductive logic programming approach can be used, but . . . • Goal is to induce any clauses, not just Horn • Evaluation function should be likelihood • Requires learning weights for each candidate • Turns out not to be bottleneck • Bottleneck is counting clause groundings • Solution: Subsampling

44. Structure Learning • Initial state: Unit clauses or hand-coded KB • Operators: Add/remove literal, flip sign • Evaluation function:Pseudo-likelihood + Structure prior • Search: Beam, shortest-first, bottom-up[Kok& Domingos, 2005; Mihalkova & Mooney, 2007]

45. Overview • Motivation • Background • Markov logic • Inference • Learning • Software • Applications

46. Alchemy Open-source software including: • Full first-order logic syntax • Generative & discriminative weight learning • Structure learning • Weighted satisfiability and MCMC • Programming language features alchemy.cs.washington.edu

47. Overview • Motivation • Background • Markov logic • Inference • Learning • Software • Applications

48. Basics Logistic regression Hypertext classification Information retrieval Entity resolution Bayesian networks Etc. Applications

49. Programs Infer Learnwts Learnstruct Options MLN file Types (optional) Predicates Formulas Database files Running Alchemy

50. Uniform Distribn.: Empty MLN Example: Unbiased coin flips Type:flip = { 1, … , 20 } Predicate:Heads(flip)