2 problems

Basic g-composable schedule conjecture. For each $n$, every minimax-optimal stepsize schedule solving

Let $h_{\circ}^{(n)}$ denote the primitive stepsize schedule generated by Definition, let $\Call{ConPP}$ denote the concatenation operation, and let $\mathbf 1$ be the all-ones vec…