A multivariate adaptive gradient algorithm with reduced tuning efforts
From MaRDI portal
Recommendations
Cites work
- A literature survey of benchmark functions for global optimisation problems
- A New Class of Incremental Gradient Methods for Least Squares Problems
- A Stochastic Approximation Method
- Adaptive subgradient methods for online learning and stochastic optimization
- Analysis and design of optimization algorithms via integral quadratic constraints
- Batched Stochastic Gradient Descent with Weighted Sampling
- Convergence of the RMSProp deep learning method with penalty for nonconvex optimization
- Introductory lectures on convex optimization. A basic course.
- Smoothing neural network for L₀ regularized optimization problem with general convex constraints
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
- Tunability: importance of hyperparameters of machine learning algorithms
This page was built for publication: A multivariate adaptive gradient algorithm with reduced tuning efforts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488713)