Robert E. Schapire, Linda M. Sellie  Home/Search
Context Related
| att.com/~schapire/p...SchapireSe93.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: att.com/~schapire/publist (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the problem of learning a polynomial over an arbitrary field F defined on a set of boolean variables. We present the first provably effective algorithm for exactly identifying such polynomials using membership and equivalence queries. Our algorithm runs in time polynomial in n, the number of variables, and t, the number of nonzero terms appearing in the polynomial. The algorithm makes at most nt + 2 equivalence queries, and at most (nt + 1)(t + 3t)=2 membership queries. Our... (Update)
Context of citations to this paper: More
...gave in [Bs94] a technique for learning decision trees under any distribution via the Monotone Theory. Schapire and Sellie gave in [SS93] a Lattice based algorithm for learning multivariate polynomials over the binary field under any distribution. In the former the output...
Cited by: More
Interpolating Arithmetic Read-Once Formulas - In Parallel Nader (Correct)
Applying Learning Algorithms to Preference Elicitation - Lahaie, Parkes (2004) (Correct)
Applying Learning Algorithms to Preference Elicitation in.. - Lahaie, Parkes (2004) (Correct)
Active bibliography (related documents): More All
0.5: New Interpolation Algorithms for Multiple-Valued Reed-Muller.. - Zilic, Vranesic (1996) (Correct)
0.4: Simple Learning Algorithms for Decision Trees and.. - Bshouty, Mansour (1995) (Correct)
0.2: Interpolating Arithmetic Read-Once Formulas in Parallel - Bshouty, Cleve (Correct)
Similar documents based on text: More All
0.4: Toward Efficient Agnostic Learning - Kearns (1994) (Correct)
0.4: Exact Identification of Read-once Formulas Using Fixed Points.. - Sally Goldman (1993) (Correct)
0.3: Efficient Learning of Typical Finite Automata from.. - Freund, Kearns, Ron, .. (1993) (Correct)
Related documents from co-citation: More All
17: Queries and concept learning (context) - Angluin - 1988
14: Interpolation and approximation of sparse multivariate polynomials over GF (context) - Roth, Benedek - 1991
13: Communications of the ACM (context) - Valiant, of et al. - 1984
BibTeX entry: (Update)
R. E. Schapire and L. M. Sellie. Learning sparse multivariate polynomials over a field with queries and counterexamples. In Proc. of 6th Annu. ACM Workshop on Comput. Learning Theory, pages 17--26, 1993. http://citeseer.ist.psu.edu/schapire96learning.html More
@article{ schapire96learning,
author = "Robert E. Schapire and Linda Sellie",
title = "Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples",
journal = "Journal of Computer and System Sciences",
volume = "52",
number = "2",
pages = "201-213",
year = "1996",
url = "citeseer.ist.psu.edu/schapire96learning.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
268 Decision theoretic generalizations of the PAC model for neur.. (context) - Haussler - 1992
244 Learning regular sets from queries and counterexamples (context) - Angluin - 1987
96 Learning decision trees using the Fourier spectrum - Kushilevitz, Mansour - 1993
78 Probabilistic algorithms for sparse polynomials (context) - Zippel - 1979
74 Exact learning via the monotone theory (context) - Bshouty - 1993
54 Reconstructing algebraic functions from mixed data - Ar, Lipton et al. - 1992
48 Learning boolean functions in an infinite attribute space - Blum - 1992
43 Highly resilient correctors for polynomials - Gemmell, Sudan - 1992
41 Interpolating polynomials from their values (context) - Zippel - 1990
32 On zero-testing and interpolation of k-sparse multivariate p.. (context) - Clausen, Dress et al. - 1991
23 Interpolation and approximation of sparse multivariate polyn.. (context) - Roth, Benedek - 1991
17 Learning functions of k terms (context) - Blum, Singh - 1990
15 On learning ring-sum-expansions (context) - Fischer, Simon - 1992
12 Randomized interpolation and approximation of sparse polynom.. - Mansour - 1992
11 A deterministic algorithm for sparse multivariate polynomial.. (context) - Ben-Or, Tiwari - 1988
9 Fast parallel algorithms for sparse multivariate polynomial .. (context) - Yu, Marek et al.
6 second edition (context) - Herstein, Algebra - 1975
2 Applying coding theory to sparse interpolation (context) - Dur, Grabmeier - 1993
1 Bulletin of the American Mathematical Society (context) - Wilf, Mobius et al. - 1968
1 Interpolating GF[2] polynomials (context) - Hellerstein, Warmuth
1 Advances in Applied Mathematics (context) - Dress, Grabmeier et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.research.att.com/~schapire/publist.html): More
Discussion of the paper "Arcing Classifiers" by Leo Breiman - Freund, Schapire (1997) (Correct)
Using Output Codes to Boost Multiclass Learning Problems - Schapire (1997) (Correct)
Experiments with a New Boosting Algorithm - Freund, Schapire (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC