๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Learning Polynomials with Queries: The Highly Noisy Case

โœ Scribed by Goldreich, Oded; Rubinfeld, Ronitt; Sudan, Madhu


Book ID
118199605
Publisher
Society for Industrial and Applied Mathematics
Year
2000
Tongue
English
Weight
395 KB
Volume
13
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Learning Sparse Multivariate Polynomials
โœ Robert E. Schapire; Linda M. Sellie ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 520 KB

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 numbe