Learning via Finitely Many Queries

This work introduces a new query inference model that can access data and communicate with a teacher by asking finitely many boolean queries in a language L. In this model the parameters of interest are the number of queries used and the expressive power of L. We study how the learning power varies with these parameters. Preliminary results suggest that this model can help studying query inference in an resource bounded environment.

• Type: Conference
• Year: 2004
• Where: AMAI
• Authors: Andrew C. Lee
• Keywords: AMAI 2004, Artificial Intelligence, Boolean Queries, Learning Power Varies, Query Inference Model