Arjevani et al.'s lower-bound conjecture for polynomial iterations
Let be a degree- monic real polynomial such that . Let be any polynomial of degree , and let . Then there exists such that
Arjevani et al.'s lower-bound conjecture. For every such , , and , some satisfies the stated spectral-radius lower bound. This conjecture concerns tight lower bounds for stationary polynomial methods, and the surrounding paper proves it; the source does not provide further status evidence in the candidate metadata.
References
Primary source
Noah Golowich, Sarath Pattathil and Constantinos Daskalakis, “Tight last-iterate convergence rates for no-regret learning in multi-player games”, arXiv:2010.13724 (2020).
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
No solutions have been posted yet.