Sciweavers

10054 search results - page 97 / 2011
» On the Complexity of Function Learning
Sort
View
111
Voted
JMLR
2010
143views more  JMLR 2010»
14 years 7 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
100
Voted
SIGECOM
1999
ACM
136views ECommerce» more  SIGECOM 1999»
15 years 4 months ago
Automated strategy searches in an electronic goods market: learning and complex price schedules
Markets for electronic goods provide the possibility of exploring new and more complex pricing schemes, due to the flexibility of information goods and negligible marginal cost. I...
Christopher H. Brooks, Scott A. Fay, Rajarshi Das,...
95
Voted
ICANN
2009
Springer
15 years 7 months ago
Measuring and Optimizing Behavioral Complexity for Evolutionary Reinforcement Learning
Model complexity is key concern to any artificial learning system due its critical impact on generalization. However, EC research has only focused phenotype structural complexity ...
Faustino J. Gomez, Julian Togelius, Jürgen Sc...
105
Voted
JMLR
2006
117views more  JMLR 2006»
15 years 13 days ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
COLT
2000
Springer
15 years 4 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann