4255 search results - page 321 / 851 » On Learning Boolean Functions |
154
click to vote
NPL
2006
15 years 6 months ago
2006
We show that under reasonable conditions, online learning for a nonlinear function near a local minimum is similar to a multivariate Ornstein Uhlenbeck process. This implies that ...
243
click to vote
AI
1998
Springer
15 years 6 months ago
1998
Springer
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
216
click to vote
IJCNN
2007
IEEE
16 years 29 days ago
2007
IEEE
Abstract— The optimal model parameters of a kernel machine are typically given by the solution of a convex optimisation problem with a single global optimum. Obtaining the best p...
246
click to vote
SAGA
2009
Springer
16 years 1 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
182
click to vote
ICAC
2008
IEEE
16 years 1 months ago
2008
IEEE
—Large scale production grids are an important case for autonomic computing. They follow a mutualization paradigm: decision-making (human or automatic) is distributed and largely...