Sciweavers

369 search results - page 14 / 74
» Global Optimization for Value Function Approximation
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
11 years 11 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
LFP
1992
140views more  LFP 1992»
13 years 9 months ago
Global Tagging Optimization by Type Inference
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...
Fritz Henglein
CORR
2011
Springer
145views Education» more  CORR 2011»
13 years 3 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov
SIAMJO
2002
124views more  SIAMJO 2002»
13 years 8 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...