Optimizing Cox Models with Stochastic Gradient Descent: Theoretical Foundations and Practical Guidances
<|reference_start|>Optimizing Cox Models with Stochastic Gradient Descent: Theoretical Foundations and Practical Guidances: Optimizing Cox regression and its neural network variants poses substantial computational challenges in large-scale studies. Stochastic gradient descent (SGD), known for its scalability in model optimization, has recently been adapted to optimize Cox models. Unlike its conventional application, which typically targets a sum of independent individual loss, SGD for Cox models updates parameters based on the partial likelihood of a subset of data. Despite its empirical success, the theoretical foundation for optimizing Cox partial likelihood with SGD is largely underexplored. In this work, we demonstrate that the SGD estimator targets an objective function that is batch-size-dependent. We establish that the SGD estimator for the Cox neural network (Cox-NN) is consistent and achieves the optimal minimax convergence rate up to a polylogarithmic factor. For Cox regression, we further prove the $\sqrt{n}$-consistency and asymptotic normality of the SGD estimator, with variance depending on the batch size. Furthermore, we quantify the impact of batch size on Cox-NN training and its effect on the SGD estimator's asymptotic efficiency in Cox regression. These findings are validated by extensive numerical experiments and provide guidance for selecting batch sizes in SGD applications. Finally, we demonstrate the effectiveness of SGD in a real-world application where GD is unfeasible due to the large scale of data.<|reference_end|>
@article{zeng2024optimizing,
    title={Optimizing Cox Models with Stochastic Gradient Descent: Theoretical
  Foundations and Practical Guidances},
    author={Lang Zeng, Weijing Tang, Zhao Ren, Ying Ding},
    journal={arXiv preprint arXiv:2408.02839},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.02839},
    primaryClass={stat.ML cs.LG}
}