Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
The Strength of Weak Learnability
Machine Learning
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Threshold circuits of bounded depth
Journal of Computer and System Sciences
On using the Fourier transform to learn Disjoint DNF
Information Processing Letters
Learning unions of boxes with membership and equivalence queries
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On-Line Learning of Rectangles and Unions of Rectangles
Machine Learning - Special issue on computational learning theory, COLT'92
Boosting a weak learning algorithm by majority
Information and Computation
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Efficient learning with virtual threshold gates
Information and Computation
On Learning Read-k-Satisfy-j DNF
SIAM Journal on Computing
Computing Boolean functions by polynomials and threshold circuits
Computational Complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Proving Hard-Core Predicates Using List Decoding
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Journal of Computer and System Sciences - STOC 2001
Learning unions of ω(1)-dimensional rectangles
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Learning unions of ω(1)-dimensional rectangles
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
| Hi-index | 0.00 |
We consider the problem of learning unions of rectangles over the domain [b]n, in the uniform distribution membership query learning setting, where both b and n are “large”. We obtain poly(n, logb)-time algorithms for the following classes: – poly (n logb)-Majority of $O(\frac{\log(n \log b)} {\log \log(n \log b)})$-dimensional rectangles. –Unions of poly(log(n logb)) many rectangles with dimension $O(\frac{\log^2 (n \log b)} {(\log \log(n \log b) \log \log \log (n \log b))^2})$. – poly (n logb)-Majority of poly (n logb)-Or of disjoint rectangles with dimension $O(\frac{\log(n \log b)} {\log \log(n \log b)})$ Our main algorithmic tool is an extension of Jackson's boosting- and Fourier-based Harmonic Sieve algorithm [13] to the domain [b]n, building on work of Akavia et al. [1]. Other ingredients used to obtain the results stated above are techniques from exact learning [4] and ideas from recent work on learning augmented AC0 circuits [14] and on representing Boolean functions as thresholds of parities [16].