For over-parameterized shallow neural networks, explain and prove when local-search methods such as gradient descent can reach global optimality despite high-dimensional…
Statement
For over-parameterized shallow neural networks, explain and prove when local-search methods such as gradient descent can reach global optimality despite high-dimensional nonconvex training, and characterize the resulting optimization landscape.
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.