Polynomial-based kernel reproduced gradient descent for stochastic optimization
From MaRDI portal
Cites work
- A resilient distributed optimization algorithm based on consensus of multi-agent system against two attack scenarios
- Adaptive subgradient methods for online learning and stochastic optimization
- An event-triggering algorithm for decentralized stochastic optimization over networks
- Balancing rates and variance via adaptive batch-size for stochastic optimization problems
- Deterministic error bounds for kernel-based learning techniques under bounded noise
- Generalization properties of hyper-RKHS and its applications
- Introductory lectures on convex optimization. A basic course.
- Just interpolate: kernel ``ridgeless regression can generalize
- Large scale online kernel learning
- Learning strategies for underwater robot autonomous manipulation control
- Lectures on convex optimization
- Minimizing finite sums with the stochastic average gradient
- Nonconvex optimization with inertial proximal stochastic variance reduction gradient
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- Some methods of speeding up the convergence of iteration methods
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- The spectrum of kernel random matrices
- Trajectory tracking control for underactuated autonomous vehicles via adaptive dynamic programming
This page was built for publication: Polynomial-based kernel reproduced gradient descent for stochastic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031568)
