skip to main content
research-article

The Limits of SDP Relaxations for General-Valued CSPs

Published:23 May 2018Publication History
Skip Abstract Section

Abstract

It has been shown that for a general-valued constraint language Γ the following statements are equivalent: (1) any instance of VCSP(Γ) can be solved to optimality using a constant level of the Sherali-Adams LP hierarchy, (2) any instance of VCSP(Γ) can be solved to optimality using the third level of the Sherali-Adams LP hierarchy, and (3) the support of Γ satisfies the “bounded width condition” (i.e., it contains weak near-unanimity operations of all arities).

We show that if the support of Γ violates the bounded width condition then not only is VCSP(Γ) not solved by a constant level of the Sherali-Adams LP hierarchy, but it also requires linear levels of the Lasserre SDP hierarchy (also known as the sum-of-squares SDP hierarchy). For Γ corresponding to linear equations in an Abelian group, this result follows from existing work on inapproximability of Max-CSPs. By a breakthrough result of Lee, Raghavendra, and Steurer [STOC’15], our result implies that for any Γ whose support violates the bounded width condition no SDP relaxation of polynomial size solves VCSP(Γ).

We establish our result by proving that various reductions preserve exact solvability by the Lasserre SDP hierarchy (up to a constant factor in the level of the hierarchy). Our results hold for general-valued constraint languages (i.e., sets of functions on a fixed finite domain that take on rational or infinite values) and thus also hold in notable special cases of { 0, ∞ }-valued languages (CSPs), {0, 1}-valued languages (Min-CSPs/Max-CSPs), and Q-valued languages (finite-valued CSPs).

References

  1. Sanjeev Arora, Satish Rao, and Umesh V. Vazirani. 2009. Expander flows, geometric embeddings and graph partitioning. Journal of the ACM 56, 2 (2009), Article 5. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Albert Atserias, Andrei Bulatov, and Anuj Dawar. 2009. Affine systems of equations and counting infinitary logic. Theoretical Computer Science 410, 18 (2009), 1666--1683. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Albert Atserias and Joanna Ochremiak. 2017. Proof complexity meets algebra. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP’17). 110:1--110:14.Google ScholarGoogle Scholar
  4. Libor Barto and Marcin Kozik. 2014. Constraint satisfaction problems solvable by local consistency methods. Journal of the ACM 61, 1 (2014), Article 3. Article No. 3 Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Libor Barto and Marcin Kozik. 2016. Robustly solvable constraint satisfaction problems. SIAM Journal on Computing 45, 4 (2016), 1646--1669.Google ScholarGoogle ScholarCross RefCross Ref
  6. Libor Barto, Marcin Kozik, and Todd Niven. 2009. The CSP dichotomy holds for digraphs with no sources and no sinks (a positive answer to a conjecture of Bang-Jensen and Hell). SIAM Journal on Computing 38, 5 (2009), 1782--1802. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Manuel Bodirsky. 2008. Constraint satisfaction problems with infinite templates. In Complexity of Constraints. Lecture Notes in Computer Science, Vol. 5250. Springer, 196--228.Google ScholarGoogle Scholar
  8. Andrei Bulatov. 2006. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM 53, 1 (2006), 66--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Andrei Bulatov. 2017. A dichotomy theorem for nonuniform CSP. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS’17). IEEE, Los Alamitos, CA, 319--330.Google ScholarGoogle ScholarCross RefCross Ref
  10. Andrei Bulatov, Peter Jeavons, and Andrei Krokhin. 2005. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 3 (2005), 720--742. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Andrei A. Bulatov. 2011. Complexity of conservative constraint satisfaction problems. ACM Transactions on Computational Logic 12, 4 (2011), Article 24. Article 24 Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Andrei A. Bulatov. 2016. Graphs of relational structures: Restricted types. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’16). ACM, New York, NY, 642--651. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Siu On Chan. 2016. Approximation resistance from pairwise-independent subgroups. Journal of the ACM 63, 3 (2016), Article 27. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Siu On Chan, James R. Lee, Prasad Raghavendra, and David Steurer. 2016. Approximate constraint satisfaction requires large LP relaxations. Journal of the ACM 63, 4 (2016), 34:1--34:22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Moses Charikar, Konstantin Makarychev, and Yury Makarychev. 2009. Integrality gaps for Sherali-Adams relaxations. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC’09). ACM, New York, NY, 283--292. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Eden Chlamtáč and Madhur Tulsiani. 2012. Convex relaxations and integrality gaps. In Handbook on Semidefinite, Conic and Polynomial Optimization, M. F. Anjos and J. B. Lasserre (Eds.). International Series in Operations Research and Management Science, Vol. 166. Springer, 139--169.Google ScholarGoogle Scholar
  17. David A. Cohen, Martin C. Cooper, Páidí Creed, Peter Jeavons, and Stanislav Živný. 2013. An algebraic theory of complexity for discrete optimisation. SIAM Journal on Computing 42, 5 (2013), 915--1939.Google ScholarGoogle ScholarCross RefCross Ref
  18. Víctor Dalmau and Andrei A. Krokhin. 2013. Robust satisfiability for CSPs: Hardness and algorithmic results. ACM Transactions on Computation Theory 5, 4 (2013), Article 15. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Anuj Dawar and Pengming Wang. 2017. Lasserre lower bounds and definability of semidefinite programming for CSPs. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’17). ACM, New York, NY, 1--12.Google ScholarGoogle ScholarCross RefCross Ref
  20. Tomás Feder and Moshe Y. Vardi. 1998. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Comput. 28, 1 (1998), 57--104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Bernd Gärtner and Jiří Matoušek. 2012. Approximation Algorithms and Semidefinite Programming. Springer Science 8 Business Media. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Mrinal Kanti Ghosh and Madhur Tulsiani. 2017. From weak to strong LP gaps for all CSPs. In Proceedings of the 32nd Annual IEEE Conference on Computational Complexity (CCC’17).Google ScholarGoogle Scholar
  23. Michel X. Goemans and David P. Williamson. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 6 (1995), 1115--1145. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Dima Grigoriev. 2001. Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity. Theoretical Computer Science 259, 1--2 (2001), 613--622.Google ScholarGoogle ScholarCross RefCross Ref
  25. Venkatesan Guruswami and Yuan Zhou. 2012. Tight bounds on the approximability of almost-satisfiable horn SAT and exact hitting set. Theory of Computing 8, 1 (2012), 239--267.Google ScholarGoogle ScholarCross RefCross Ref
  26. Johan Håstad. 2001. Some optimal inapproximability results. Journal of the ACM 48, 4 (2001), 798--859. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Pavol Hell and Jaroslav Nešetřil. 1990. On the complexity of -coloring. Journal of Combinatorial Theory, Series B 48, 1 (1990), 92--110. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Pavol Hell and Jaroslav Nešetřil. 2008. Colouring, constraint satisfaction, and complexity. Computer Science Review 2, 3 (2008), 143--163. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Peter Jeavons, David A. Cohen, and Marc Gyssens. 1997. Closure properties of constraints. Journal of the ACM 44, 4 (1997), 527--548. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. David R. Karger, Rajeev Motwani, and Madhu Sudan. 1998. Approximate graph coloring by semidefinite programming. Journal of the ACM 45, 2 (1998), 246--265. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Vladimir Kolmogorov, Andrei A. Krokhin, and Michal Rolínek. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing 46, 3 (2017), 1087--1110.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Vladimir Kolmogorov, Johan Thapper, and Stanislav Živný. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing 44, 1 (2015), 1--36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Pravesh K. Kothari, Raghu Meka, and Prasad Raghavendra. 2017. Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC’17). 590--603. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Marcin Kozik, Andrei Krokhin, Matt Valeriote, and Ross Willard. 2015. Characterizations of several Maltsev conditions. Algebra Universalis 73, 3--4 (2015), 205--224.Google ScholarGoogle ScholarCross RefCross Ref
  35. Marcin Kozik and Joanna Ochremiak. 2015. Algebraic properties of valued constraint satisfaction problem. In Automata, Languages, and Programming. Lecture Notes in Computer Science, Vol. 9134. Springer, 846--858.Google ScholarGoogle Scholar
  36. Gábor Kun, Ryan O’Donnell, Suguru Tamaki, Yuichi Yoshida, and Yuan Zhou. 2012. Linear programming, width-1 CSPs, and robust satisfaction. In Proceedings of 3rd Innovations in Theoretical Computer Science (ITCS’12). ACM, New York, NY, 484--495. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Benoit Larose and Lázló Zádori. 2007. Bounded width problems and algebras. Algebra Universalis 56, 3--4 (2007), 439--466.Google ScholarGoogle ScholarCross RefCross Ref
  38. Jean B. Lasserre. 2001. Global optimization with polynomials and the problem of moments. SIAM Journal on Optimization 11, 3 (2001), 796--817. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Jean B. Lasserre. 2002. An explicit equivalent positive semidefinite program for nonlinear 0-1 programs. SIAM Journal on Optimization 12, 3 (2002), 756--769. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Monique Laurent. 2003. A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research 28, 3 (2003), 470--496. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. James R. Lee, Prasad Raghavendra, and David Steurer. 2014. Lower bounds on the size of semidefinite programming relaxations. arXiv:1411.6317. http://arxiv.org/abs/1411.6317Google ScholarGoogle Scholar
  42. James R. Lee, Prasad Raghavendra, and David Steurer. 2015. Lower bounds on the size of semidefinite programming relaxations. In Proceedings of the 47th Symposium on Theory of Computing (STOC’15). 567--576. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. László Lovász and Alexander Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization 1, 2 (1991), 166--190.Google ScholarGoogle ScholarCross RefCross Ref
  44. Miklós Maróti and Ralph McKenzie. 2008. Existence theorems for weakly symmetric operations. Algebra Universalis 59, 3--4 (2008), 463--489.Google ScholarGoogle ScholarCross RefCross Ref
  45. Ryan O’Donnell and Yuan Zhou. 2013. Approximability and proof complexity. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’13). 1537--1556. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Prasad Raghavendra and David Steurer. 2017. Personal communication.Google ScholarGoogle Scholar
  47. Thomas J. Schaefer. 1978. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC’78). ACM, New York, NY, 216--226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Grant Schoenebeck. 2008. Linear level Lasserre lower bounds for certain k-CSPs. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS’08). IEEE, Los Alamitos, CA, 593--602. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. H. D. Sherali and W. P. Adams. 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics 3, 3 (1990), 411--430. Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. Johan Thapper and Stanislav Živný. 2016. The complexity of finite-valued CSPs. Journal of the ACM 63, 4 (2016), Article 37. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. Johan Thapper and Stanislav Živný. 2017. The power of Sherali-Adams relaxations for general-valued CSPs. SIAM Journal on Computing 46, 4 (2017), 1241--1279.Google ScholarGoogle ScholarCross RefCross Ref
  52. Johan Thapper and Stanislav Živný. 2017. The limits of SDP relaxations for general-valued CSPs. In Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS’17). ACM, New York, NY, 1--12.Google ScholarGoogle ScholarCross RefCross Ref
  53. Madhur Tulsiani. 2009. CSP gaps and reductions in the Lasserre hierarchy. In Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC’09). ACM, New York, NY, 303--312. Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. Lieven Vandenberghe and Stephen P. Boyd. 1996. Semidefinite programming. SIAM Review 38, 1 (1996), 49--95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. Vijay V. Vazirani. 2013. Approximation Algorithms. Springer Science 8 Business Media.Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. David P. Williamson and David B. Shmoys. 2011. The Design of Approximation Algorithms. Cambridge University Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. Mihalis Yannakakis. 1991. Expressing combinatorial optimization problems by linear programs. Journal on Computer System Science 43, 3 (1991), 441--466.Google ScholarGoogle ScholarCross RefCross Ref
  58. Dmitriy Zhuk. 2017. The proof of CSP dichotomy conjecture. In Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS’17). IEEE, Los Alamitos, CA, 331--342.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. The Limits of SDP Relaxations for General-Valued CSPs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!