Globally Optimal Training of Neural Networks with Threshold Activation Functions
Tolga Ergen, Halil Ibrahim Gulluk, Jonathan Lacotte, Mert Pilanci
摘要
Threshold activation functions are highly preferable in neural networks due to their efficiency in hardware implementations. Moreover, their mode of operation is more interpretable and resembles that of biological neurons. However, traditional gradient based algorithms such as Gradient Descent cannot be used to train the parameters of neural networks with threshold activations since the activation function has zero gradient except at a single non-differentiable point. To this end, we study weight decay regularized training problems of deep neural networks with threshold activations. We first show that regularized deep threshold network training problems can be equivalently formulated as a standard convex optimization problem, which parallels the LASSO method, provided that the last hidden layer width exceeds a certain threshold. We also derive a simplified convex optimization formulation when the dataset can be shattered at a certain layer of the network. We corroborate our theoretical results with various numerical experiments.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Path Regularization: A Convexity and Sparsity Inducing Regularization for Parallel ReLU NetworksTolga Ergen, Mert PilanciNeurIPS 2023 · 被引用 21 次
- Convex Approximation of Two-Layer ReLU Networks for Hidden State Differential PrivacyRob Romijnders, Antti KoskelaNeurIPS 2025 · 被引用 2 次
- Parallel Deep Neural Networks Have Zero Duality GapYifei Wang, Tolga Ergen, Mert PilanciICLR 2023 · 被引用 1 次
- Fixing the NTK: From Neural Network Linearizations to Exact Convex ProgramsRajat Vadiraj Dwaraknath, Tolga Ergen, Mert PilanciNeurIPS 2023 · 被引用 1 次
它引用的顶会 Paper11
- Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer NetworksMert Pilanci, Tolga ErgenICML 2020 · 被引用 142 次
- Revealing the Structure of Deep Neural Networks via Convex DualityTolga Ergen, Mert PilanciICML 2021 · 被引用 77 次
- Vector-output ReLU Neural Network Problems are Copositive Programs: Convex Analysis of Two Layer Networks and Polynomial-time AlgorithmsArda Sahiner, Tolga Ergen, John M. Pauly, Mert PilanciICLR 2021 · 被引用 45 次
- Unraveling Attention via Convex Duality: Analysis and Interpretations of Vision TransformersArda Sahiner, Tolga Ergen, Batu Ozturkler, John M. Pauly 等ICML 2022 · 被引用 36 次
- Global Optimality Beyond Two Layers: Training Deep ReLU Networks via Convex ProgramsTolga Ergen, Mert PilanciICML 2021 · 被引用 35 次
相关 Paper
- Deep Weight Factorization: Sparse Learning Through the Lens of Artificial SymmetriesChris Kolb, Tobias Weber, Bernd Bischl, David RügamerICLR 2025
- Exploring The Loss Landscape Of Regularized Neural Networks Via Convex DualitySungyoon Kim, Aaron Mishkin, Mert PilanciICLR 2025
- On the Overlooked Pitfalls of Weight Decay and How to Mitigate Them: A Gradient-Norm PerspectiveZeke Xie, Zhiqiang Xu, Jingzhao Zhang, Issei Sato 等NeurIPS 2023 · 被引用 38 次
- Improving Deep Learning Speed and Performance Through Synaptic Neural BalanceAntonios Alexos, Ian Domingo, Pierre BaldiAAAI 2025
- Sparsifying Networks via Subdifferential InclusionSagar Verma, Jean-Christophe PesquetICML 2021 · 被引用 15 次
