The gradient-flow global-maximization conjecture for image-labeling assignments
Statement
Let be the space of admissible assignment matrices, let be the flow generated by the specified gradient-flow equation, and let denote the set of global maxima of the objective over the relevant closure. For any fixed data and prior data, except on a subset of of measure zero, the flow approaches this set in the following sense: for every , there exists and such that
Gradient-flow global-maximization conjecture. For any data and prior data, up to a subset of of measure zero, the flow approximates a global maximum in the stated sense.
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.