Sciweavers

16 search results - page 1 / 4
» On impossibility of sequential algorithmic forecasting
Sort
View
DAGSTUHL
2006
13 years 6 months ago
On impossibility of sequential algorithmic forecasting
The problem of prediction future event given an individual sequence of past events is considered. Predictions are given in form of real numbers pn which are computed by some algori...
Vladimir V. V'yugin
CORR
2011
Springer
213views Education» more  CORR 2011»
12 years 12 months ago
Adapting to Non-stationarity with Growing Expert Ensembles
Forecasting sequences by expert ensembles generally assumes stationary or near-stationary processes; however, in complex systems and many real-world applications, we are frequentl...
Cosma Rohilla Shalizi, Abigail Z. Jacobs, Aaron Cl...
MST
2008
118views more  MST 2008»
13 years 4 months ago
Risk Assessment for One-Counter Threads
Abstract Threads as contained in a thread algebra are used for the modeling of sequential program behavior. A thread that may use a counter to control its execution is called a `on...
Alban Ponse, Mark van der Zwaag
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
13 years 11 months ago
Considering Unseen States as Impossible in Factored Reinforcement Learning
Abstract. The Factored Markov Decision Process (FMDP) framework is a standard representation for sequential decision problems under uncertainty where the state is represented as a ...
Olga Kozlova, Olivier Sigaud, Pierre-Henri Wuillem...
MOR
2007
109views more  MOR 2007»
13 years 4 months ago
Solution and Forecast Horizons for Infinite-Horizon Nonhomogeneous Markov Decision Processes
We consider the problem of solving a nonhomogeneous infinite horizon Markov Decision Process (MDP) problem in the general case of potentially multiple optimal first period polic...
Torpong Cheevaprawatdomrong, Irwin E. Schochetman,...