Sciweavers

704 search results - page 97 / 141
» Improved Learning of AC0 Functions
Sort
View
146
Voted
JCP
2007
143views more  JCP 2007»
15 years 2 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
145
Voted
ICTAI
2010
IEEE
15 years 21 days ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...
140
Voted
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 9 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
120
Voted
IJCNN
2000
IEEE
15 years 7 months ago
Storage and Recall of Complex Temporal Sequences through a Contextually Guided Self-Organizing Neural Network
A self-organizing neural network for learning and recall of complex temporal sequences is proposed. we consider a single sequence with repeated items, or several sequences with a c...
Guilherme De A. Barreto, Aluizio F. R. Araú...
147
Voted
COLT
2000
Springer
15 years 7 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio