Skip to main content

An Application of Stochastic Context Sensitive Grammar Induction to Transfer Learning

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8598))

Abstract

We generalize Solomonoff’s stochastic context-free grammar induction method to context-sensitive grammars, and apply it to transfer learning problem by means of an efficient update algorithm. The stochastic grammar serves as a guiding program distribution which improves future probabilistic induction approximations by learning about the training sequence of problems. Stochastic grammar is updated via extrapolating from the initial grammar and the solution corpus. We introduce a data structure to represent derivations and introduce efficient algorithms to compute an updated grammar which modify production probabilities and add new productions that represent past solutions.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Huang, J., Schonfeld, D., Krishnamurthy, V.: A new context-sensitive grammars learning algorithm and its application in trajectory classification. In: Image Processing (ICIP) 2012, pp. 3093–3096 (September 2012)

    Google Scholar 

  2. Hutter, M.: Optimality of universal bayesian sequence prediction for general loss and alphabet. JMLR, 971–1000 (November 2003)

    Google Scholar 

  3. Levin, L.A.: Universal problems of full search. Problems of Information Transmission 9(3), 256–266 (1973)

    Google Scholar 

  4. Looks, M.: Scalable estimation-of-distribution program evolution. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (2007)

    Google Scholar 

  5. Looks, M., Goertzel, B., Pennachin, C.: Learning computer programs with the Bayesian optimization algorithm. In: GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, vol. 1, pp. 747–748. ACM Press, Washington (2005)

    Google Scholar 

  6. McKay, R.I., Hoai, N.X., Whigham, P.A., Shan, Y., O’Neill, M.: Grammar-based genetic programming: A survey. Genetic Programming and Evolvable Machines 11(3-4), 365–396 (2010)

    Article  Google Scholar 

  7. Özkural, E.: An application of stochastic context sensitive grammar induction to transfer learning: Appendix, Published on www at https://examachine.net/papers/derivation-lattice.pdf

  8. Özkural, E.: Towards heuristic algorithmic memory. In: Schmidhuber, J., Thórisson, K.R., Looks, M. (eds.) AGI 2011. LNCS (LNAI), vol. 6830, pp. 382–387. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Schmidhuber, J.: Optimal ordered problem solver. Machine Learning 54, 211–256 (2004)

    Article  MATH  Google Scholar 

  10. Solomonoff, R.J.: A formal theory of inductive inference, part i. Information and Control 7(1), 1–22 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  11. Solomonoff, R.J.: A formal theory of inductive inference, part ii. Information and Control 7(2), 224–254 (1964)

    Article  MATH  MathSciNet  Google Scholar 

  12. Solomonoff, R.J.: Complexity-based induction systems: Comparisons and convergence theorems. IEEE Trans. on Information Theory IT-24(4), 422–432 (1978)

    Google Scholar 

  13. Solomonoff, R.J.: A system for incremental learning based on algorithmic probability. In: Proceedings of the Sixth Israeli Conference on Artificial Intelligence, Tel Aviv, Israel, pp. 515–527 (December 1989)

    Google Scholar 

  14. Solomonoff, R.J.: Progress in incremental machine learning. In: NIPS Workshop on Universal Learning Algorithms and Optimal Search, Whistler, B.C., Canada (December 2002)

    Google Scholar 

  15. Solomonoff, R.J.: Three kinds of probabilistic induction: Universal distributions and convergence theorems. The Computer Journal 51(5), 566–570 (2008); Christopher Stewart Wallace (1933-2004) memorial special issue

    Google Scholar 

  16. Solomonoff, R.J.: Algorithmic probability: Theory and applications. In: Dehmer, M., Emmert-Streib, F. (eds.) Information Theory and Statistical Learning, pp. 1–23. Springer Science+Business Media, N.Y. (2009)

    Google Scholar 

  17. Solomonoff, R.J.: Algorithmic probability, heuristic programming and agi. In: Third Conference on Artificial General Intelligence, pp. 251–157 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Özkural, E. (2014). An Application of Stochastic Context Sensitive Grammar Induction to Transfer Learning. In: Goertzel, B., Orseau, L., Snaider, J. (eds) Artificial General Intelligence. AGI 2014. Lecture Notes in Computer Science(), vol 8598. Springer, Cham. https://doi.org/10.1007/978-3-319-09274-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09274-4_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09273-7

  • Online ISBN: 978-3-319-09274-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics