Bridgeout: stochastic bridge regularization for deep neural networks
Not on the map. Why?
Abstract (arXiv)
A major challenge in training deep neural networks is overfitting, i.e. inferior performance on unseen test examples compared to performance on training examples. To reduce overfitting, stochastic regularization methods have shown superior performance compared to deterministic weight penalties on a number of image recognition tasks. Stochastic methods such as Dropout and Shakeout, in expectation, are equivalent to imposing a ridge and elastic-net penalty on the model parameters, respectively. However, the choice of the norm of weight penalty is problem dependent and is not restricted to L1,L2. Therefore, in this paper we propose the Bridgeout stochastic regularization technique and prove that it is equivalent to an Lq penalty on the weights, where the norm q can be learned as a hyperparameter from data. Experimental results show that Bridgeout results in sparse model weights, improved gradients and superior classification performance compared to Dropout and Shakeout on synthetic and real datasets.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1; 2025: 2.
4 papers.
- 2024Decoupled Weight Decay for Any p Normcited by 4
- 2021Adaptive Low-Rank Regularization with Damping Sequences to Restrict Lazy Weights in Deep Networkscited by 0
- 2025Global Minimizers of ℓp-Regularized Objectives Yield the Sparsest ReLU Neural Networkscited by 0
- 2025On the Mathematical Impossibility of Safe Universal Approximatorscited by 0
- 2025On the Mathematical Impossibility of Safe Universal Approximators3 Jul 2025
- 2025Global Minimizers of ℓp-Regularized Objectives Yield the Sparsest ReLU Neural Networks27 May 2025
- 2024Decoupled Weight Decay for Any p Norm16 Apr 2024
- 2021Adaptive Low-Rank Regularization with Damping Sequences to Restrict Lazy Weights in Deep Networks17 Jun 2021