Timezone: »
Poster
CPR for CSPs: A Probabilistic Relaxation of Constraint Propagation
Luis E Ortiz
This paper proposes constraint propagation relaxation (CPR), a probabilistic approach to classical constraint propagation that provides another view on the whole parametric family of survey propagation algorithms SP(ρ), ranging from belief propagation (ρ = 0) to (pure) survey propagation(ρ = 1). More importantly, the approach elucidates the implicit, but fundamental assumptions underlying SP(ρ), thus shedding some light on its effectiveness and leading to applications beyond k-SAT.
Author Information
Luis E Ortiz (University of Michigan - Dearborn)
More from the Same Authors
-
2014 Workshop: NIPS Workshop on Transactional Machine Learning and E-Commerce »
David Parkes · David H Wolpert · Jennifer Wortman Vaughan · Jacob D Abernethy · Amos Storkey · Mark Reid · Ping Jin · Nihar Bhadresh Shah · Mehryar Mohri · Luis E Ortiz · Robin Hanson · Aaron Roth · Satyen Kale · Sebastien Lahaie -
2014 Poster: Causal Strategic Inference in Networked Microfinance Economies »
Mohammad T Irfan · Luis E Ortiz -
2014 Poster: Computing Nash Equilibria in Generalized Interdependent Security Games »
Hau Chan · Luis E Ortiz -
2014 Spotlight: Causal Strategic Inference in Networked Microfinance Economies »
Mohammad T Irfan · Luis E Ortiz -
2009 Poster: Sparse and Locally Constant Gaussian Graphical Models »
Jean Honorio · Luis E Ortiz · Dimitris Samaras · Nikos Paragios · Rita Goldstein -
2006 Poster: Game Theoretic Algorithms for Protein-DNA binding »
Luis Perez-Breva · Luis E Ortiz · Chen-Hsiang Yeang · Tommi Jaakkola -
2006 Spotlight: Game Theoretic Algorithms for Protein-DNA binding »
Luis Perez-Breva · Luis E Ortiz · Chen-Hsiang Yeang · Tommi Jaakkola