Convergence analyses on sparse feedforward neural networks via group lasso regularization
From MaRDI portal
Publication:2292940
Recommendations
- Deterministic convergence analysis via smoothing group Lasso regularization and adaptive momentum for Sigma-Pi-Sigma neural network
- Global convergence analysis of sparse regular nonconvex optimization problems
- Batch gradient method with smoothing \(L_{1/2}\) regularization for training of feedforward neural networks
- Neural network for constrained nonsmooth optimization using Tikhonov regularization
- scientific article; zbMATH DE number 2202150
Cites work
- A Penalty-Function Approach for Pruning Feedforward Neural Networks
- Convergence analysis of online gradient method for BP neural networks
- Convergence of an online gradient method for feedforward neural networks with stochastic inputs.
- Delay-dependent stability analysis of numerical methods for stochastic delay differential equations
- Deterministic convergence of an online gradient method for neural networks
- Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
- scientific article; zbMATH DE number 3595804 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 1392848 (Why is no real title available?)
- scientific article; zbMATH DE number 5240897 (Why is no real title available?)
- Large-scale machine learning with stochastic gradient descent
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Machine Learning Methods in the Environmental Sciences
- Model Selection and Estimation in Regression with Grouped Variables
- On Different Facets of Regularization Theory
- Online learning and online convex optimization
- Optimization theory and methods. Nonlinear programming
- Pattern recognition and machine learning.
- Smoothing methods for nonsmooth, nonconvex minimization
- Smoothing nonlinear conjugate gradient method for image restoration using nonsmooth nonconvex minimization
- The Adaptive Lasso and Its Oracle Properties
- Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
Cited in
(11)- Deterministic convergence analysis via smoothing group Lasso regularization and adaptive momentum for Sigma-Pi-Sigma neural network
- An empirical study into finding optima in stochastic optimization of neural networks
- Equivalent method of evaluating mechanical properties of perforated Ni-based single crystal plates using artificial neural networks
- Predictive analytics for customer repurchase: interdisciplinary integration of buy till you die modeling and machine learning
- Modeling a stochastic age-structured capital system with Poisson jumps using neural networks
- Global convergence analysis of sparse regular nonconvex optimization problems
- Batch gradient method with smoothing \(L_{1/2}\) regularization for training of feedforward neural networks
- Linearly constrained nonsmooth optimization for training autoencoders
- Boundedness and convergence analysis of a pi-sigma neural network based on online gradient method and sparse optimization
- A gradient-based learning method with smoothing group L₀ regularization for interval perceptron and interval weights
- Group sparse optimization for learning predictive state representations
This page was built for publication: Convergence analyses on sparse feedforward neural networks via group lasso regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292940)
