Sciweavers

12 search results - page 3 / 3
» An efficient approach to updating simplex multipliers in the...
Sort
View
JAIR
2006
160views more  JAIR 2006»
13 years 6 months ago
Anytime Point-Based Approximations for Large POMDPs
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
ML
2002
ACM
167views Machine Learning» more  ML 2002»
13 years 5 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...