Lauritzen's score matching estimability conjecture
Statement
Let be a graph with vertices, and let be the sample dimension. The graph is -estimable when its score matching estimator exists with probability one.
Lauritzen's conjecture. The graph is -estimable if and only if
This conjecture proposed a purely numerical characterization of the score matching threshold. It is refuted by a graph counterexample in the paper.
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.