Learning to discover efficient mathematical identities

Advances in Neural Information Processing Systems

Volumn 2, Issue January, 2014, Pages 1278-1286

  Zaremba, Wojciech ^a   Kurach, Karol ^b   Fergus, Rob ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPLEX NETWORKS; INFORMATION SCIENCE; LEARNING SYSTEMS; MATHEMATICAL OPERATORS; NEURAL NETWORKS;

ATTRIBUTE GRAMMARS; BRUTE FORCE SEARCH; LEARNING APPROACH; MACHINE LEARNING TECHNIQUES; N-GRAM MODELING; RECURSIVE NEURAL NETWORKS; SYMBOLIC EXPRESSION; TREE SEARCH;

TREES (MATHEMATICS);

EID: 84937961368     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Y. Bengio, J. Louradour, R. Collobert, and J. Weston. Curriculum learning. In ICML, 2009.
2. L. Bottou. From machine learning to machine reasoning. Machine Learning, 94(2): 133-149, 2014.
3. S. R. Bowman. Can recursive neural tensor networks learn logical reasoning? arXiv preprint arXiv: 1312.6192, 2013.
4. J. P. Bridge, S. B. Holden, and L. C. Paulson. Machine learning for first-order theorem proving. Journal of Automated Reasoning, 53: 141-172, August 2014.
5. C.-L. Chang. Symbolic logic and mechanical theorem proving. Academic Press, 1973.
6. B. W. Char, K. O. Geddes, G. H. Gonnet, B. L. Leong, M. B. Monagan, and S. M. Watt. Maple V library reference manual, Volume 199. Springer-verlag New York, 1991.
7. G. Cheung and S. McCanne. An attribute grammar based framework for machine-dependent computational optimization of media processing algorithms. In ICIP, Volume 2, pages 797-801. IEEE, 1999.
8. R. Collobert and J. Weston. A unified architecture for natural language processing: deep neural networks with multitask learning. In ICML, 2008.
9. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the third annual ACM symposium on Theory of computing, pages 151-158. ACM, 1971.
10. M. Desainte-Catherine and K. Barbar. Using attribute grammars to find solutions for musical equational programs. ACM SIGPLAN Notices, 29(9): 56-63, 1994.
11. M. Fitting. First-order logic and automated theorem proving. Springer, 1996.
12. N. Goodman, V. Mansinghka, D. Roy, K. Bonawitz, and D. Tarlow. Church: a language for generative models. arXiv: 1206.3255, 2012.
13. G. E. Hinton, N. Srivastava, A. Krizhevsky, I. Sutskever, and R. R. Salakhutdinov. Improving neural networks by preventing co-adaptation of feature detectors. arXiv: 1207.0580, 2012.
14. D. E. Knuth. Semantics of context-free languages. Mathematical systems theory, 2(2): 127-145, 1968.
15. M.-T. Luong, R. Socher, and C. D. Manning. Better word representations with recursive neural networks for morphology. In CoNLL, 2013.
16. T. Mikolov, K. Chen, G. Corrado, and J. Dean. Efficient estimation of word representations in vector space. arXiv: 1301.3781, 2013.
17. A. Mnih and G. E. Hinton. A scalable hierarchical distributed language model. In NIPS, 2009.
18. P. Nordin. Evolutionary program induction of binary machine code and its applications. Krehl Munster, 1997.
19. M. ONeill, R. Cleary, and N. Nikolov. Solving knapsack problems with attribute grammars. In Proceedings of the Third Grammatical Evolution Workshop (GEWS04). Citeseer, 2004.
20. A. Pfeffer. Practical probabilistic programming. In Inductive Logic Programming, pages 2-3. Springer, 2011.
21. A. M. Saxe, J. L. McClelland, and S. Ganguli. Exact solutions to the nonlinear dynamics of learning in deep linear neural networks. arXiv: 1312.6120, 2013.
22. R. Socher, C. D. Manning, and A. Y. Ng. Learning continuous phrase representations and syntactic parsing with recursive neural networks. Proceedings of the NIPS-2010 Deep Learning and Unsupervised Feature Learning Workshop, pages 1-9, 2010.
23. R. Socher, A. Perelygin, J. Y. Wu, J. Chuang, C. D. Manning, A. Y. Ng, and C. P. Potts. Recursive deep models for semantic compositionality over a sentiment treebank. In EMNLP, 2013.
24. R. P. Stanley. Enumerative combinatorics. Number 49. Cambridge university press, 2011.
25. J. Turian, L. Ratinov, and Y. Bengio. Word representations: a simple and general method for semisupervised learning. In ACL, 2010.
26. J. Waldispühl, B. Behzadi, and J.-M. Steyaert. An approximate matching algorithm for finding (sub-) optimal sequences in s-attributed grammars. Bioinformatics, 18(suppl 2): S250-S259, 2002.
27. S. Wolfram. The mathematica book, Volume 221. Wolfram Media Champaign, Illinois, 1996.
28. M. L. Wong and K. S. Leung. Evolutionary program induction directed by logic grammars. Evolutionary Computation, 5(2): 143-180, 1997.
29. W. Zaremba, K. Kurach, and R. Fergus. Learning to discover efficient mathematical identities. arXiv preprint arXiv: 1406.1584 (http://arxiv.org/abs/1406.1584), 2014.