A Commentary on "Breaking Row and Column Symmetries in Matrix Models"
The CP 2002 paper entitled "Breaking Row and Column Symmetries in Matrix Models" by Flener et al. (https://link.springer.com/chapter/10.1007%2F3-540-46135-3_31) describes some of the first work for identifying and analyzing row and column symmetry in matrix models and for efficiently and effectively dealing with such symmetry using static symmetry-breaking ordering constraints. This commentary provides a retrospective on that work and highlights some of the subsequent work on the topic.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Efficient MCMC Sampling for Bayesian Matrix Factorization by Breaking Posterior Symmetries
Bayesian low-rank matrix factorization techniques have become an essential tool for relational data analysis and matrix completion. A standard approach is to assign zero-mean Gaussian priors on the columns or rows of fac…
Matrix CompletionMatrix Factorization / DecompositionThe Complexity of Symmetry Breaking Beyond Lex-Leader
Symmetry breaking is a widely popular approach to enhance solvers in constraint programming, such as those for SAT or MIP. Symmetry breaking predicates (SBPs) typically impose an order on variables and single out the lex…
Graph GenerationBreaking the Symmetries of Indistinguishable Objects
Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn from a set of unlabelled objects, and t…
validLifted Symmetry Detection and Breaking for MAP Inference
Symmetry breaking is a technique for speeding up propositional satisfiability testing by adding constraints to the theory that restrict the search space while preserving satisfiability. In this work, we extend symmetry b…
Relational ReasoningSymmetry DetectionBreaking Symmetries in Graph Search with Canonizing Sets
There are many complex combinatorial problems which involve searching for an undirected graph satisfying given constraints. Such problems are often highly challenging because of the large number of isomorphic representat…