Recursive tree grammar autoencoders

DOI10.1007/S10994-022-06223-7MaRDI QIDQ2102393zbMATH OpenOpenAlexWikidataFDO

Authors Benjamin Paaßen, Irena Koprinska, Kalina Yacef

Publication date 28 November 2022

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2012.02097

zbMATH Keywords

tree grammarsrepresentation learningrecursive neural networksvariational autoencoders

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Synthesizing context-free grammars from recurrent neural networks
• Learning sequential tree-to-word transducers
• scientific article; zbMATH DE number 1759524
• 10.1162/153244304773936117
• scientific article; zbMATH DE number 1928630
• scientific article; zbMATH DE number 2090198
• Using tree transducers for grammatical inference

Cites work

• scientific article; zbMATH DE number 3872712 (Why is no real title available?)
• A survey on tree edit distance and related problems
• An Introduction to Variational Autoencoders
• Architectural Bias in Recurrent Neural Networks: Fractal Analysis
• Recursive tree grammar autoencoders
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Tree generating regular systems

Cited in

(3)

• Recursive tree grammar autoencoders
• 10.1162/153244304773936117
• \texttt{gym-saturation}: gymnasium environments for saturation provers (system description)

Describes a project that uses

Uses Software

• Adam
• PyTorch

This page was built for publication: Recursive tree grammar autoencoders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102393)