Sciweavers

526 search results - page 17 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
JAIR
2010
130views more  JAIR 2010»
13 years 3 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
EWRL
2008
13 years 10 months ago
Efficient Reinforcement Learning in Parameterized Models: Discrete Parameter Case
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...
Kirill Dyagilev, Shie Mannor, Nahum Shimkin
ALT
2006
Springer
14 years 25 days ago
Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
In this paper the sequential prediction problem with expert advice is considered when the loss is unbounded under partial monitoring scenarios. We deal with a wide class of the par...
Chamy Allenberg, Peter Auer, László ...
ICTAI
2007
IEEE
14 years 3 months ago
Multi-criteria Decision Making for Local Coordination in Multi-agent Systems
Unlike mono-agent systems, multi-agent planing addresses the problem of resolving conflicts between individual and group interests. In this paper, we are using a Decentralized Ve...
Matthieu Boussard, Maroua Bouzid, Abdel-Illah Moua...
NIPS
2008
13 years 10 months ago
An Homotopy Algorithm for the Lasso with Online Observations
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...
Pierre Garrigues, Laurent El Ghaoui