Skip to main content
Conference Proceedings

PExact = Exact learning

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (2004) 3120 200-209
DOI: 10.1007/978-3-540-27819-1_14
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Probably Exact model (PExact) is a relaxation of the Exact model, introduced in by Bshouty. In this paper, we show that the PExact model is equivalent to the Exact model. We also show that in the Exact model, the adversary (oracle) gains no additional power from knowing the learners' coin tosses a-priory.

Cite

CITATION STYLE

APA

Gavinsky, D., & Owshanko, A. (2004). PExact = Exact learning. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3120, pp. 200–209). Springer Verlag. https://doi.org/10.1007/978-3-540-27819-1_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free