Saddle-point avoidance conjecture for backtracking gradient descent
Saddle-point avoidance conjecture for backtracking gradient descent
Let be a function that is near its critical points, and let be the sequence generated by the Backtracking GD method from an initial point . A saddle-point avoidance conjecture asserts that the set of initial points for which the cluster points of contain a saddle point has Lebesgue measure . The preceding discussion presents this as a heuristic expectation based on the conjectured long-run stabilization of Backtracking GD to a finite union of Standard GD processes; whether saddle-point avoidance holds under the stated and local assumptions remains open.
Sources & referencesView supporting material
Primary source
Tuyen Trung Truong and Tuan Hang Nguyen, “Backtracking gradient descent method for general C^1 functions, with applications to Deep Learning”, arXiv:1808.05160 (2019).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.