English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Trading Convexity for Scalability

Collobert, R., Sinz, F., Weston, J., & Bottou, L. (2007). Trading Convexity for Scalability. In Large Scale Kernel Machines (pp. 275-300). Cambridge, MA, USA: MIT Press.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Collobert, R, Author
Sinz, F1, Author           
Weston, J2, Author           
Bottou, L, Author
Bottou, Editor
L., Editor
Chapelle, O., Editor
DeCoste, D., Editor
Weston, J., Editor
Affiliations:
1Research Group Computational Vision and Neuroscience, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497805              
2Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              

Content

show
hide
Free keywords: -
 Abstract: Convex learning algorithms, such as Support Vector Machines (SVMs), are often seen as highly desirable because they offer strong practical properties and are amenable to theoretical analysis. However, in this work we show how nonconvexity can provide scalability advantages over convexity. We show how concave-convex programming can be applied to produce (i) faster SVMs where training errors are no longer support vectors, and (ii) much faster Transductive SVMs.

Details

show
hide
Language(s):
 Dates: 2007-09
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Large Scale Kernel Machines
Source Genre: Book
 Creator(s):
Affiliations:
Publ. Info: Cambridge, MA, USA : MIT Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 275 - 300 Identifier: -