✦ 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
DOI: 10.1137/s0895480198344540

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The quantum query complexity of learning

The quantum query complexity of learning multilinear polynomials

✍ Ashley Montanaro 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 145 KB

Learning Sparse Multivariate Polynomials

Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples

✍ 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

Attacks on statistical databases: The hi

Attacks on statistical databases: The highly noisy case

✍ Kantor, Alexander; Nissim, Kobbi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 174 KB

New bounds for the query complexity of a

New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries

✍ Victor Mitrana; Cristina Tîrnăucă 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 148 KB

More efficient PAC-learning of DNF with

More efficient PAC-learning of DNF with membership queries under the uniform distribution

✍ Nader H. Bshouty; Jeffrey C. Jackson; Christino Tamon 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 532 KB

On Sobolev orthogonal polynomials with c

On Sobolev orthogonal polynomials with coherent pairs The Jacobi case

✍ K. Pan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 468 KB