Stochastic functions learning from distribution-driven data: generalization bound and algorithms
From MaRDI portal
Cites work
- Advanced Lectures on Machine Learning
- Compactness in function spaces
- Convex optimization theory.
- First-order and stochastic optimization methods for machine learning
- Foundations of machine learning
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Incremental constraint projection methods for variational inequalities
- Introduction to stochastic programming.
- Learning Theory
- Lectures on Stochastic Programming
- On Compactness in Functional Analysis
- Robust Stochastic Approximation Approach to Stochastic Programming
- Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm
- Stochastic Approximation Proximal Method of Multipliers for Convex Stochastic Programming
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
This page was built for publication: Stochastic functions learning from distribution-driven data: generalization bound and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7355261)