Sciweavers

526 search results - page 1 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
COLT
2003
Springer
13 years 10 months ago
Efficient Algorithms for Online Decision Problems
Adam Kalai, Santosh Vempala
NIPS
2004
13 years 6 months ago
Approximately Efficient Online Mechanism Design
Online mechanism design (OMD) addresses the problem of sequential decision making in a stochastic environment with multiple self-interested agents. The goal in OMD is to make valu...
David C. Parkes, Satinder P. Singh, Dimah Yanovsky
JMLR
2002
83views more  JMLR 2002»
13 years 4 months ago
On Online Learning of Decision Lists
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
Ziv Nevo, Ran El-Yaniv
ECCC
2007
180views more  ECCC 2007»
13 years 4 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
JAIR
2008
130views more  JAIR 2008»
13 years 4 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...