Distributed Tree Decomposition with Privacy

Tree Decomposition of Graphical Models is a well known method for mapping a graph into a tree, that is commonly used to speed up solving many problems. However, in a distributed case, one may have to respect the privacy rules (a subset of variables may have to be kept secret in a peer), and the initial network architecture (no link can be dynamically added). In this context, we propose a new distributed method, based on token passing and local elections, that shows performances (in the jointree quality) close to the state of the art Bucket Elimination in a centralized case (i.e. when used without these two restrictions). Until now, the state of the art in a distributed context was using a Depth-First traversal with a clever heuristic. It is outperformed by our method on two families of problems sharing the small-world property.

[1]  Philippe Jégou,et al.  Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs , 2007, IJCAI.

[2]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[3]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

[4]  Rina Dechter,et al.  Diagnosing Tree-Decomposable Circuits , 1995, IJCAI.

[5]  Stéphane Grumbach,et al.  Distributed tree decomposition of graphs and applications to verification , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[6]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[7]  Geoffrey J. Gordon,et al.  Distributed Planning in Hierarchical Factored MDPs , 2002, UAI.

[8]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[9]  Christian Bessiere,et al.  Asynchronous Breadth-First Search DCOP Algorithm , 2008 .

[10]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[11]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[12]  Gregory M. Provan,et al.  Automated Benchmark Model Generators for Model-Based Diagnostic Inference , 2007, IJCAI.

[13]  Boi Faltings,et al.  Privacy Guarantees through Distributed Constraint Satisfaction , 2008, 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.

[14]  François Goasdoué,et al.  Distributed Reasoning in a Peer-to-Peer Setting , 2004, ECAI.

[15]  A. Darwiche,et al.  The Language of Search , 2007, J. Artif. Intell. Res..

[16]  Roberto Rossi,et al.  Synthesizing Filtering Algorithms for Global Chance-Constraints , 2009, CP.

[17]  Boi Faltings,et al.  Incentive Compatible Multiagent Constraint Optimization , 2005, WINE.

[18]  Rina Dechter,et al.  Tractable Structures for Constraint Satisfaction Problems , 2006, Handbook of Constraint Programming.

[19]  Lucas Bordeaux,et al.  Knowledge Compilation Properties of Tree-of-BDDs , 2007, AAAI.

[20]  Boi Faltings,et al.  Coordinating Logistics Operations with Privacy Guarantees , 2011, IJCAI.

[21]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[22]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[23]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[24]  Javier Larrosa,et al.  Unifying tree decompositions for reasoning in graphical models , 2005, Artif. Intell..

[25]  Engelbert Mephu Nguifo,et al.  A Knowledge Discovery Framework for Learning Task Models from User Interactions in Intelligent Tutoring Systems , 2009, ArXiv.

[26]  Pedro Meseguer,et al.  Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees , 2010, Fundam. Informaticae.

[27]  Georg Gottlob,et al.  Heuristic Methods for Hypertree Decomposition , 2008, MICAI.

[28]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[29]  Simon de Givry,et al.  Exploiting Problem Structure for Solution Counting , 2009, CP.