Problems
No problem here has yet been reviewed by a person.
The paper nearly settles the tradeoff between the size of a set system over [n] and its number of full chains, an extremal question raised by Johnson, Leader and Russell as a counterpart to Sperner-type results, and linked by recent work…
Nesterov's accelerated gradient method (1983) is a cornerstone of optimization, yet whether its iterates themselves converge to a minimizer, rather than just the function values, stayed open for over forty years. Jang and Ryu resolve it in…
Yun, Sra and Jadbabaie posed as a COLT 2021 open question whether, for well-conditioned symmetric matrices, the operators encoding the expected iterate of single-shuffle SGD, random-reshuffle SGD and gradient descent on a quadratic finite…
Prim-Dijkstra routing interpolates between a minimum spanning tree and a shortest-path tree, and has been used and improved in VLSI physical design since the early 1990s, but the complexity of the terminal-only Manhattan decision problem…
Does two-terminal reliability, the probability that s still reaches t when edges fail independently, admit a fully polynomial-time randomised approximation scheme? Asked explicitly in Kannan's 1994 survey and left open while the…