The following pages link to SGD-QN (Q31238):
Displaying 18 items.
- An online AUC formulation for binary classification (Q408053) (← links)
- Robust adaptive learning of feedforward neural networks via LMI optimizations (Q448312) (← links)
- Hierarchical linear support vector machine (Q454434) (← links)
- Minimizing finite sums with the stochastic average gradient (Q517295) (← links)
- Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization (Q523576) (← links)
- Stochastic gradient descent with Barzilai-Borwein update step for SVM (Q1749833) (← links)
- SABRINA: a stochastic subspace majorization-minimization algorithm (Q2095568) (← links)
- Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications (Q2128484) (← links)
- An adaptive Hessian approximated stochastic gradient MCMC method (Q2128489) (← links)
- ASD+M: automatic parameter tuning in stochastic optimization and on-line learning (Q2179079) (← links)
- Optimization for deep learning: an overview (Q2218095) (← links)
- A globally convergent incremental Newton method (Q2349125) (← links)
- Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines (Q2359408) (← links)
- A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics (Q2418132) (← links)
- Stochastic quasi-Newton with line-search regularisation (Q2664231) (← links)
- (Q2880947) (← links)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
- Large-Scale Machine Learning with Stochastic Gradient Descent (Q3298463) (← links)
