A Complete Algorithms
–Neural Information Processing Systems
In Section B, we provide some preliminaries. In Section C, we provide sparsity analysis. We show convergence analysis in Section D. In Section E, we show how to combine the sparsity, convergence, running time all together. In Section F, we show correlation between sparsity and spectral gap of Hessian in neural tangent kernel. In Section G, we discuss how to generalize our result to quantum setting.
Neural Information Processing Systems
Feb-10-2025, 13:56:10 GMT