Nonconvex regularization for sparse neural networks
From MaRDI portal
Publication:2168678
Recommendations
- Nonconvex Sparse Regularization for Deep Neural Networks and Its Optimality
- Non-convex sparse regularisation
- Neural network for a class of sparse optimization with L₀-regularization
- SparseNet: coordinate descent with nonconvex penalties
- \(L_{1/2}\) regularization methods for weights sparsification of neural networks
- Nonparametric sparsity and regularization
- Transformed \(\ell_1\) regularization for learning sparse deep neural networks
- Enhanced Sparsity by Non-Separable Regularization
- Nonconvex sparse regularization and splitting algorithms
Cites work
- Analysis of multi-stage convex relaxation for sparse regularization
- Approximation by Combinations of ReLU and Squared ReLU Ridge Functions With <inline-formula> <tex-math notation="LaTeX">$\ell^1$ </tex-math> </inline-formula> and <inline-formula>
- Approximation hardness for a class of sparse optimization problems
- Banach space representer theorems for neural networks and ridge splines
- Breaking the curse of dimensionality with convex neural networks
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Greedy function approximation: A gradient boosting machine.
- Harmonic analysis of neural networks
- Hinging hyperplanes for regression, classification, and function approximation
- scientific article; zbMATH DE number 5937962 (Why is no real title available?)
- Integral combinations of Heavisides
- Integral representation of nonconvex functionals defined on measures
- Inverse problems in spaces of measures
- Limiting aspects of nonconvex \({TV}^{\phi}\) models
- Linear convergence of accelerated conditional gradient algorithms in spaces of measures
- Nearly unbiased variable selection under minimax concave penalty
- Neural network with unbounded activation functions is universal approximator
- New lower semicontinuity results for nonconvex functionals defined on measures
- On the linear convergence rates of exchange and continuous methods for total variation minimization
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Regularized \(M\)-estimators with nonconvexity: statistical and algorithmic theory for local optima
- Relaxation for a class of nonconvex functionals defined on measures
- SparseNet: coordinate descent with nonconvex penalties
- Sparsest piecewise-linear regression of one-dimensional data
- The alternating descent conditional gradient method for sparse inverse problems
- The Barron space and the flow-induced function spaces for neural network models
- The gap between theory and practice in function approximation with deep neural networks
- Transformed \(\ell_1\) regularization for learning sparse deep neural networks
- Universal approximation bounds for superpositions of a sigmoidal function
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- ℓ1 Regularization in Infinite Dimensional Feature Spaces
Cited in
(9)- Learning nonlocal regularization operators
- Transformed \(\ell_1\) regularization for learning sparse deep neural networks
- scientific article; zbMATH DE number 6378124 (Why is no real title available?)
- Nonconvex Sparse Regularization for Deep Neural Networks and Its Optimality
- Deep Learning as Sparsity-Enforcing Algorithms
- Optimization of sparsity-constrained neural networks as a mixed integer linear program
- Nonconvex regularization for sparse neural networks
- First-order methods for nonsmooth nonconvex functional constrained optimization with or without Slater points
- Optimal regularization for a data source
This page was built for publication: Nonconvex regularization for sparse neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168678)
