Sciweavers

599 search results - page 30 / 120
» Online learning by ellipsoid method
Sort
View
PAA
2008
13 years 7 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
2008
137views more  JMLR 2008»
13 years 7 months ago
Online Learning of Complex Prediction Problems Using Simultaneous Projections
We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the prob...
Yonatan Amit, Shai Shalev-Shwartz, Yoram Singer
NETWORKING
2007
13 years 9 months ago
Reinforcement Learning-Based Load Shared Sequential Routing
We consider event dependent routing algorithms for on-line explicit source routing in MPLS networks. The proposed methods are based on load shared sequential routing in which load ...
Fariba Heidari, Shie Mannor, Lorne Mason
CVPR
2007
IEEE
14 years 9 months ago
OPTIMOL: automatic Online Picture collecTion via Incremental MOdel Learning
A well-built dataset is a necessary starting point for advanced computer vision research. It plays a crucial role in evaluation and provides a continuous challenge to stateof-the-...
Li-Jia Li, Gang Wang, Fei-Fei Li 0002
COLT
2007
Springer
14 years 1 months ago
Online Learning with Prior Knowledge
The standard so-called experts algorithms are methods for utilizing a given set of “experts” to make good choices in a sequential decision-making problem. In the standard setti...
Elad Hazan, Nimrod Megiddo