One-dimensional worst-case conjecture for gradient descent on composed operator classes
One-dimensional worst-case conjecture for gradient descent on composed operator classes
Let and be the operator-composed function classes defined in the source, and let and denote their subclasses with one-dimensional and scalar linear operator . One-dimensional worst-case conjecture. The worst-case performances are attained in these one-dimensional subclasses:
The conjecture is motivated by the authors' numerical experiments, but the supplied text gives no proof or resolution.
Sources & referencesView supporting material
Primary source
Nizar Bousselmi, Julien M. Hendrickx and François Glineur, “Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems”, arXiv:2302.08781 (2024).
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.