Sciweavers

12194 search results - page 171 / 2439
» Numberings Optimal for Learning
Sort
View
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 8 months ago
Intelligent Recombination Using Individual Learning in a Collective Learning Genetic Algorithm
This paper introduces a new collective learning genetic algorithm (CLGA) which employs individual learning to do intelligent recombination based on a cooperative exchange of knowl...
Terry P. Riopka, Peter Bock
ALT
2006
Springer
16 years 1 months ago
Teaching Memoryless Randomized Learners Without Feedback
The present paper mainly studies the expected teaching time of memoryless randomized learners without feedback. First, a characterization of optimal randomized learners is provided...
Frank J. Balbach, Thomas Zeugmann
ICML
2008
IEEE
16 years 5 months ago
SVM optimization: inverse dependence on training set size
We discuss how the runtime of SVM optimization should decrease as the size of the training data increases. We present theoretical and empirical results demonstrating how a simple ...
Shai Shalev-Shwartz, Nathan Srebro
ICML
1990
IEEE
15 years 8 months ago
Average Case Analysis of Conjunctive Learning Algorithms
We present an approach to modeling the average case behavior of learning algorithms. Our motivation is to predict the expected accuracy of learning algorithms as a function of the...
Michael J. Pazzani, Wendy Sarrett
ECML
2006
Springer
15 years 8 months ago
Constant Rate Approximate Maximum Margin Algorithms
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
Petroula Tsampouka, John Shawe-Taylor