CTJLSVM: Componentwise Triple Jump Acceleration for Training Linear SVM
author:
Chun-Nan Hsu,
AIIA Lab, Academia Sinica
Description
The triple jump extrapolation method is an effective approximation of Aitken’s acceleration for accelerating the convergence of many machine learning algorithms that can be formulated as fixedpoint iteration. In the remainder of this abstract, we briefly review the general idea of the triple jump method and then describe how to apply it to accelerate stochastic gradient descent (SGD) for training linear support vector machines (SVM).
You might be experiencing some problems with Your Video player.
| Slides | |
| 0:00 | CTJLSVM: Componentwise Triple Jump Acceleration for Training Linear SVM |
| 0:42 | Outline (1) |
| 0:54 | Outline (2) |
| 0:58 | Outline (3) |
| 1:01 | Outline (4) |
| 1:03 | Outline - Triple Jump Extrapolation |
| 1:04 | Aitken’s Acceleration (1) |
| 2:00 | Aitken’s Acceleration (2) |
| 3:07 | Triple Jump Extrapolation (1) |
| 3:36 | Triple Jump Extrapolation (2) |
| 4:23 | Triple Jump GIS |
| 5:14 | Global and Componentwise Extrapolation (1) |
| 6:14 | Global and Componentwise Extrapolation (2) |
| 6:39 | Componentwise Triple Jump (1) |
| 6:52 | Componentwise Triple Jump (2) |
| 7:51 | Outline - Application to Linear SVM |
| 7:53 | SGD for Linear SVM |
| 8:55 | Accelerating SGD with CTJ (1) |
| 9:13 | Accelerating SGD with CTJ (2) |
| 10:22 | Accelerating SGD with CTJ (3) |
| 10:56 | Outline - Implementation |
| 10:58 | Parameter Settings (1) |
| 12:06 | Parameter Settings (2) |
| 12:13 | Parameter Settings (3) |
| 12:22 | Stopping Condition |
| 13:15 | Outline - Discussion |
| 13:16 | Key Tricks (1) |
| 13:42 | Key Tricks (2) |
| 14:09 | CTJ accelerates SGD |
| 14:32 | CTJ takes no extra time |
| 14:59 | CTJ is less sensitive to C |
| 15:18 | Performance tuning (1) |
| 15:40 | Performance tuning (2) |
| 17:03 | Wild vs. Linear Track (1) |
| 18:45 | Wild vs. Linear Track (2) |
| 18:52 | “Tricks” that we didn’t do |
| 22:14 | CTJLSVM can handle large data |
| 24:19 | Final Words (1) |
| 24:40 | Final Words (2) |
| 24:55 | Final Words (3) |
| 25:32 | Final Words (4) |
| 25:42 | Thank you for your attention! |
| 28:31 | - Questions |
| 28:32 | - Questions |
| 29:25 | - Questions |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Related content
Visitors who watched this lecture also watched...
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !


