Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time
<|reference_start|>Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time: In this paper, we study the optimality gap between two-layer ReLU networks regularized with weight decay and their convex relaxations. We show that when the training data is random, the relative optimality gap between the original problem and its relaxation can be bounded by a factor of O(log n^0.5), where n is the number of training samples. A simple application leads to a tractable polynomial-time algorithm that is guaranteed to solve the original non-convex problem up to a logarithmic factor. Moreover, under mild assumptions, we show that local gradient methods converge to a point with low training loss with high probability. Our result is an exponential improvement compared to existing results and sheds new light on understanding why local gradient methods work well.<|reference_end|>
@article{kim2024convex,
    title={Convex Relaxations of ReLU Neural Networks Approximate Global Optima in
  Polynomial Time},
    author={Sungyoon Kim, Mert Pilanci},
    journal={arXiv preprint arXiv:2402.03625},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.03625},
    primaryClass={cs.LG math.OC}
}