✦ LIBER ✦

Computational Sample Complexity

✍ Scribed by Decatur, Scott E.; Goldreich, Oded; Ron, Dana

Book ID: 118178234
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 466 KB
Volume: 29
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539797325648

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sample Complexity for Computational Clas

Sample Complexity for Computational Classification Problems

✍ Daniil Ryabko 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 182 KB

Computational Sample Complexity and Attr

Computational Sample Complexity and Attribute-Efficient Learning

✍ Rocco A. Servedio 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Two fundamental measures of the efficiency of a learning algorithm are its running time and the number of examples it requires (its sample complexity). In this paper we demonstrate that even for simple concept classes, an inherent tradeoff can exist between running time and sample complexity. We pre

Computational Complexity and Knowledge C

Computational Complexity and Knowledge Complexity

✍ Goldreich, Oded; Ostrovsky, Rafail; Petrank, Erez 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 405 KB

Analytic Computational Complexity

📂 Article 📅 1976 🏛 IEEE 🌐 English ⚖ 201 KB

Computational versus Causal Complexity

✍ Matthias Scheutz 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 293 KB

Automata-based computational complexity

✍ J. Hartmanis; R.E. Stearns 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 729 KB