Sciweavers

509 search results - page 37 / 102
» Using Learning for Approximation in Stochastic Processes
Sort
View
JMLR
2012
13 years 4 months ago
Krylov Subspace Descent for Deep Learning
In this paper, we propose a second order optimization method to learn models where both the dimensionality of the parameter space and the number of training samples is high. In ou...
Oriol Vinyals, Daniel Povey
ICML
2007
IEEE
16 years 3 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
15 years 6 months ago
A Bayesian approach to learning classifier systems in uncertain environments
In this paper we propose a Bayesian framework for XCS [9], called BXCS. Following [4], we use probability distributions to represent the uncertainty over the classifier estimates ...
Davide Aliprandi, Alex Mancastroppa, Matteo Matteu...
ASMTA
2009
Springer
114views Mathematics» more  ASMTA 2009»
15 years 6 months ago
Improving the Efficiency of the Proxel Method by Using Individual Time Steps
Discrete stochastic models (DSM) are widely used in various application fields today. Proxel-based simulation can outperform discrete event-based approaches in the analysis of smal...
Claudia Krull, Robert Buchholz, Graham Horton
ECAI
2010
Springer
15 years 3 months ago
Bayesian Monte Carlo for the Global Optimization of Expensive Functions
In the last decades enormous advances have been made possible for modelling complex (physical) systems by mathematical equations and computer algorithms. To deal with very long run...
Perry Groot, Adriana Birlutiu, Tom Heskes