A Convexity-dependent Two-Phase Training Algorithm for Deep Neural Networks

📝 Original Info

• Title: A Convexity-dependent Two-Phase Training Algorithm for Deep Neural Networks
• ArXiv ID: 2510.25366
• Date: 2025-10-29
• Authors: ** 정보 제공되지 않음 (논문에 저자 정보가 명시되지 않음) **

📝 Abstract

The key task of machine learning is to minimize the loss function that measures the model fit to the training data. The numerical methods to do this efficiently depend on the properties of the loss function. The most decisive among these properties is the convexity or non-convexity of the loss function. The fact that the loss function can have, and frequently has, non-convex regions has led to a widespread commitment to non-convex methods such as Adam. However, a local minimum implies that, in some environment around it, the function is convex. In this environment, second-order minimizing methods such as the Conjugate Gradient (CG) give a guaranteed superlinear convergence. We propose a novel framework grounded in the hypothesis that loss functions in real-world tasks swap from initial non-convexity to convexity towards the optimum. This is a property we leverage to design an innovative two-phase optimization algorithm. The presented algorithm detects the swap point by observing the gradient norm dependence on the loss. In these regions, non-convex (Adam) and convex (CG) algorithms are used, respectively. Computing experiments confirm the hypothesis that this simple convexity structure is frequent enough to be practically exploited to substantially improve convergence and accuracy.

💡 Deep Analysis

📄 Full Content

Reference