Tree Neural Networks in HOL4
We present an implementation of tree neural networks within the proof assistant HOL4. Their architecture makes them naturally suited for approximating functions whose domain is a set of formulas. We measure the performance of our implementation and compare it with other machine learning predictors on the tasks of evaluating arithmetical expressions and estimating the truth of propositional formulas.
Code (1)
Tasks
BIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Neural Tree Transducers for Tree to Tree Learning
We introduce a novel approach to tree-to-tree learning, the neural tree transducer (NTT), a top-down depth first context-sensitive tree decoder, which is paired with recursive neural encoders. Our method works purely on …
DecoderGeocoding of trees from street addresses and street-level images
We introduce an approach for updating older tree inventories with geographic coordinates using street-level panorama images and a global optimization framework for tree instance matching. Geolocations of trees in invento…
global-optimizationInferring multiple consensus trees and supertrees using clustering: a review
Phylogenetic trees (i.e. evolutionary trees, additive trees or X-trees) play a key role in the processes of modeling and representing species evolution. Genome evolution of a given group of species is usually modeled by …
ClusteringNon-hereditary Minimum Deep Coalescence trees
One of the goals of phylogenetic research is to find the species tree describing the evolutionary history of a set of species. But the trees derived from geneti data with the help of tree inference methods are gene trees…
Interpreting Tree Ensembles with inTrees
Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and…
Future predictionGeneral Classificationregression