Sciweavers

12194 search results - page 12 / 2439
» Numberings Optimal for Learning
Sort
View
ICML
1997
IEEE
15 years 4 months ago
Efficient Feature Selection in Conceptual Clustering
Feature selection has proven to be a valuable technique in supervised learning for improving predictive accuracy while reducing the number of attributes considered in a task. We i...
Mark Devaney, Ashwin Ram
116
Voted
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 7 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
76
Voted
COLT
2004
Springer
15 years 5 months ago
Polynomial Time Prediction Strategy with Almost Optimal Mistake Probability
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
Nader H. Bshouty
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 4 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
96
Voted
ICML
2001
IEEE
16 years 1 months ago
Symmetry in Markov Decision Processes and its Implications for Single Agent and Multiagent Learning
This paper examines the notion of symmetry in Markov decision processes (MDPs). We define symmetry for an MDP and show how it can be exploited for more effective learning in singl...
Martin Zinkevich, Tucker R. Balch