揭示深度模型损失曲率的玻璃态结构,提出更优优化方法。
Curvature in the Looking-Glass: Optimal Methods to Exploit Curvature of Expectation in the Loss Landscape
- 通过分析ReLU带来的梯度间断,发现损失曲率呈类玻璃态分布
- 提出算法Alice,可识别对训练最有影响的曲率项并动态调整步长
- 新方法适用于模型剪枝与量化,提升优化稳定性
在高级优化任务中,利用损失曲面的局部拓扑结构是核心挑战。标准假设下,海森矩阵通常用于近似损失曲率,但本文发现其在梯度不连续处(常见于深度网络)表现不佳。针对含大量线性整流单元(ReLU)的架构,我们提出新理论框架:每个ReLU形成参数边界,跨越时引发伪随机梯度扰动,这些扰动共同构成类似非晶固体的玻璃态结构。通过估计梯度变化密度,可界定参数移动时损失的变化范围。文中推导出最优核函数与样本分布,以从常规梯度评估中近似玻璃密度;同时给出包含玻璃与海森项的拟牛顿步长最优修正方案,并揭示了使用Nesterov加速梯度更新时的某些精确性质。算法Alice用于实验验证,确定不同架构与数据集下最具影响力的曲率项。额外防护机制引入扩展版步长约束,增强稳定性,超越Adam功能。该理论与实验工具为未来模型剪枝、量化等任务提供了新视角。
原文摘要 · Abstract (English)
Harnessing the local topography of the loss landscape is a central challenge in advanced optimization tasks. By accounting for the effect of potential parameter changes, we can alter the model more efficiently. Contrary to standard assumptions, we find that the Hessian does not always approximate loss curvature well, particularly near gradient discontinuities, which commonly arise in deep learning architectures. We present a new conceptual framework to understand how curvature of expected changes in loss emerges in architectures with many rectified linear units. Each ReLU creates a parameter boundary that, when crossed, induces a pseudorandom gradient perturbation. Our derivations show how these discontinuities combine to form a glass-like structure, similar to amorphous solids that contain microscopic domains of strong, but random, atomic alignment. By estimating the density of the resulting gradient variations, we can bound how the loss may change with parameter movement. Our analysis includes the optimal kernel and sample distribution for approximating glass density from ordinary gradient evaluations. We also derive the optimal modification to quasi-Newton steps that incorporate both glass and Hessian terms, as well as certain exactness properties that are possible with Nesterov-accelerated gradient updates. Our algorithm, Alice, tests these techniques to determine which curvature terms are most impactful for training a given architecture and dataset. Additional safeguards enforce stable exploitation through step bounds that expand on the functionality of Adam. These theoretical and experimental tools lay groundwork to improve future efforts (e.g., pruning and quantization) by providing new insight into the loss landscape.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。