Non Asymptotic Bounds for Optimization via Online Multiplicative Stochastic Gradient Descent.
Riddhiman BhattacharyaPublished in: CoRR (2021)
Keyphrases
- stochastic gradient descent
- online algorithms
- worst case
- stochastic gradient
- lower bound
- online learning
- asymptotically optimal
- least squares
- average case
- matrix factorization
- step size
- number of iterations required
- loss function
- upper bound
- random forests
- weight vector
- global optimization
- regularization parameter
- importance sampling
- learning algorithm
- support vector machine
- multiple kernel learning
- optimization algorithm
- np hard
- cost function
- image restoration
- e learning