Sciweavers

1206 search results - page 2 / 242
» Convergence analysis of online algorithms
Sort
View
NIPS
2001
13 years 6 months ago
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...
Roni Khardon, Dan Roth, Rocco A. Servedio
NIPS
2008
13 years 6 months ago
Convergence and Rate of Convergence of a Manifold-Based Dimension Reduction Algorithm
We study the convergence and the rate of convergence of a local manifold learning algorithm: LTSA [13]. The main technical tool is the perturbation analysis on the linear invarian...
Andrew Smith, Xiaoming Huo, Hongyuan Zha
FOCM
2008
140views more  FOCM 2008»
13 years 5 months ago
Online Gradient Descent Learning Algorithms
This paper considers the least-square online gradient descent algorithm in a reproducing kernel Hilbert space (RKHS) without explicit regularization. We present a novel capacity i...
Yiming Ying, Massimiliano Pontil
PAA
2008
13 years 5 months ago
Online nonparametric discriminant analysis for incremental subspace learning and recognition
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...
Bogdan Raducanu, Jordi Vitrià
JMLR
2006
131views more  JMLR 2006»
13 years 5 months ago
Incremental Support Vector Learning: Analysis, Implementation and Applications
Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM ...
Pavel Laskov, Christian Gehl, Stefan Krüger, ...