Lifted MAP Inference for Markov Logic
|
|
- Derek Lloyd
- 5 years ago
- Views:
Transcription
1 Lifted MAP Inference for Markov Logic - Somdeb Sarkhel - Deepak Venugopal - Happy Mittal - Parag Singla - Vibhav Gogate
2 Outline Introduction Lifted MAP Inference for Markov Logic Networks S. Sarkhel, D. Venugopal, P. Singla, V. Gogate AISTATS 14 An Integer Polynomial Programming Based Framework for Lifted MAP Inference S. Sarkhel, D. Venugopal, P. Singla, V. Gogate NIPS 14 New Rules for Domain Independent Lifted MAP Inference H. Mittal, P. Goyal, V. Gogate, P. Singla NIPS 14
3 Outline Introduction Lifted MAP Inference for Markov Logic Networks S. Sarkhel, D. Venugopal, P. Singla, V. Gogate AISTATS 14 An Integer Polynomial Programming Based Framework for Lifted MAP Inference S. Sarkhel, D. Venugopal, P. Singla, V. Gogate NIPS 14 New Rules for Domain Independent Lifted MAP Inference H. Mittal, P. Goyal, V. Gogate, P. Singla NIPS 14
4 MAP Inference Problem: Find most likely state of world given evidence arg max y P( y x) Query Evidence
5 MAP Inference Problem: Find most likely state of world given evidence arg max y 1 Z x exp i w n i i ( x, y)
6 MAP Inference Problem: Find most likely state of world given evidence arg max y i w n ( x, y) Same as maximizing satisfied weight clause (Or minimizing unsatisfied weight clause) Alchemy solve using weighted SAT solver (e.g., MaxWalkSAT [Kautz et al., 1997]) i i
7 Optimization Problems Range minimize: f 0 (x) subject to: f i (x) 0 h j (x) = 0 u x 0 x Z n Objective Function Constraints Type Constraints are linear Variable type is integer
8 Integer Linear Programming minimize: subject to: c T x Ax b u x 0 x Z n Objective function is linear NP-Complete problem MAP can be solved using ILP solver (Used in ROCKIT [Noessner et al., 2013])
9 Outline Introduction Lifted MAP Inference for Markov Logic Networks S. Sarkhel, D. Venugopal, P. Singla, V. Gogate AISTATS 14 An Integer Polynomial Programming Based Framework for Lifted MAP Inference S. Sarkhel, D. Venugopal, P. Singla, V. Gogate NIPS 14 New Rules for Domain Independent Lifted MAP Inference H. Mittal, P. Goyal, V. Gogate, P. Singla NIPS 14
10 Lifted MAP Inference Lifted Algorithms Group indistinguishable atoms together Super atom Given assignment to these groups compute the weight (probability) of the assignment
11 Lifted MAP Inference For a subclass of MLNs non-shared MLN All possible assignments can be grouped by number of true groundings of its predicates Non-shared MLN: no logical variable is shared between the atoms in a formula. Example: R(x) v S(y)
12 Lifted MAP Inference Group (0, 1) Group (2, 1)
13 Lifted MAP Inference All possible assignments of a non-shared MLN can be grouped by number of true groundings of its predicates Counting Assignment: ground assignments can be grouped as (R i, a i ) Predicate # True Groundings
14 Lifted MAP Inference Simple Lifted Algorithm: Iterate over all counting assignment of all predicates to find the one that has maximum weight Ground search space: O(2 nd ) Lifted search space: O(d n ) Domain Lifted (dependent on domain) Can we do better? Yes, in fact we can do much better!
15 Lifted MAP Inference R S Consider the MLN: R(x) v S(y), w 1 Δx = 4, Δy = 3 Let s compute weight for assignment [(R, 2), (S, 1)]
16 Lifted MAP Inference R S
17 Lifted MAP Inference R S No of unsatisfied clauses = 2 2 Let s generalize for assignment ω = [(R, r), (S, s)] N(f, ω) = ΔR. ΔS - (ΔR - r)(δs - s)
18 Lifted MAP Inference minimize: Σ i Π j x j subject to: u x 0 x Z n No Constraints! Objective function is multilinear (i.e.- linear in each variable) e.g. f(x 1,x 2,x 3 ) = x 1 + x 2 x 3 2x 1 x 3 + x 2 x 1 x 2 x 3 Optimization problem has no constraint (except range and type)!
19 Lifted MAP Inference Non-shared MLN w/o self-joins R(x) v S(y), -4; R(x), 5; S(y), 3 Satisfied Clause Weight optimum weight Z axis X axis #R +ve Y axis #S +ve Satisfied clause weight as a surface plot of counting assignment
20 Lifted MAP Inference Non-shared MLN w/o self-joins Optimum values lie on extreme points. Uniform Assignment, New Lifted Algorithm: Iterate over uniform assignment of all predicates to find the one that has maximum weight Can be reduced to weighted SAT over predicates Search Space: O(2 n )
21 Experiments L-MWS L-ILP MWS TUFFY ILP 1e+08 L-MWS L-ILP 1e+07 Cost Cost 1e Time in Seconds Time in Seconds Citation Information Extraction MLN
22 Lifted MAP Inference Contribution Inference is domain independent and hence can scale for huge domains No need to develop new solvers (use existing weighted SAT solver like WalkSAT or ILP based) Inference time is guaranteed to be no worse than ground inference (no overhead)!
23 Outline Introduction Lifted MAP Inference for Markov Logic Networks S. Sarkhel, D. Venugopal, P. Singla, V. Gogate AISTATS 14 An Integer Polynomial Programming Based Framework for Lifted MAP Inference S. Sarkhel, D. Venugopal, P. Singla, V. Gogate NIPS 14 New Rules for Domain Independent Lifted MAP Inference H. Mittal, P. Goyal, V. Gogate, P. Singla NIPS 14
24 An Integer Polynomial Programming Based Framework for Lifted MAP Inference Limitations of Lifted MAP [AISTATS 14] Only applicable for formulas that have no shared terms. Do not use many existing research on lifted inference (like the decomposer rule )
25 An Integer Polynomial Programming Based Framework for Lifted MAP Inference R S Consider the MLN: R(x) v S(x), w 1 Δx = 4 Can we compute the weight for assignment [(R, 2), (S, 1)]
26 An Integer Polynomial Programming Based Framework for Lifted MAP Inference R S R S N(f, ω 1 ) = N(f, ω 2 )? No! ω 1 ω 2
27 An Integer Polynomial Programming Based Framework for Lifted MAP Inference R S R S ω 1 ω 2 Solution = Shattering (S, s) is not sufficient. We need more info Which of the (S, s) joins with (R, r)
28 An Integer Polynomial Programming Based Framework for Lifted MAP Inference R S R S S 1 S 1 S 2 S 2 ω 1 ω 2 [(R, 2), (S 1, 1), (S 2, 0)] [(R, 2), (S 1, 0), (S 2, 1)]
29 An Integer Polynomial Programming Based Framework for Lifted MAP Inference Probabilistic theorem proving [1] Advanced lifted inference technique Extended for MAP Inference The weight of an assignment is calculated as: [1] V. Gogate and P. Domingos, Probabilistic Theorem Proving. UAI 11
30 An Integer Polynomial Programming Based Framework for Lifted MAP Inference minimize: subject to: f 0 (x) Ax b u x 0 x Z n Objective function is polynomial in x e.g. f(x 1,x 2,x 3 ) = x x 2 x 3 x 1 x x 2 + 2x 1 x 2 x 3
31 An Integer Polynomial Programming Based Framework for Lifted MAP Inference PTP-MAP performs an exhaustive search over all possible lifted assignments and can be slow To improve is encode as an IPP problem Algorithm 2 runs PTP-MAP schematically and forms the IPP Each variable corresponds to counting assignment
32 An Integer Polynomial Programming Based Framework for Lifted MAP Inference minimize: subject to: f 0 (x) Ax b u x 0 x Z n Constraints are linear Very general problem Not many off-the-shelf software present Difficult to solve!
33 An Integer Polynomial Programming Based Framework for Lifted MAP Inference Solving the IPP problem: Solved by converting to Integer Linear Program The classic method outlined in [2] Convert IPP to 0-1 Polynomial Programming Problem Replace each variable by binary sum expression Simplify Linearize it by adding additional variables ILP can be solved using any ILP solver [2] Lawrence J Watters. Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems. Operations Research, 15(6): , 1967
34 An Integer Polynomial Programming Based Framework for Lifted MAP Inference Solving the IPP problem: Example f(x 1, x 2 ) = x 1 + x 2 x 1 x 2 [0 x 1,x 2 3] x 1 = d 0 (1) + 2d 1 (1), x 2 = d 0 (2) + 2d 1 (2) f(d 0 (1),d 1 (1),d 0 (2),d 1 (2) ) = d 0 (1) + 2d 1 (1) + d 0 (2) + 2d 1 (2) (d 0 (1) + 2d 1 (1) ) (d 0 (2) + 2d 1 (2) ) Replace d 0 (1).d 0 (2) by another variable d 00 Add constraints d (1) 0 + d (2) 0 d 00 1 d (1) 0 d (2) 0 + 2d 00 0 Ensures d 00 = d 0 (1).d 0 (2)
35 Experiments Citation Information Extraction MLN
36 An Integer Polynomial Programming Based Framework for Lifted MAP Inference Contribution Inference time (search space) is no worse than our AISTATS 14 approach Applicable to any normal MLN Provides a framework to plug-in any newly discovered lifting rule
37 Questions?
38 Thank You!
An Integer Polynomial Programming Based Framework for Lifted MAP Inference
An Integer Polynomial Programming Based Framework for Lifted MAP Inference Somdeb Sarkhel, Deepak Venugopal Computer Science Department The University of Texas at Dallas {sxs104721,dxv02}@utdallas.edu
New Rules for Domain Independent Lifted MAP Inference
New Rules for Domain Independent Lifted MAP Inference Happy Mittal, Prasoon Goyal Dept. of Comp. Sci. & Engg. I.I.T. Delhi, Hauz Khas New Delhi, 116, India happy.mittal@cse.iitd.ac.in prasoongoyal13@gmail.com
Fast Lifted MAP Inference via Partitioning
Fast Lifted MAP Inference via Partitioning Somdeb Sarkhel The University of Texas at Dallas Parag Singla I.I.T. Delhi Abstract Vibhav Gogate The University of Texas at Dallas Recently, there has been growing
Probabilistic Theorem Proving. Vibhav Gogate (Joint work with Pedro Domingos)
Probabilistic Theorem Proving Vibhav Gogate (Joint work with Pedro Domingos) Progress to Date First-order variable elimination [Poole, 2003; de Salvo Braz, 2007; etc.] Lifted belief propagation [Singla
Lifted Inference: Exact Search Based Algorithms
Lifted Inference: Exact Search Based Algorithms Vibhav Gogate The University of Texas at Dallas Overview Background and Notation Probabilistic Knowledge Bases Exact Inference in Propositional Models First-order
Lifted Symmetry Detection and Breaking for MAP Inference
Lifted Symmetry Detection and Breaking for MAP Inference Tim Kopp University of Rochester Rochester, NY tkopp@cs.rochester.edu Parag Singla I.I.T. Delhi Hauz Khas, New Delhi parags@cse.iitd.ac.in Henry
StarAI Full, 6+1 pages Short, 2 page position paper or abstract
StarAI 2015 Fifth International Workshop on Statistical Relational AI At the 31st Conference on Uncertainty in Artificial Intelligence (UAI) (right after ICML) In Amsterdam, The Netherlands, on July 16.
Scaling-up Importance Sampling for Markov Logic Networks
Scaling-up Importance Sampling for Markov Logic Networks Deepak Venugopal Department of Computer Science University of Texas at Dallas dxv021000@utdallas.edu Vibhav Gogate Department of Computer Science
Symmetry Breaking for Relational Weighted Model Finding
Symmetry Breaking for Relational Weighted Model Finding Tim Kopp Parag Singla Henry Kautz WL4AI July 27, 2015 Outline Weighted logics. Symmetry-breaking in SAT. Symmetry-breaking for weighted logics. Weighted
Lifted Marginal MAP Inference
Lifted Marginal MAP Inference Vishal Sharma 1, Noman Ahmed Sheikh 2, Happy Mittal 1, Vibhav Gogate 3 and Parag Singla 1 1 IIT Delhi, {vishal.sharma, happy.mittal, parags}@cse.iitd.ac.in 2 IIT Delhi, nomanahmedsheikh@outlook.com
Probabilistic First Order Models for Coreference. Aron Culotta. Information Extraction & Synthesis Lab University of Massachusetts
Probabilistic First Order Models for Coreference Aron Culotta Information Extraction & Synthesis Lab University of Massachusetts joint work with advisor Andrew McCallum Motivation Beyond local representation
Non-Count Symmetries in Boolean & Multi-Valued Prob. Graphical Models
Ankit Anand 1 Ritesh Noothigattu 1 Parag Singla and Mausam Department of CSE Machine Learning Department 1 Department of CSE I.I.T Delhi Carnegie Mellon University I.I.T Delhi Abstract Lifted inference
Unifying Logical and Statistical AI
Unifying Logical and Statistical AI Pedro Domingos Dept. of Computer Science & Eng. University of Washington Joint work with Stanley Kok, Hoifung Poon, Matt Richardson and Parag Singla Overview Motivation
Intelligent Systems (AI-2)
Intelligent Systems (AI-2) Computer Science cpsc422, Lecture 33 Nov, 25, 2015 Slide source: from Pedro Domingos UW & Markov Logic: An Interface Layer for Artificial Intelligence Pedro Domingos and Daniel
Efficient Markov Logic Inference for Natural Language Semantics
Efficient Markov Logic Inference for Natural Language Semantics Islam Beltagy Department of Computer Science The University of Texas at Austin Austin, Texas 78712 beltagy@cs.utexas.edu Raymond J. Mooney
Advanced Machine Learning Techniques for Temporal, Multimedia, and Relational Data
Advanced Machine Learning Techniques for Temporal, Multimedia, and Relational Data Vibhav Gogate The University of Texas at Dallas Many slides courtesy of Pedro Domingos Vibhav Gogate 1 Statistical Relational
Constraint Propagation for Efficient Inference in Markov Logic
Constraint Propagation for Efficient Inference in Markov Logic Tivadar Papai 1 Parag Singla 2 papai@cs.rochester.edu parag@cs.utexas.edu Henry Kautz 1 kautz@cs.rochester.edu 1 University of Rochester,
Fine Grained Weight Learning in Markov Logic Networks
Fine Grained Weight Learning in Markov Logic Networks Happy Mittal, Shubhankar Suman Singh Dept. of Comp. Sci. & Engg. I.I.T. Delhi, Hauz Khas New Delhi, 110016, India happy.mittal@cse.iitd.ac.in, shubhankar039@gmail.com
Combining logic with probability Motivation
Combining logic with probability Motivation is a powerful language to represent complex relational information Probability is the standard way to represent uncertainty in knowledge Combining the two would
The Potential and Challenges of CAD with Equational Constraints for SC-Square
The Potential and Challenges of with Equational Constraints for SC-Square Matthew England (Coventry University) Joint work with: James H. Davenport (University of Bath) 7th International Conference on
Pruning Search Space for Weighted First Order Horn Clause Satisfiability
Pruning Search Space for Weighted First Order Horn Clause Satisfiability Naveen Nair 123, Anandraj Govindan 2, Chander Jayaraman 2, Kiran TVS 2, and Ganesh Ramakrishnan 21 1 IITB-Monash Research Academy,
On First-Order Knowledge Compilation. Guy Van den Broeck
On First-Order Knowledge Compilation Guy Van den Broeck Beyond NP Workshop Feb 12, 2016 Overview 1. Why first-order model counting? 2. Why first-order model counters? 3. What first-order circuit languages?
Sound and Efficient Inference with Probabilistic and Deterministic Dependencies
Sound and Efficient Inference with Probabilistic and Deterministic Dependencies Hoifung Poon Pedro Domingos Department of Computer Science and Engineering University of Washington Seattle, WA 9895-235,
Max-Margin Weight Learning for Markov Logic Networks
In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Part 1, pp. 564-579, Bled, Slovenia, September 2009. Max-Margin Weight Learning
Feedback Loop between High Level Semantics and Low Level Vision
Feedback Loop between High Level Semantics and Low Level Vision Varun K. Nagaraja Vlad I. Morariu Larry S. Davis {varun,morariu,lsd}@umiacs.umd.edu University of Maryland, College Park, MD, USA. Abstract.
Advanced Markov Logic Techniques for Scalable Joint Inference in NLP
Advanced Markov Logic Techniques for Scalable Joint Inference in NLP Deepak Venugopal*, Vibhav Gogate** and Vincent Ng** * The University of Memphis ** The University of Texas at Dallas Outline Motivation
Notes for Lecture 2. Statement of the PCP Theorem and Constraint Satisfaction
U.C. Berkeley Handout N2 CS294: PCP and Hardness of Approximation January 23, 2006 Professor Luca Trevisan Scribe: Luca Trevisan Notes for Lecture 2 These notes are based on my survey paper [5]. L.T. Statement
JOINT PROBABILISTIC INFERENCE OF CAUSAL STRUCTURE
JOINT PROBABILISTIC INFERENCE OF CAUSAL STRUCTURE Dhanya Sridhar Lise Getoor U.C. Santa Cruz KDD Workshop on Causal Discovery August 14 th, 2016 1 Outline Motivation Problem Formulation Our Approach Preliminary
Lifted Probabilistic Inference for Asymmetric Graphical Models
Lifted Probabilistic Inference for Asymmetric Graphical Models Guy Van den Broeck Department of Computer Science KU Leuven, Belgium guy.vandenbroeck@cs.kuleuven.be Mathias Niepert Computer Science and
arxiv: v2 [cs.ai] 27 Jul 2017
Domain Recursion for Lifted Inference with Existential Quantifiers Seyed Mehran Kazemi 1, Angelika Kimmig 2, Guy Van den Broeck 3 and David Poole 1 1 University of British Columbia, {smkazemi,poole}@cs.ubc.ca
Lecture 18: PCP Theorem and Hardness of Approximation I
Lecture 18: and Hardness of Approximation I Arijit Bishnu 26.04.2010 Outline 1 Introduction to Approximation Algorithm 2 Outline 1 Introduction to Approximation Algorithm 2 Approximation Algorithm Approximation
Relational Learning. CS 760: Machine Learning Spring 2018 Mark Craven and David Page.
Relational Learning CS 760: Machine Learning Spring 2018 Mark Craven and David Page www.biostat.wisc.edu/~craven/cs760 1 Goals for the lecture you should understand the following concepts relational learning
Solvers for the Problem of Boolean Satisfiability (SAT) Will Klieber Aug 31, 2011
Solvers for the Problem of Boolean Satisfiability (SAT) Will Klieber 15-414 Aug 31, 2011 Why study SAT solvers? Many problems reduce to SAT. Formal verification CAD, VLSI Optimization AI, planning, automated
Outline. Part 1: Motivation Part 2: Probabilistic Databases Part 3: Weighted Model Counting Part 4: Lifted Inference for WFOMC
Outline Part 1: Motivation Part 2: Probabilistic Databases Part 3: Weighted Model Counting Part 4: Lifted Inference for WFOMC Part 5: Completeness of Lifted Inference Part 6: Quer Compilation Part 7: Smmetric
UCLID: Deciding Combinations of Theories via Eager Translation to SAT. SAT-based Decision Procedures
UCLID: Deciding Combinations of Theories via Eager Translation to SAT Sanjit A. Seshia SAT-based Decision Procedures Input Formula Input Formula Satisfiability-preserving Boolean Encoder Boolean Formula
A.Antonopoulos 18/1/2010
Class DP Basic orems 18/1/2010 Class DP Basic orems 1 Class DP 2 Basic orems Class DP Basic orems TSP Versions 1 TSP (D) 2 EXACT TSP 3 TSP COST 4 TSP (1) P (2) P (3) P (4) DP Class Class DP Basic orems
Exploiting Logical Structure in Lifted Probabilistic Inference
Exploiting Logical Structure in Lifted Probabilistic Inference Vibhav Gogate and Pedro Domingos Computer Science & Engineering University of Washington Seattle, WA 9895, U.S.A. {vgogate,pedrod}@cs.washington.edu
Exploiting Constraints, Sequential Structure, and Knowledge in Markov Logic Networks
Exploiting Constraints, Sequential Structure, and Knowledge in Markov Logic Networks by Tivadar Papai Submitted in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy Supervised
Chapter 7 Propositional Satisfiability Techniques
Lecture slides for Automated Planning: Theory and Practice Chapter 7 Propositional Satisfiability Techniques Dana S. Nau CMSC 722, AI Planning University of Maryland, Spring 2008 1 Motivation Propositional
Outline. Part 1: Motivation Part 2: Probabilistic Databases Part 3: Weighted Model Counting Part 4: Lifted Inference for WFOMC
Outline Part 1: Motivation Part 2: Probabilistic Databases Part 3: Weighted Model Counting Part 4: Lifted Inference for WFOMC Part 5: Completeness of Lifted Inference Part 6: Query Compilation Part 7:
Algebraic Methods. Motivation: Systems like this: v 1 v 2 v 3 v 4 = 1 v 1 v 2 v 3 v 4 = 0 v 2 v 4 = 0
Motivation: Systems like this: v v 2 v 3 v 4 = v v 2 v 3 v 4 = 0 v 2 v 4 = 0 are very difficult for CNF SAT solvers although they can be solved using simple algebraic manipulations Let c 0, c,...,c 2 n
On Parameter Tying by Quantization
On Parameter Tying by Quantization Li Chou, Somdeb Sarkhel Department of Computer Science The University of Texas at Dallas {lkc130030,sxs104721}@utdallas.edu Nicholas Ruozzi Department of Computer Science
Efficient Weight Learning for Markov Logic Networks
Efficient Weight Learning for Markov Logic Networks Daniel Lowd and Pedro Domingos Department of Computer Science and Engineering University of Washington, Seattle WA 98195-2350, USA {lowd,pedrod}@cs.washington.edu
Chapter 7 Propositional Satisfiability Techniques
Lecture slides for Automated Planning: Theory and Practice Chapter 7 Propositional Satisfiability Techniques Dana S. Nau University of Maryland 12:58 PM February 15, 2012 1 Motivation Propositional satisfiability:
Integer Linear Programs
Lecture 2: Review, Linear Programming Relaxations Today we will talk about expressing combinatorial problems as mathematical programs, specifically Integer Linear Programs (ILPs). We then see what happens
Satisifiability and Probabilistic Satisifiability
Satisifiability and Probabilistic Satisifiability Department of Computer Science Instituto de Matemática e Estatística Universidade de São Paulo 2010 Topics Next Issue The SAT Problem The Centrality of
Unifying Logical and Statistical AI
Unifying Logical and Statistical AI Pedro Domingos, Stanley Kok, Hoifung Poon, Matthew Richardson, Parag Singla Department of Computer Science and Engineering University of Washington Seattle, WA 98195-2350,
Evidence-Based Clustering for Scalable Inference in Markov Logic
Evidence-Based Clustering for Scalable Inference in Markov Logic Deepak Venugopal and Vibhav Gogate Computer Science Department The University of Texas at Dallas Richardson, USA {dxv21,vibhav.gogate}@utdallas.edu
Approximation Preserving Reductions
Approximation Preserving Reductions - Memo Summary - AP-reducibility - L-reduction technique - Complete problems - Examples: MAXIMUM CLIQUE, MAXIMUM INDEPENDENT SET, MAXIMUM 2-SAT, MAXIMUM NAE 3-SAT, MAXIMUM
1 Primals and Duals: Zero Sum Games
CS 124 Section #11 Zero Sum Games; NP Completeness 4/15/17 1 Primals and Duals: Zero Sum Games We can represent various situations of conflict in life in terms of matrix games. For example, the game shown
1 Algebraic Methods. 1.1 Gröbner Bases Applied to SAT
1 Algebraic Methods In an algebraic system Boolean constraints are expressed as a system of algebraic equations or inequalities which has a solution if and only if the constraints are satisfiable. Equations
Robust Integer Programming
Robust Integer Programming Technion Israel Institute of Technology Outline. Overview our theory of Graver bases for integer programming (with Berstein, De Loera, Hemmecke, Lee, Romanchuk, Rothblum, Weismantel)
Automorphism Groups of Graphical Models and Lifted Variational Inference
Automorphism Groups of Graphical Models and Lifted Variational Inference Hung Hai Bui Artificial Intelligence Center SRI International bui@ai.sri.com Tuyen N. Huynh Artificial Intelligence Center SRI International
Introduction to Advanced Results
Introduction to Advanced Results Master Informatique Université Paris 5 René Descartes 2016 Master Info. Complexity Advanced Results 1/26 Outline Boolean Hierarchy Probabilistic Complexity Parameterized
Lecture 18: More NP-Complete Problems
6.045 Lecture 18: More NP-Complete Problems 1 The Clique Problem a d f c b e g Given a graph G and positive k, does G contain a complete subgraph on k nodes? CLIQUE = { (G,k) G is an undirected graph with
Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes
Lossless Horizontal Decomposition with Domain Constraints on Interpreted Attributes Ingo Feinerer 1 and Enrico Franconi 2 and Paolo Guagliardo 2 1 Vienna University of Technology 2 Free University of Bozen-Bolzano
Planning as Satisfiability
Planning as Satisfiability Alan Fern * Review of propositional logic (see chapter 7) Planning as propositional satisfiability Satisfiability techniques (see chapter 7) Combining satisfiability techniques
Integer vs. constraint programming. IP vs. CP: Language
Discrete Math for Bioinformatics WS 0/, by A. Bockmayr/K. Reinert,. Januar 0, 0:6 00 Integer vs. constraint programming Practical Problem Solving Model building: Language Model solving: Algorithms IP vs.
Toward Caching Symmetrical Subtheories for Weighted Model Counting
Toward Caching Symmetrical Subtheories for Weighted Model Counting Tim Kopp University of Rochester Rochester, NY Parag Singla Indian Institute of Technology Hauz Khas, New Delhi Henry Kautz University
NP-Complete problems
NP-Complete problems NP-complete problems (NPC): A subset of NP. If any NP-complete problem can be solved in polynomial time, then every problem in NP has a polynomial time solution. NP-complete languages
NP-Completeness. Andreas Klappenecker. [based on slides by Prof. Welch]
NP-Completeness Andreas Klappenecker [based on slides by Prof. Welch] 1 Prelude: Informal Discussion (Incidentally, we will never get very formal in this course) 2 Polynomial Time Algorithms Most of the
Essential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
Automorphism Groups of Graphical Models and Lifted Variational Inference
Automorphism Groups of Graphical Models and Lifted Variational Inference Hung Hai Bui Natural Language Understanding Lab Nuance Communications bui.h.hung@gmail.com Tuyen N. Huynh Artificial Intelligence
Warm-Up Problem. Is the following true or false? 1/35
Warm-Up Problem Is the following true or false? 1/35 Propositional Logic: Resolution Carmen Bruni Lecture 6 Based on work by J Buss, A Gao, L Kari, A Lubiw, B Bonakdarpour, D Maftuleac, C Roberts, R Trefler,
Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width
Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width Christopher De Sa, Ce Zhang, Kunle Olukotun, and Christopher Ré cdesa@stanford.edu, czhang@cs.wisc.edu, kunle@stanford.edu,
Linear integer programming and its application
Linear integer programming and its application Presented by Dr. Sasthi C. Ghosh Associate Professor Advanced Computing & Microelectronics Unit Indian Statistical Institute Kolkata, India Outline Introduction
Stochastic Local Search
Stochastic Local Search International Center for Computational Logic Technische Universität Dresden Germany Stochastic Local Search Algorithms Uninformed Random Walk Iterative Improvement Local Minima
Recursive Random Fields
Daniel Lowd LOWD@CS.WASHINGTON.EDU Pedro Domingos PEDROD@CS.WASHINGTON.EDU Department of Computer Science and Engineering, University of Washington, Seattle, WA 98195-2350, USA Abstract A formula in first-order
Brief Tutorial on Probabilistic Databases
Brief Tutorial on Probabilistic Databases Dan Suciu University of Washington Simons 206 About This Talk Probabilistic databases Tuple-independent Query evaluation Statistical relational models Representation,
Lifted Probabilistic Inference: A Guide for the Database Researcher
Lifted Probabilistic Inference: A Guide for the Database Researcher Eric Gribkoff University of Washington eagribko@cs.uw.edu Dan Suciu University of Washington suciu@cs.uw.edu Guy Van den Broeck UCLA,
Limits to Approximability: When Algorithms Won't Help You. Note: Contents of today s lecture won t be on the exam
Limits to Approximability: When Algorithms Won't Help You Note: Contents of today s lecture won t be on the exam Outline Limits to Approximability: basic results Detour: Provers, verifiers, and NP Graph
NP Complete Problems. COMP 215 Lecture 20
NP Complete Problems COMP 215 Lecture 20 Complexity Theory Complexity theory is a research area unto itself. The central project is classifying problems as either tractable or intractable. Tractable Worst
Weighted Logic. Alan Fern. February 8, Problems with Inconsistency and Monotonicity
Weighted Logic Alan Fern February 8, 2010 1 Problems with Inconsistency and Monotonicity While logic provides an appealing formalism for knowledge representation and reasoning, it is not without drawbacks.
Discriminative Learning of Sum-Product Networks. Robert Gens Pedro Domingos
Discriminative Learning of Sum-Product Networks Robert Gens Pedro Domingos X1 X1 X1 X1 X2 X2 X2 X2 X3 X3 X3 X3 X4 X4 X4 X4 X5 X5 X5 X5 X6 X6 X6 X6 Distributions X 1 X 1 X 1 X 1 X 2 X 2 X 2 X 2 X 3 X 3
Sum-Product Networks. STAT946 Deep Learning Guest Lecture by Pascal Poupart University of Waterloo October 17, 2017
Sum-Product Networks STAT946 Deep Learning Guest Lecture by Pascal Poupart University of Waterloo October 17, 2017 Introduction Outline What is a Sum-Product Network? Inference Applications In more depth
Intro to Theory of Computation
Intro to Theory of Computation LECTURE 25 Last time Class NP Today Polynomial-time reductions Adam Smith; Sofya Raskhodnikova 4/18/2016 L25.1 The classes P and NP P is the class of languages decidable
Translatable Updates of Selection Views under Constant Complement
Translatable Updates of Selection Views under Constant Complement Enrico Franconi and Paolo Guagliardo Free University of Bozen-Bolzano, Italy 4 th September 2014 DEXA 2014, Munich (Germany) KRDB Research
Computational Complexity of Bayesian Networks
Computational Complexity of Bayesian Networks UAI, 2015 Complexity theory Many computations on Bayesian networks are NP-hard Meaning (no more, no less) that we cannot hope for poly time algorithms that
CS 188: Artificial Intelligence. Bayes Nets
CS 188: Artificial Intelligence Probabilistic Inference: Enumeration, Variable Elimination, Sampling Pieter Abbeel UC Berkeley Many slides over this course adapted from Dan Klein, Stuart Russell, Andrew
CS 6505, Complexity and Algorithms Week 7: NP Completeness
CS 6505, Complexity and Algorithms Week 7: NP Completeness Reductions We have seen some problems in P and NP, and we ve talked about space complexity. The Space Hierarchy Theorem showed us that there are
Travelling Salesman Problem
Travelling Salesman Problem Fabio Furini November 10th, 2014 Travelling Salesman Problem 1 Outline 1 Traveling Salesman Problem Separation Travelling Salesman Problem 2 (Asymmetric) Traveling Salesman
Foundations of Artificial Intelligence
Foundations of Artificial Intelligence 31. Propositional Logic: DPLL Algorithm Malte Helmert and Gabriele Röger University of Basel April 24, 2017 Propositional Logic: Overview Chapter overview: propositional
Probabilistic Graphical Models
Probabilistic Graphical Models David Sontag New York University Lecture 6, March 7, 2013 David Sontag (NYU) Graphical Models Lecture 6, March 7, 2013 1 / 25 Today s lecture 1 Dual decomposition 2 MAP inference
Enumeration: logical and algebraic approach
Enumeration: logical and algebraic approach Yann Strozecki Université Paris Sud - Paris 11 Novembre 2011, séminaire ALGO/LIX Introduction to Enumeration Enumeration and logic Enumeration and polynomials
Constructing Markov Logic Networks from First-Order Default Rules
Constructing Markov Logic Networks from First-Order Default Rules Ondřej Kuželka 1, Jesse Davis 2, and Steven Schockaert 1 1 School of Computer Science & Informatics, Cardiff University, UK {KuzelkaO,SchockaertS1}@cardiff.ac.uk
Studies in Solution Sampling
Studies in Solution Sampling Vibhav Gogate and Rina Dechter Donald Bren School of Information and Computer Science, University of California, Irvine, CA 92697, USA. {vgogate,dechter}@ics.uci.edu Abstract
Sampling Algorithms for Probabilistic Graphical models
Sampling Algorithms for Probabilistic Graphical models Vibhav Gogate University of Washington References: Chapter 12 of Probabilistic Graphical models: Principles and Techniques by Daphne Koller and Nir
an efficient procedure for the decision problem. We illustrate this phenomenon for the Satisfiability problem.
1 More on NP In this set of lecture notes, we examine the class NP in more detail. We give a characterization of NP which justifies the guess and verify paradigm, and study the complexity of solving search
Model Counting for Probabilistic Reasoning
Model Counting for Probabilistic Reasoning Beyond NP Workshop Stefano Ermon CS Department, Stanford Combinatorial Search and Optimization Progress in combinatorial search since the 1990s (SAT, SMT, MIP,
Computational Complexity of Inference
Computational Complexity of Inference Sargur srihari@cedar.buffalo.edu 1 Topics 1. What is Inference? 2. Complexity Classes 3. Exact Inference 1. Variable Elimination Sum-Product Algorithm 2. Factor Graphs
Math 267a - Propositional Proof Complexity. Lecture #1: 14 January 2002
Math 267a - Propositional Proof Complexity Lecture #1: 14 January 2002 Lecturer: Sam Buss Scribe Notes by: Robert Ellis 1 Introduction to Propositional Logic 1.1 Symbols and Definitions The language of
Multiway Tables and Integer Programming are Fixed-Parameter Tractable
Multiway Tables and Integer Programming are Fixed-Parameter Tractable Technion Israel Institute of Technology Outline 1. Overview our theory of Graver bases for integer programming (with Berstein, De Loera,
Propositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
Can we measure the difficulty of an optimization problem?
1 / 22 Can we measure the difficulty of an optimization problem? *, Tom Everitt**, and Marcus Hutter*** * Dept. of Electrical and Electronic Engineering The University of Melbourne ** Department of Mathematics
First-Order Knowledge Compilation for Probabilistic Reasoning
First-Order Knowledge Compilation for Probabilistic Reasoning Guy Van den Broeck based on joint work with Adnan Darwiche, Dan Suciu, and many others MOTIVATION 1 A Simple Reasoning Problem...? Probability
Lifted Marginal MAP Inference
Lifted Marginal MAP Inference Vihal Sharma 1, Noman Ahmed Sheikh 2, Happy Mittal 1, Vibhav Gogate 3 and Parag Singla 1 1 IIT Delhi, {vihal.harma, happy.mittal, parag}@ce.iitd.ac.in 2 IIT Delhi, nomanahmedheikh@outlook.com
Just Add Weights: Markov Logic for the Semantic Web
Just Add Weights: Markov Logic for the Semantic Web Pedro Domingos 1, Daniel Lowd 1, Stanley Kok 1, Hoifung Poon 1, Matthew Richardson 2, and Parag Singla 1 1 Department of Computer Science and Engineering
NP-Hardness reductions
NP-Hardness reductions Definition: P is the class of problems that can be solved in polynomial time, that is n c for a constant c Roughly, if a problem is in P then it's easy, and if it's not in P then
Improving Unsatisfiability-based Algorithms for Boolean Optimization
Improving Unsatisfiability-based Algorithms for Boolean Optimization Vasco Manquinho Ruben Martins Inês Lynce IST/INESC-ID, Technical University of Lisbon, Portugal SAT 2010, Edinburgh 1 / 27 Motivation
Bounding the Cost of Search-Based Lifted Inference
Bounding the Cost of Search-Based Lifted Inference David Smith University of Texas At Dallas 800 W Campbell Rd, Richardson, TX 75080 dbs014200@utdallas.edu Abstract Vibhav Gogate University of Texas At