Sciweavers

125 search results - page 14 / 25
» The Stochastic Machine Replenishment Problem
Sort
View
WSC
2008
15 years 4 months ago
Approximate dynamic programming: Lessons from the field
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
Warren B. Powell
ALT
2010
Springer
15 years 3 months ago
Online Multiple Kernel Learning: Algorithms and Mistake Bounds
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing ...
Rong Jin, Steven C. H. Hoi, Tianbao Yang

Publication
233views
14 years 10 days ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis
ICML
2007
IEEE
16 years 2 months ago
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
We describe and analyze a simple and effective iterative algorithm for solving the optimization problem cast by Support Vector Machines (SVM). Our method alternates between stocha...
Shai Shalev-Shwartz, Yoram Singer, Nathan Srebro
122
Voted
ICML
2005
IEEE
16 years 2 months ago
Reinforcement learning with Gaussian processes
Gaussian Process Temporal Difference (GPTD) learning offers a Bayesian solution to the policy evaluation problem of reinforcement learning. In this paper we extend the GPTD framew...
Yaakov Engel, Shie Mannor, Ron Meir