Simulating access to hidden information while learning

DOI10.1145/195058.195152zbMath1345.68249OpenAlexW2156948478MaRDI QIDQ2817617

Peter Auer, Philip M. Long

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195152

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

On the complexity of function learning ⋮ Efficient learning with virtual threshold gates ⋮ The learnability of unions of two rectangles in the two-dimensional discretized space ⋮ General lower bounds on the query complexity within the exact learning model

This page was built for publication: Simulating access to hidden information while learning