Open problem: The most significant open problem in the area of graph matching at large is to theoretically justify the success of a natural and commonly used convex relaxation.
Statement
Open problem: The most significant open problem in the area of graph matching at large is to theoretically justify the success of a natural and commonly used convex relaxation. Impossibility Results for Planted Matching Problems Yihong Wu (joint work with Jian Ding, Jiaming Xu, Dana Yang, Haoyu Wang and Israel Yolou)
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.