Augmentation-based learning: combining observations and user edits for programming-by-demonstration

ABSTRACT

In this paper we introduce a new approach to Programming-by-Demonstration in which the user is allowed to explicitly edit the procedure model produced by the learning algorithm while demonstrating the task. We describe a new algorithm, Augmentation-Based Learning, that supports this approach by considering both demonstrations and edits as constraints on the hypothesis space, and resolving con icts in favor of edits.

REFERENCES

• 1: Y. Bengio and P. Frasconi. Input-Output HMM's for sequence processing. IEEE Trans. Neural Networks, 7(5):1231--1249, Sept. 1996.
• 2: Philip A. Chou, Optimal Partitioning for Classification and Regression Trees, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.4, p.340-354, April 1991 [doi>10.1109/34.88569]
• 3: Allen Cypher, Eager: programming repetitive tasks by demonstration, Watch what I do: programming by demonstration, MIT Press, Cambridge, MA, 1993
• 4: Allen Cypher , Daniel C. Halbert , David Kurlander , Henry Lieberman , David Maulsby , Brad A. Myers , Alan Turransky, Watch what I do: programming by demonstration, MIT Press, Cambridge, MA, 1993
• 5: John D. Lafferty , Andrew McCallum , Fernando C. N. Pereira, Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data, Proceedings of the Eighteenth International Conference on Machine Learning, p.282-289, June 28-July 01, 2001
• 6: Tessa Lau , Lawrence Bergman , Vittorio Castelli , Daniel Oblinger, Sheepdog: learning procedures for technical support, Proceedings of the 9th international conference on Intelligent user interface, January 13-16, 2004, Funchal, Madeira, Portugal [doi>10.1145/964442.964464]
• 7: Tessa A. Lau , Pedro Domingos , Daniel S. Weld, Version Space Algebra and its Application to Programming by Demonstration, Proceedings of the Seventeenth International Conference on Machine Learning, p.527-534, June 29-July 02, 2000
• 8: Tessa Lau , Pedro Domingos , Daniel S. Weld, Learning programs from traces using version space algebra, Proceedings of the 2nd international conference on Knowledge capture, October 23-25, 2003, Sanibel Island, FL, USA [doi>10.1145/945645.945654]
• 9: H. Lieberman, editor. Your Wish is My Command: Giving Users the Power to Instruct their Software. Morgan Kaufmann, 2001.
• 10: Richard G. McDaniel , Brad A. Myers, Building applications using only demonstration, Proceedings of the 3rd international conference on Intelligent user interfaces, p.109-116, January 06-09, 1998, San Francisco, California, United States [doi>10.1145/268389.268409]
• 11: N. Medvivovic, A. Egyed, and D. Rosenblum. Round-trip software engineering using uml: From architecture to design and back,. In Proc. 2nd Workshop Object-Oriented Reengineering (WOOR 99), pages 1--8, Monterey, CA, USA, 1999.
• 12: D. Oblinger, V. Castelli, T. Lau, and L. Bergman. Similarity-based alignment and generalization. In Proc. Sixteenth Europ. Conf. on Machine Learning, page To appear, October 2005.
• 13: Madhu Prabaker , Lawrence Bergman , Vittorio Castelli, An evaluation of using programming by demonstration and guided walkthrough techniques for authoring and utilizing documentation, Proceedings of the SIGCHI conference on Human Factors in computing systems, April 22-27, 2006, Montréal, Québec, Canada [doi>10.1145/1124772.1124809]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.6 Learning

General Terms:
Algorithms

Keywords:
artificial intelligence, example-and demonstration-based interfaces, programming-by-demonstration