Hyper-parameter optimization for support vector machines using stochastic gradient descent and dual coordinate descent
We developed a gradient-based method to optimize the regularization hyper-parameter, C, for support vector machines in a bilevel optimization framework. On the upper level, we optimized the hyper-parameter C to minimize the prediction loss on validation data using stochastic gradient descent. On the...
Saved in:
Main Authors: | W.e.i. Jiang, Sauleh Siddiqui |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2020
|
Subjects: | |
Online Access: | https://doaj.org/article/f82d7c90108a43cf8c8fd9386871b915 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Real-time algorithms for the bilevel double-deck elevator dispatching problem
by: Janne Sorsa
Published: (2019) -
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in Rn
by: CláudioP. Santiago, et al.
Published: (2019) -
Special issue on: Computational discrete optimization
by: ArieM.C.A. Koster, et al.
Published: (2020) -
A robust basic cyclic scheduling problem
by: Idir Hamaz, et al.
Published: (2018) -
A MIP framework for non-convex uniform price day-ahead electricity auctions
by: Mehdi Madani, et al.
Published: (2017)