Sciweavers

3088 search results - page 56 / 618
» Online Passive-Aggressive Algorithms
Sort
View
NIPS
2001
14 years 11 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
COLT
2006
Springer
15 years 1 months ago
A Randomized Online Learning Algorithm for Better Variance Control
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
Jean-Yves Audibert
TIT
2008
76views more  TIT 2008»
14 years 9 months ago
Improved Risk Tail Bounds for On-Line Algorithms
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
Nicolò Cesa-Bianchi, Claudio Gentile
FOCS
1993
IEEE
15 years 1 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani
IPPS
2007
IEEE
15 years 4 months ago
On the Design of Online Scheduling Algorithms for Advance Reservations and QoS in Grids
Abstract— We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to alloca...
Claris Castillo, George N. Rouskas, Khaled Harfous...