✦ LIBER ✦

Sample Complexity for Computational Classification Problems

✍ Scribed by Daniil Ryabko

Publisher: Springer
Year: 2007
Tongue: English
Weight: 182 KB
Volume: 49
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-0037-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of classification problems

✍ I. V. Sergienko; A. M. Gupal; S. V. Pashko 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 650 KB

Admissible stochastic complexity models

Admissible stochastic complexity models for classification problems

✍ Padhraic Smyth 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 788 KB

Computational complexity of PERT problem

Computational complexity of PERT problems

✍ Jane N. Hagstrom 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 415 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 of stochastic p

Computational complexity of stochastic programming problems

✍ Martin Dyer; Leen Stougie 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 157 KB

Testing Problems with Sublearning Sample

Testing Problems with Sublearning Sample Complexity

✍ Michael Kearns; Dana Ron 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 249 KB

We study the problem of determining, for a class of functions H, whether an unknown target function f is contained in H or is ``far'' from any function in H. Thus, in contrast to problems of learning, where we must construct a good approximation to f in H on the basis of sample data, in problems of