Sciweavers

4544 search results - page 803 / 909
» Reinforcement Learning with Time
Sort
View
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 10 months ago
Is It Real, or Is It Randomized?: A Financial Turing Test
We construct a financial "Turing test" to determine whether human subjects can differentiate between actual vs. randomized financial returns. The experiment consists of ...
Jasmina Hasanhodzic, Andrew W. Lo, Emanuele Viola
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 10 months ago
Dynamic Policy Programming
In this paper, we consider the problem of planning and learning in the infinite-horizon discounted-reward Markov decision problems. We propose a novel iterative direct policysearc...
Mohammad Gheshlaghi Azar, Hilbert J. Kappen
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 10 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 10 months ago
Efficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of co...
Peter Stobbe, Andreas Krause
DATAMINE
2010
120views more  DATAMINE 2010»
13 years 10 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado