569 search results - page 12 / 114 » Online Bounds for Bayesian Algorithms |
108
click to vote
COLT
2005
Springer
14 years 11 months ago
2005
Springer
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
In this work we show how to use efficient online trading algorithms to price the current value of financial instruments, such as an option. We derive both upper and lower bounds f...
COLT
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
NIPS
2007
14 years 11 months ago
2007
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...