A
Anton Chechetka
Researcher at Carnegie Mellon University
Publications - 10
Citations - 279
Anton Chechetka is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Time complexity & Graphical model. The author has an hindex of 6, co-authored 10 publications receiving 276 citations.
Papers
More filters
Proceedings ArticleDOI
No-commitment branch and bound search for distributed constraint optimization
Anton Chechetka,Katia Sycara +1 more
TL;DR: The algorithm, called NCBB, is branch and bound search with modifications for efficiency in a multiagent setting, which has significantly better performance than another polynomial-space algorithm, ADOPT, on random graph coloring problems.
Proceedings Article
Efficient Principled Learning of Thin Junction Trees
Anton Chechetka,Carlos Guestrin +1 more
TL;DR: This work presents the first truly polynomial algorithm for PAC-learning the structure of bounded-treewidth junction trees - an attractive subclass of probabilistic graphical models that permits both the compact representation of probability distributions and efficient exact inference.
Proceedings Article
An Any-space Algorithm for Distributed Constraint Optimization.
Anton Chechetka,Katia Sycara +1 more
TL;DR: Modifications to a polynomial-space branch-and-bound based algorithm, called NCBB, for solving DCOP are presented that make the algorithm any-space, which enables a continuous tradeoff between O(bp) space, O (bp) time complexity and O(p + bp) space and O (bHp) time.
Proceedings Article
Focused Belief Propagation for Query-Specific Inference
Anton Chechetka,Carlos Guestrin +1 more
TL;DR: Given the variable that the user actually cares about, this work shows how to quantify edge importance in graphical models and to significantly speed up inference by focusing computation on important parts of the model.
Proceedings ArticleDOI
A decentralized variable ordering method for distributed constraint optimization
Anton Chechetka,Katia Sycara +1 more
TL;DR: This work presents a variable ordering algorithm, which is both decentralized and makes use of pseudo-trees, thus exploiting the problem structure when possible and allowing to apply ADOPT to domains, where global information is unavailable, and find solutions more efficiently.