569 search results - page 22 / 114 » Online Bounds for Bayesian Algorithms |
NIPS
2008
14 years 11 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...