Sciweavers

176 search results - page 11 / 36
» The complexity of properly learning simple concept classes
Sort
View
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
13 years 7 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
COLT
1999
Springer
14 years 1 months ago
On PAC Learning Using Winnow, Perceptron, and a Perceptron-like Algorithm
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
Rocco A. Servedio
ECML
2003
Springer
14 years 2 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
COLT
2010
Springer
13 years 6 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky
ICSE
2004
IEEE-ACM
14 years 8 months ago
Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases
Most research on automated specification-based software testing has focused on the automated generation of test cases. Before a software system can be tested, it must be set up ac...
Wee Kheng Leow, Siau-Cheng Khoo, Yi Sun