Heavy-Tailed Behavior and Search Algorithms for SAT Tang Yi Based on [1][2][3]

Slides:



Advertisements
Similar presentations
Rapidly Exploring Random Trees Data structure/algorithm to facilitate path planning Developed by Steven M. La Valle (1998) Originally designed to handle.
Advertisements

Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.
ABSTRACT We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space. Our first result.
Sensitivity Analysis In deterministic analysis, single fixed values (typically, mean values) of representative samples or strength parameters or slope.
1 Backdoor Sets in SAT Instances Ryan Williams Carnegie Mellon University Joint work in IJCAI03 with: Carla Gomes and Bart Selman Cornell University.
1 Restart search techniques for Employee Timetabling Problems Amnon Meisels And Eliezer Kaplansky Ben-Gurion University.
Dynamic Restarts Optimal Randomized Restart Policies with Observation Henry Kautz, Eric Horvitz, Yongshao Ruan, Carla Gomes and Bart Selman.
On the Potential of Automated Algorithm Configuration Frank Hutter, University of British Columbia, Vancouver, Canada. Motivation for automated tuning.
Programming with Constraints Jia-Huai You. Subject of Study Constraint Programming (CP) studies the computational models, languages, and systems for solving.
Constraint Systems Laboratory Oct 21, 2004Guddeti: MS thesis defense1 An Improved Restart Strategy for Randomized Backtrack Search Venkata P. Guddeti Constraint.
Statistical Regimes Across Constrainedness Regions Carla P. Gomes, Cesar Fernandez Bart Selman, and Christian Bessiere Cornell University Universitat de.
CP Formal Models of Heavy-Tailed Behavior in Combinatorial Search Hubie Chen, Carla P. Gomes, and Bart Selman
Solvable problem Deviation from best known solution [%] Percentage of test runs ERA RDGR RGR LS Over-constrained.
Next 10 years of Constraint Programming: The Science of Constraints Carla P. Gomes Cornell University CP 2006.
A Constraint Satisfaction Problem (CSP) is a combinatorial decision problem defined by a set of variables, a set of domain values for these variables,
AAAI00 Austin, Texas Generating Satisfiable Problem Instances Dimitris Achlioptas Microsoft Carla P. Gomes Cornell University Henry Kautz University of.
Short XORs for Model Counting: From Theory to Practice Carla P. Gomes, Joerg Hoffmann, Ashish Sabharwal, Bart Selman Cornell University & Univ. of Innsbruck.
1 Backdoors To Typical Case Complexity Ryan Williams Carnegie Mellon University Joint work with: Carla Gomes and Bart Selman Cornell University.
Correlation Immune Functions and Learning Lisa Hellerstein Polytechnic Institute of NYU Brooklyn, NY Includes joint work with Bernard Rosell (AT&T), Eric.
Carla P. Gomes CS4700 CS 4700: Foundations of Artificial Intelligence Carla P. Gomes Module: Instance Hardness and Phase Transitions.
CP-AI-OR-02 Gomes & Shmoys 1 The Promise of LP to Boost CSP Techniques for Combinatorial Problems Carla P. Gomes David Shmoys
1 CS 4700: Foundations of Artificial Intelligence Carla P. Gomes Module: Satisfiability (Reading R&N: Chapter 7)
1 Understanding Problem Hardness: Recent Developments and Directions Bart Selman Cornell University.
Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University, USA SAT 2010 Conference Edinburgh, July 2010 An Empirical Study of Optimal Noise and Runtime.
Controlling Computational Cost: Structure and Phase Transition Carla Gomes, Scott Kirkpatrick, Bart Selman, Ramon Bejar, Bhaskar Krishnamachari Intelligent.
Foundations of Constraint Processing, Fall 2004 November 18, 2004More on BT search1 Foundations of Constraint Processing CSCE421/821, Fall 2004:
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla Gomes and Bart Selman Cornell University Muri Meeting March 2002.
Sampling Combinatorial Space Using Biased Random Walks Jordan Erenrich, Wei Wei and Bart Selman Dept. of Computer Science Cornell University.
Hardness-Aware Restart Policies Yongshao Ruan, Eric Horvitz, & Henry Kautz IJCAI 2003 Workshop on Stochastic Search.
Distributions of Randomized Backtrack Search Key Properties: I Erratic behavior of mean II Distributions have “heavy tails”.
Distributed Constraint Optimization Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University A4M33MAS.
Energy Efficient Routing and Self-Configuring Networks Stephen B. Wicker Bart Selman Terrence L. Fine Carla Gomes Bhaskar KrishnamachariDepartment of CS.
© J. Christopher Beck Lecture 13: Modeling in Constraint Programming.
Parallel Algorithm Configuration Frank Hutter, Holger Hoos, Kevin Leyton-Brown University of British Columbia, Vancouver, Canada.
CP Summer School Modelling for Constraint Programming Barbara Smith 2. Implied Constraints, Optimization, Dominance Rules.
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems by Carla P. Gomes, Bart Selman, Nuno Crato and henry Kautz Presented by Yunho.
Explorations in Artificial Intelligence Prof. Carla P. Gomes Module Logic Representations.
UBC March The Evergreen Project: How To Learn From Mistakes Caused by Blurry Vision in MAX-CSP Solving Karl J. Lieberherr Northeastern University.
Computer Vision Lecture 6. Probabilistic Methods in Segmentation.
Prabhas Chongstitvatana1 Las Vegas algorithm The answer obtained is always correct but sometime no answer. Modified deterministic algorithm by using randomness.
Constraints and Search Toby Walsh Cork Constraint Computation Centre (4C) Logic & AR Summer School, 2002.
Quality of LP-based Approximations for Highly Combinatorial Problems Lucian Leahu and Carla Gomes Computer Science Department Cornell University.
/425 Declarative Methods - J. Eisner 1 Random 3-SAT  sample uniformly from space of all possible 3- clauses  n variables, l clauses Which are.
4.3 More Discrete Probability Distributions NOTES Coach Bridges.
Patrick De Causmaecker Stefaan Haspeslagh Tommy Messelis.
Accelerating Random Walks Wei Wei and Bart Selman.
1 Combinatorial Problems in Cooperative Control: Complexity and Scalability Carla P. Gomes and Bart Selman Cornell University Muri Meeting June 2002.
Balance and Filtering in Structured Satisfiability Problems Henry Kautz University of Washington joint work with Yongshao Ruan (UW), Dimitris Achlioptas.
Hypergraph Partitioning With Fixed Vertices Andrew E. Caldwell, Andrew B. Kahng and Igor L. Markov UCLA Computer Science Department
ERA on an over-constrained problem A Constraint-Based System for Hiring & Managing Graduate Teaching Assistants Ryan Lim, Praveen Venkata Guddeti, and.
Shortcomings of Traditional Backtrack Search on Large, Tight CSPs: A Real-world Example Venkata Praveen Guddeti and Berthe Y. Choueiry The combination.
Formal Complexity Analysis of RoboFlag Drill & Communication and Computation in Distributed Negotiation Algorithms in Distributed Negotiation Algorithms.
Stochastic Local Search Algorithms for DNA word Design Dan C Tulpan, Holger H Hoos, and Anne Condon Summerized by Ji-Eun Yun.
Basics of Multivariate Probability
Ch3.5 Hypergeometric Distribution
Random variables (r.v.) Random variable
Consistency Methods for Temporal Reasoning
Constraint Propagation
Prabhas Chongstitvatana
Extensions to BT Search Foundations of Constraint Processing
Extensions to BT Search Foundations of Constraint Processing
by Xiang Mao and Qin Chen
Extensions to BT Search Foundations of Constraint Processing
Extensions to BT Search Foundations of Constraint Processing
Additional notes on random variables
Additional notes on random variables
Bernoulli Trials Two Possible Outcomes Trials are independent.
Extensions to BT Search Foundations of Constraint Processing
The Geometric Distributions
Introduction to Probability: Solutions for Quizzes 4 and 5
Presentation transcript:

Heavy-Tailed Behavior and Search Algorithms for SAT Tang Yi Based on [1][2][3]

Heavy-Tailed Distribution P[X > x] ~ Cx –α, as x → ∞, 0 0 is a constant independent of x A general class of distributions with power law tails

Cost Distribution of Backtrack Search

Why Heavy-tailed distributions occur in backtrack search Critically constrained variables : Some variables are hard to find good values. If they are set, the values of the other variables are largely determined. Small-world: a small number of global constraints combined with a large number of local connections

Heavy-Tails on the left-hand side of the distribution

Rapid Randomized Restarts(1) Exploit any significant probability mass early on in the distribution. Reduce the variance in runtime and the probability of failure of the search procedure. Suitable cutoff will increase the efficiency of the search.

Rapid Randomized Restarts(2) Run the procedure up to a fixed number of choice points c (the cut off);if the procedure finds a solution or proves that no solution exists,then RRR also found a solution and stops;otherwise restart the backtrack procedure from the beginning for another c decision events, and so on.

RRR speed up backtrack search

Other related results on empirical data No truly heavy-tailed behavior found in randomized systematic search algorithms for SAT(Satz-Rand) Four issues needed to research in these algorithms (1) Occurrence of Stagnation Behavior (2) Detecting Stagnation Behavior (3)Robustness of Performance w.r.t Noise Setting (4)Automatic and Robust Tuning of Parameters

Formal Model: Abstract Tree Search Model Balanced Tree Model: no heavy-tails Imbalanced Tree Model: heavy-tails and restarts Bounded Imbalanced Model: the closest match to heavy-tailed behavior as observed in practice.

Discussion The Heavy-tailed behavior can lead to better search techniques. Not all the available search algorithms can result heavy-tailed phenomena. The study largely based on empirical data, New formal models are needed to help to find new strategy.

Reference [1] Carla Gomes, Bart Selman, Nuno Crato, and Henry Kautz.Heavy- Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. J. of Automated Reasoning, Vol. 24(1/2), pages , 2000, available at [2] Hubie Chen, Carla Gomes, and Bart Selman Formal Models of Heavy-tailed Behavior in Combinatorial Search.. In Principles and Practices of Constraint Programming (CP-01). Lecture Notes in Computer Science 2239,Springer 2001, available at [3] Holger H. Hoos:Heavy-Tailed Behaviour in Randomised Systematic Search Algorithms for SAT? (Technical Report TR Department of Computer Science, University of British Columbia, 1999) available at