Sciweavers

3378 search results - page 34 / 676
» Learning in Friedberg Numberings
Sort
View
COLT
1999
Springer
15 years 4 months ago
Drifting Games
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
Robert E. Schapire
COLT
2007
Springer
15 years 6 months ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
109
Voted
ECCC
2006
87views more  ECCC 2006»
15 years 14 days ago
The Learnability of Quantum States
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we...
Scott Aaronson
93
Voted
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 4 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
TCS
2011
14 years 7 months ago
Smart PAC-learners
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Malte Darnstädt, Hans-Ulrich Simon