Near-Optimal Convex Optimization with Lazy Second-Order Oracles
The paper claims a tight iteration bound for convex optimization when Hessians are only queried every `m` steps.
It proves a lower bound of `Ω(m + m^(1/7) ε^(-2/7))` using a block zero-chain construction. It then gives a method matching that rate up to logarithmic factors. The result improves a prior upper bound with a worse dependence on `m`. Source: ArXiv · AI/CL/LG's note.
It proves a lower bound of `Ω(m + m^(1/7) ε^(-2/7))` using a block zero-chain construction. It then gives a method matching that rate up to logarithmic factors. The result improves a prior upper bound with a worse dependence on `m`. Source: ArXiv · AI/CL/LG's note.
score 4