We discuss a formulation for active example selection for function learning problems. This formulation is obtained by adapting Fedorov's optimal experiment design to the learning problem. We specifically show how to analytically derive example selection algorithms for certain well defined function classes. We then explore the behavior and sample complexity of such active learning algorithms. Finally, we view object detection as a special case of function learning and show how our formulation reduces to a useful heuristic to choose examples to reduce the generalization error.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/7209 |
| Date | 06 June 1996 |
| Creators | Sung, Kah Kay, Niyogi, Partha |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 40 p., 593069 bytes, 1090749 bytes, application/octet-stream, application/pdf |
| Relation | AIM-1438, CBCL-116 |
Page generated in 0.0018 seconds