Skip to Main content Skip to Navigation
Conference papers

Guarantees for Approximate Incremental SVMs

Abstract : Assume a teacher provides examples one by one. An approximate incremental SVM computes a sequence of classifiers that are close to the true SVM solutions computed on the successive incremental training sets. We show that simple algorithms can satisfy an averaged accuracy criterion with a computational cost that scales as well as the best SVM algorithms with the number of examples. Finally, we exhibit some experiments highlighting the benefits of joining fast incremental optimization and curriculum and active learning (Schon and Cohn, 2000; Bordes et al., 2005; Bengio et al., 2009).
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00750932
Contributor : Antoine Bordes <>
Submitted on : Monday, November 12, 2012 - 4:51:36 PM
Last modification on : Friday, January 8, 2021 - 5:34:11 PM
Long-term archiving on: : Wednesday, February 13, 2013 - 3:46:49 AM

File

usunier10aistats.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00750932, version 1

Citation

Nicolas Usunier, Antoine Bordes, Léon Bottou. Guarantees for Approximate Incremental SVMs. 13th International Conference on Artificial Intelligence and Statistics, May 2010, Chia Laguna Resort, Sardinia, Italy. pp.884-891. ⟨hal-00750932⟩

Share

Metrics

Record views

313

Files downloads

102