Sciweavers

263 search results - page 23 / 53
» Regret Bounds for Prediction Problems
Sort
View
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
14 years 3 months ago
Trajectory generation for constant velocity target motion estimation using monocular vision
- The performance of monocular vision based target tracking is a strong function of camera motion. Without motion, the target estimation problem is unsolvable. By designing the cam...
Eric W. Frew, Stephen M. Rock
ALT
2008
Springer
14 years 6 months ago
Learning with Continuous Experts Using Drifting Games
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
Indraneel Mukherjee, Robert E. Schapire
COLT
1999
Springer
14 years 2 months ago
Drifting Games
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
Robert E. Schapire
AI
2011
Springer
13 years 4 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
ICML
2005
IEEE
14 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III