Sciweavers

845 search results - page 17 / 169
» Complexity Dimensions and Learnability
Sort
View
DCG
2008
77views more  DCG 2008»
13 years 7 months ago
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
Eran Nevo
ALT
2007
Springer
14 years 4 months ago
One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form...
Sanjay Jain, Efim B. Kinber
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
COLT
2010
Springer
13 years 5 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
JCSS
2007
85views more  JCSS 2007»
13 years 7 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...