Sciweavers

648 search results - page 1 / 130
» A general dimension for query learning
Sort
View
JCSS
2007
85views more  JCSS 2007»
13 years 4 months ago
A general dimension for query learning
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
José L. Balcázar, Jorge Castro, Davi...
ALT
2002
Springer
14 years 1 months ago
The Complexity of Learning Concept Classes with Polynomial General Dimension
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
Johannes Köbler, Wolfgang Lindner
ALT
2010
Springer
13 years 5 months ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles
ALT
2006
Springer
14 years 1 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
13 years 6 months ago
Differential Privacy and the Fat-Shattering Dimension of Linear Queries
In this paper, we consider the task of answering linear queries under the constraint of differential privacy. This is a general and well-studied class of queries that captures oth...
Aaron Roth