Globally Optimal Training of Neural Networks with Threshold Activation Functions
Tolga Ergen, Halil Ibrahim Gulluk, Jonathan Lacotte, Mert Pilanci
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 47189ef2-1fdc-4ff9-bd23-e73abe44e3b5Cited by top-tier papers4
- Path Regularization: A Convexity and Sparsity Inducing Regularization for Parallel ReLU NetworksTolga Ergen, Mert PilanciNeurIPS 2023 · 21 citations
- Convex Approximation of Two-Layer ReLU Networks for Hidden State Differential PrivacyRob Romijnders, Antti KoskelaNeurIPS 2025 · 2 citations
- Parallel Deep Neural Networks Have Zero Duality GapYifei Wang, Tolga Ergen, Mert PilanciICLR 2023 · 1 citation
- Fixing the NTK: From Neural Network Linearizations to Exact Convex ProgramsRajat Vadiraj Dwaraknath, Tolga Ergen, Mert PilanciNeurIPS 2023 · 1 citation
Builds on11
- Neural Networks are Convex Regularizers: Exact Polynomial-time Convex Optimization Formulations for Two-layer NetworksMert Pilanci, Tolga ErgenICML 2020 · 142 citations
- Revealing the Structure of Deep Neural Networks via Convex DualityTolga Ergen, Mert PilanciICML 2021 · 77 citations
- 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 citations
- Unraveling Attention via Convex Duality: Analysis and Interpretations of Vision TransformersArda Sahiner, Tolga Ergen, Batu Ozturkler, John M. Pauly et al.ICML 2022 · 36 citations
- Global Optimality Beyond Two Layers: Training Deep ReLU Networks via Convex ProgramsTolga Ergen, Mert PilanciICML 2021 · 35 citations
Related papers
- 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 et al.NeurIPS 2023 · 38 citations
- 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 citations
