Sciweavers

139 search results - page 6 / 28
» On the Generalization Ability of On-Line Learning Algorithms
Sort
View
JIFS
2002
107views more  JIFS 2002»
14 years 9 months ago
Model selection via Genetic Algorithms for RBF networks
This work addresses the problem of finding the adjustable parameters of a learning algorithm using Genetic Algorithms. This problem is also known as the model selection problem. In...
Estefane G. M. de Lacerda, André Carlos Pon...
CORR
2008
Springer
95views Education» more  CORR 2008»
14 years 9 months ago
Explicit Learning: an Effort towards Human Scheduling Algorithms
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
Jingpeng Li, Uwe Aickelin
CORR
2010
Springer
165views Education» more  CORR 2010»
14 years 9 months ago
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
IJCAI
2001
14 years 11 months ago
Genetic Algorithm based Selective Neural Network Ensemble
Neural network ensemble is a learning paradigm where several neural networks are jointly used to solve a problem. In this paper, the relationship between the generalization abilit...
Zhi-Hua Zhou, Jianxin Wu, Yuan Jiang, Shifu Chen
ATAL
2007
Springer
15 years 1 months ago
A reinforcement learning based distributed search algorithm for hierarchical peer-to-peer information retrieval systems
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...
Haizheng Zhang, Victor R. Lesser