C OMBINING S YMBOLIC E XPRESSIONS AND B LACKBOX F UNCTION E VALUATIONS IN N EURAL P ROGRAMS
Anonymous authors
Paper under double-blind review
A BSTRACT
Neural programming involves training neural networks to learn programs from data.
Previous works have failed to achieve good generalization performance, especially on programs with high complexity or on large domains.
This is because they mostly rely either on black-box function evaluations that do not capture the structure of the program, or on detailed execution traces that are expensive to obtain, and hence the training data has poor coverage of the domain under consideration.
We present a novel framework that utilizes black-box function evaluations, in conjunction with symbolic expressions that integrate relationships between the given functions.
We employ tree LSTMs to incorporate the structure of the symbolic expression trees.
We use tree encoding for numbers present in function evaluation data, based on their decimal representation.
We present an evaluation benchmark for this task to demonstrate our proposed model combines symbolic reasoning and function evaluation in a fruitful manner, obtaining high accuracies in our experiments.
Our framework generalizes signiﬁcantly better to expressions of higher depth and is able to ﬁll partial equations with valid completions.
I NTRODUCTION
Human beings possess impressive abilities for abstract mathematical and logical thinking.
It has long been the dream of computer scientists to design machines with such capabilities: machines that can automatically learn and reason, thereby removing the need to manually program them.
Neural programming, where neural networks are used to learn programs, has recently shown promise towards this goal.
Examples of neural programming include neural theorem provers, neural Turing machines and neural program inducers, e.g. Loos et al.
; Graves et al.
(2014); Neelakantan et al.
; Bo ˇ snjak et al. (2016).
They aim to solve tasks such as learning mathematical functions (e.g. grade-school addition, sorting), prove theorems and synthesize programs.
Most works on neural programming either rely only on black-box function evaluations (Graves et al., 2014; Balog et al., 2016) or on the availability of detailed program execution traces, where entire programs runs are recorded under different input conditions (Reed & De Freitas, 2015; Cai et al., 2017).
Black-box function evaluations are easy to obtain since we only need to generate inputs and outputs to various functions in the domain.
However, by themselves, they do not result in powerful generalizable models, since they do not have sufﬁcient information about the underlying structure of the domain.
On the other hand, execution traces capture the underlying structure, but, it is generally hard to obtain them under a large number of input conditions; and even if they are available, the computational complexity of incorporating them is enormous.
Due to the lack of good coverage, these approaches fail to generalize to programs of higher complexity and to domains with a large number of functions.
Moreover, the performance of these frameworks is severely dependent on the nature of execution traces: more efﬁcient programs lead to a drastic improvement in performance (Cai et al., 2017), but such programs may not be readily available.
In many problem domains, in addition to function evaluations, one typically has access to more information such as symbolic representations that encode the relationships between the given variables and functions in a succinct manner.
For instance, in physical systems such as ﬂuid dynamics or robotics, the physical model of the world imposes constraints on the values that different variables can take.
In the domain of programming languages, declarative languages explicitly declare variables in the program.
Examples include database query languages (e.g., SQL), regular expressions, functional programming, etc.
Declarative programs greatly simplify parallel programs through the generation of symbolic computation graphs, and have thus been used in modern deep learning packages, e.g.
Theano Theano Development Team (2016), Tensorﬂow Abadi et al.
and Mxnet Chen et al.
Therefore, there is availability of rich symbolic expression data in many domains.
Summary of Results: We introduce a ﬂexible and a scalable neural programming framework that combines the knowledge of symbolic expressions with black-box function evaluations.
To our knowledge, we are the ﬁrst to consider such a combined framework.
We demonstrate that this approach outperforms existing methods by a signiﬁcant margin, using only a small amount of training data.
The paper has three main contributions.
(1) We design a neural architecture to incorporate both symbolic expressions and black-box function evaluation data.
(2) We evaluate it on tasks such as equation veriﬁcation and completion in the domain of mathematical equation modeling.
(3) We propose a data generation strategy for both symbolic expressions and numerical evaluations that results in good balance and coverage.
We consider mathematical equations as a case study, since it has been used extensively in previous neural programming works, e.g. Zaremba et al.
; Allamanis et al.
; Loos et al.
We employ tree LSTMs to incorporate the symbolic expression tree, with one LSTM cell for each mathematical function.
The parameters of the LSTM cells are shared across different expressions, wherever the same function is used.
This weight sharing allows us to learn a large number of mathematical functions simultaneously, whereas most previous works aim at learning only one or few mathematical functions.
We then extend tree LSTMs to not only accept symbolic expression input, but also numerical data from black-box function evaluations.
We employ tree encoding for numbers that appear in function evaluations, based on their decimal representation (see Fig. 1c).
This allows our model to generalize to unseen numbers which has been a struggle for neural programing researchers so far.
We show that such a recursive neural architecture is able to generalize to unseen numbers as well as to unseen symbolic expressions.
We evaluate our framework on two tasks: equation veriﬁcation and completion.
Under equation veriﬁcation, we further consider two sub-categories: verifying the correctness of a given symbolic identity as a whole, or verifying evaluations of symbolic expressions under given numerical inputs.
Equation completion involves predicting the missing entry in a mathematical equation.
This is employed in applications such as mathematical question answering (QA).
We establish that our framework outperforms existing approaches on these tasks by a signiﬁcant margin, especially in terms of generalization to equations of higher depth and on domains with a large number of functions.
We propose a novel dataset generation strategy to obtain a balanced dataset of correct and incorrect symbolic mathematical expressions and their numerical evaluations.
Previous methods do an exhaustive search of all possible parse trees and are therefore, limited to symbolic trees of small depth (Allamanis et al., 2016).
Our dataset generation strategy relies on dictionary look-up and sub-tree matching and can be applied to any domain by providing a basic set of axioms as inputs.
Our generated dataset has good coverage of the domain and is key to obtaining superior generalization performance.
We are also able to scale up our coverage to include about 3.5 × mathematical functions compared to the previous works (Allamanis et al., 2016; Zaremba et al., 2014).
Related work: Early work on automated programming used ﬁrst order logic in computer algebra systems such as Wolfram Mathematica and Sympy.
However, these rule-based systems required extensive manual input and cannot be generalized to new programs.
Graves et al.
introduced using memory in neural networks for learning functions such as grade-school addition and sorting.
Since then, many works have extended it to tasks such as program synthesis, program induction and automatic differentiation (Boˇsnjak et al., 2016; Tran et al., 2017; Balog et al., 2016; Parisotto et al., 2016; Reed & De Freitas, 2015; Mudigonda et al., 2017; Sajovic & Vuk, 2016; Piech et al., 2015).
Based on the type of data that is used to train the models, frameworks in neural programming are categorized under 4 different classes.
(1) Models that use black-box function evaluation data (Graves et al., 2014;
Balog et al., 2016; Parisotto et al., 2016; Zaremba et al., 2014), (2) models that use program execution traces (Reed & De Freitas, 2015;
Cai et al., 2017).
(3) models that use a combination of black-box input-output data and weak supervision from program sketches (Boˇsnjak et al., 2016; Neelakantan et al., 2015) and ﬁnally (4) models that use symbolic data (Allamanis et al., 2016; Loos et al., 2017).
Our work is an extension of models of category 3 which uses symbolic data instead of weak supervision.
Therefore, we can obtain generalizable models that are capable of function evaluation.
Moreover, this combination allows us to scale up the domain and model more functions as well as learn more complex structures.
One of the extensively studied applications of neural programming is reasoning with mathematical equations.
These works include automated theorem provers (Loos et al., 2017; Rockt¨aschel & Riedel, 2016; Yuan;
Alemi et al., 2016; law Chojecki, 2017; Kaliszyk et al., 2017) or computer algebra-like systems (Allamanis et al., 2016; Zaremba et al., 2014).
Our work is closer to the latter, under this categorization, however, the problem that we solve is in nature different.
Allamanis et al.
(2016) and
Zaremba et al.
(2014) aim at simplifying mathematical equations by deﬁning equivalence classes of symbolic expressions that can be used in a symbolic solver.
Our problem is mathematical equation veriﬁcation and completion which has broader applicability.
Recent advances in symbolic reasoning and natural language processing have indicated the signiﬁcance of applying domain structure to the models to capture compositionality and semantics.
Socher et al.
(2011; 2012) proposed tree-structured neural networks for natural language parsing and neural image parsing.
Cai et al.
(2017) proposed using recursion for capturing the compositionality of computer programs.
Both Zaremba et al.
(2014) and Allamanis et al.
(2016) used tree-structured neural networks for modeling mathematical equations.
Tai et al. (2015) introduced tree-structured
LSTM for semantic relatedness in natural language processing.
We will show that this powerful model outperforms other tree-structured neural networks for validating mathematical equations.
M ATHEMATIC E QUATION M ODELING
We now address the problem of modeling symbolic mathematical equations.
Our goal is to validate the correctness of a symbolic mathematical equation.
This then enables us to perform equation completion.
We limit ourselves to the domain of trigonometry and elementary algebra in this paper.
In this section, we ﬁrst discuss our grammar that explains the domain under our study.
we later describe how we generate a dataset of correct and incorrect symbolic equations within our grammar.
We talk about how we combine this data with a few input-output examples to enable function evaluation.
This dataset allows us to learn representations for the functions that capture their semantic properties, i.e. how they relate to each other, and how they transform the input when applied.
We interchangeably use the word identity for referring to mathematical equations and input-output data to refer to function evaluations.
2. G RAMMAR
Let us start by deﬁning our domain of the mathematical identities using the context-free grammar notation.
Identities (I), by deﬁnition, consist of two expressions that we are trying to validate (Eq.
A mathematical expression, represented by E in Eq.
(2), is composed either of a terminal ( T ), such as a constant or a variable, a unary function applied to any expression ( F 1 ), or a binary function applied to two expression arguments ( F 2 ).
Functions that take more than two arguments, i.e. n -ary functions with n > 2 , are omitted from our task description, however, it should be noted that this grammar covers the entire space of trigonometric and elementary algebraic identities since n -ary functions like addition can be represented as the composition of multiple binary addition functions.
The trigonometry grammar rules are thus as follows:
[Equation]
Table 1 presents the complete list of functions, symbols and constants of the grammar.
Note that we exclude subtraction and division because they can be represented with addition, multiplication and power, respectively.
Furthermore, the equations can have as many variables as needed.
The above formulation provides a parse tree for any symbolic and function evaluation expression, a crucial component for representing the equations in a model.
Figure 1 illustrates 3 examples of an sin cos = ^ ✓ ✓ ^ + (a) sin 2 ( θ )
+ cos 2 ( θ )
=sin ⇥
= 2 .⇥ 0 .(b) sin( − 2 . 5)
= − 0 .=
+ ⇥ ^  ^ ⇥ 2 .
(c) decimal tree for 2 .
[Table]
exp
Terminal, T      0 .− 1 0 .0 .π
x
Binary, F+ ×∧ identity in our grammar in terms of its expression tree.
It is worth noting that there is an implicit notion of depth of an identity in the expression tree.
Since deeper equations are compositions of multiple simpler equations, validating higher-depth identities requires reasoning beyond what is required for identities with lower depths, and thus depth of an equation is somewhat indicative of the complexity of the mathematical expression.
However, depth is not sufﬁcient; some higher depth identities such as 1 + 1 + 1 + 1 = 4 may be much easier to validate than tan 2 θ + 1 = acos 2 θ .
Symbolic and function evaluation expressions are differentiated by the type of their terminals.
Symbolic expressions have terminals of type constant or variable, whereas function evaluation expressions have constants and numbers as terminals.
We will come back to this distinction in section 3 where we deﬁne our model.
As shown in Table 1, our domain includes 28 functions.
This scales up the domain in comparison to the state-of-the-art methods that use up to 8 mathematical functions (Allamanis et al., 2016;
Zaremba et al., 2014).
We will also show that our expressions are of higher complexity as we consider equalities of depth up to 4, resulting in trees of size at most 31.
Compared to the state-of-the-art methods that use trees of size at most 13 (Allamanis et al., 2016).
Axioms: We refer to a small set of basic trigonometric and algebraic identities as axioms.
These axioms are gathered from the Wikipedia page on trigonometric identities 1 as well as manually speciﬁed ones covering elementary algebra.
This set consists of about 140 identities varying in depth from 1 to 7.
Some examples of our axioms are (in ascending order of depth), x = x , x + y
=
y
+ x , x × ( y × z ) =
( x × y )
× z , sin 2 ( θ ) + cos 2 ( θ ) = 1 and sin(3 θ )
= − 4 sin 3 ( θ ) + 3 sin( θ ) .
These axioms represent the basic properties of the mathematical functions in trigonometry and algebra, but do not directly specify their input/output behavior.
The axioms, consisting of only positive (or correct) identities, serve as a starting set for generating a dataset of mathematical identities.
2. D ATASET OF M ATHEMATICAL E QUATIONS
In order to provide a challenging and accurate benchmark for our task, we need to create a large, varied collection of correct and incorrect identities, in a manner that can be extended to other domains in mathematics easily.
Our approach is based on generating new mathematical identities by performing local random changes to known identities, starting with 140 axioms described above.
These changes result in identities of similar or higher complexity (equal or larger depth), which may be correct or incorrect, that are valid expressions within the grammar.
Generating Possible Identities: To generate a new identity, we select an equation at random from the set of known equations, and make local changes to it.
In order to do this, we ﬁrst randomly select a node in the expression tree, followed by randomly selecting one of the following actions to make the local change to the equation at the selected node:
• ShrinkNode:
Replace the node, if it’s not a leaf, with one of its children, chosen randomly.
• ReplaceNode: Replace the symbol at the node (i.e. the terminal or the function) with another compatible one, chosen randomly.
• GrowNode:
Provide the node as input to another randomly drawn function f , which then replaces the node.
If f takes two inputs, the second input will be generated randomly from the set of terminals.
• GrowSides:
If the selected node is an equality, either add or multiply both sides with a randomly drawn number, or take both sides to the power of a randomly drawn number.
At the end of this procedure we use a symbolic solver, sympy (Meurer et al., 2017), to separate correct equations from incorrect ones.
Since we are performing the above changes randomly, the number of generated incorrect equations are overwhelmingly larger than the number of correct identities.
This makes the training data highly unbalanced and is not desired.
Therefore, we propose a method based on sub-tree matching to generate new correct identities.
Generating Additional Correct Identities:
In order to generate only correct identities, we follow the same intuition as above, but only replace structure with others that are equal .
In particular, we maintain a dictionary of valid statements ( mathDictionary ) that maps a mathematical statement to another.
For example, the dictionary key x + y has value y + x .
We use this dictionary in our correct equation generation process where we look up patterns from the dictionary.
More speciﬁcally, we look for keys that match a subtree of the equation then replace that subtree with the pattern of the value of the key.
E.g. given input equation sin 2 ( θ ) + cos 2 ( θ ) = 1 , this subtree matching might produce equality cos 2 θ + sin 2 ( θ ) = 1 by ﬁnding key-value pair x + y : y + x .
The initial mathDictionaty is constructed from the input list of axioms.
At each step of the equation generation, we choose one equation at random from the list of correct equations so far, and choose a random node n of this equation tree for changing.
We look for a subtree rooted at n that matches one or several dictionary keys.
We randomly choose one of the matches and replace the subtree with the value of the key by looking up the mathDictionary .
We generate all possible equations at a particular depth before proceeding to a higher depth.
In order to ensure this, we limit the depth of the ﬁnal equation and only increase this limit if no new equations are added to the correct equations for a number of repeats.
Generating Function Evaluation data: We generate a few input-output examples from a speciﬁc range of numbers for the functions in our domain.
For unary functions, we randomly draw ﬂoating point numbers of ﬁxed precision in the range and evaluate the functions for the randomly drawn number.
For binary functions we repeat the same with two randomly generated numbers.
To make this collection balanced as well, at each step we generate two outputs per input conﬁguration, a correct and an incorrect one.
Note that function evaluation results in identities of depths 2 and 3.
It is important for our dataset to also have a representation of the numbers that are used in evaluation.
We represent the ﬂoating point numbers with their decimal expansion which is representable in our grammar.
In order to make this clear, consider number 2.5.
In order to represent this number, we expand it into its decimal representation 2 .
5 = 2 × 10 0 + 5 × 10 − 1 and feed this as one of the expressions for training (Figure 1c).
Therefore, we can represent ﬂoating point numbers of ﬁnite precision using integers in the range [-1,10].
T REE LSTM A RCHITECTURE FOR M ODELING E QUATIONS
Analogous to how humans learn trigonometry and elementary algebra, we propose using basic axioms to learn about the properties of mathematical functions.
Moreover, we leverage the underlying structure of each mathematical identity to make predictions about their validity.
Both Zaremba et al.
(2014) and Allamanis et al.
(2016) validate the effectiveness of using tree-structured neural networks for modeling equations.
Tai et al.
(2015) show that Tree LSTMs are powerful models for capturing
✓
W symb
W symb W symb
W sin
W cos
W +
W ^ ✓
W symb W symb
W ^ one-hot encoding dense embeddings
Is it true?
LSTM or RNN cell  ( · ) dense embeddings W sin
W num
Are they the same?
2 .0 .
W symb
W ⇥
W num
W symb
W ⇥ one-hot encoding
W  1 num
W  1 num the semantics of the data.
Therefore, We use the Tree LSTM model to capture the compositionality of the equation and show that it improves the performance over simpler tree-structured, a.k.a recursive, neural networks.
We describe the details of the model and training setup in this section.
Tree LSTM Model for Symbolic Expressions and Function Evaluations
The structure of Tree
LSTM mirrors the parse-tree of each input equation.
As described in section 2.1 an equation consists of terminals and binary and unary functions.
Terminals are input to Tree LSTM through the leaves that embeds their representation using vectors.
Each function is associated with an LSTM block with its own weights, with the weights shared among all appearances of the function in different equations.
we predict the validity of each equation at the root of the tree.
The architecture of the neural network is slightly different for symbolic expressions compared to function evaluation expressions.
Recall from section 2.1, that the two are distinguished by their terminal types.
This directly reﬂects to the structure of the network used in the leaves for embedding.
Moreover, we use different loss functions for each type of expressions as described below.
• Symbolic expressions These expressions consist of constants and symbols.
These terminals are represented with their one-hot encoding and are passed through symbol , a single layer neural network block.
The validity of a symbolic expression is veriﬁed by computing the dot product of the left-hand-side and right-hand-side vector embeddings and applying the logistic function.
• function evaluation expressions
In order to encode the terminals of function evaluation expressions we train an autoencoder.
The encoder side embeds the ﬂoating point numbers into a high-dimensional vector space.
We call this a number block.
The decoder of this auto-encoder is trained for predicting the ﬂoating point number given an input embedding.
We call this the decoder block.
We pass the output vector embedding of the left-hand-side and right-hand-side to the decoder block.
The validity of a function evaluation is then computed by minimizing the MSE loss of the decoder outputs of each side.
Figure 2 illustrates our tree LSTM structure constructed from the parse-tree of the equations in
Figures 1a and 1b.
Baseline Models We compare our proposed model with chain-structured neural networks, such as sequential Recurrent Neural Networks (RNN), LSTMS’s as well as tree-structured neural networks (TreeNN’s) consisting of fully connected layers (Socher et al., 2011; Zaremba et al., 2014).
It should be noted that both these papers discover equivalence classes in a dataset, and since our data consists of many equivalence classes especially for the function evaluation data, we do not use the EqNet model proposed in (Allamanis et al., 2016) as a baseline.
As we will show in the experiments, the structure of the network is crucial for equation veriﬁcation and equation completion.
Moreover, by adding function evaluation data to the tree-structured models we show that using this type of data not only broadens the applicability of the model to enable function evaluation, but it also enhances the ﬁnal accuracy of the symbolic equations compared to when no function evaluation data is used.
We demonstrate that Tree LSTMs outperform Tree NN’s by a large margin with or without function evaluation data in all the experiments.
We attribute this to the fact that LSTM cells ameliorate vanishing and exploding gradients along paths in the tree compared to fully-connected blocks used in Tree NNs.
This enables the model to be capable of reasoning in equations of higher depth where reasoning is a more difﬁcult task compared to an equation of lower depth.
Therefore, it is important to use both a tree and a cell with addressable differentiable memory, such as an LSTM cell for modeling the properties of mathematical functions.
Implementation Details Our neural networks are developed using MxNet (Chen et al., 2015).
All the experiments and models are tuned over the same search space and the reported results are the best achievable prediction accuracy for each method.
We use L 2 -regularization as well as dropout to avoid overﬁtting, and train all the models for 100 epochs.
We have tuned for the hidden dimension { 10,20,50 } , the optimizers { SGD, NAG (Nesterov accelerated SGD), RMSProp, Adam, AdaGrad,
AdaDelta, DCASGD, SGLD (Stochastic Gradient Riemannian Langevin Dynamics) } , dropout rate { 0.2,0.3 } , learning rate { 10 − 3 , 10 − 5 } , regularization ratio { 10 − 4 , 10 − 5 } and momentum { 0.2,0.7 } .
Most of the networks achieved their best performance using Adam optimizer Kingma & Ba (2014) with a learning rate of 0.001 and a regularization ratio of 10 − 5 .
Hidden dimension and dropout varies under each of the scenarios.
E XPERIMENTS AND R ESULTS
We indicate the complexity of an identity by its depth.
We setup the following experiments to evaluate the performance and the generalization capability of our proposed framework.
We investigate the behavior of the learned model on two different tasks of equation veriﬁcation and equation completion.
Under both tasks, We assess the results of the method on symbolic as well as function evaluation expressions.
We compare each of the models with sequential Recurrent Neural Networks (RNN),
LSTMs and recursive tree neural networks also knows as Tree NN’s.
Moreover, we show the effect of adding function evaluation data to the ﬁnal accuracy on symbolic expressions.
All the models train on the same dataset of symbolic expressions.
Models, Tree LSTM + data and Tree NN + data use function evaluation data on top of the symbolic data.
Our dataset consists of 17632 symbolic equations, 8902 of which are correct.
This data includes 39 equations of depth 1 , 2547 equations of depth 2 , 12217 equations of depth 3 and 2836 equations of depth 4 .
It should be noted that the equations of depth 1 and 2 have been maxed out in the data generation.
We also add 2000 function evaluation equations and decimal expansion trees for numbers that includes 1029 correct samples.
We have 2 equations of depth 1 , 831 equations of depth 2 and 1128 equations of depth 3 in this function evaluation dataset.
Our numerical data includes 30% of numbers of precision 2 in the range [ − 3 .
14 , 3 . 14] chosen at random.
Equation Veriﬁcation - Generalization to Unseen Identities: In this experiment we randomly split all of the generated data that includes equations of depths 1 to 4 into train and test partitions with an 80%/20% split ratio.
We evaluate the accuracy of the predictions on the held-out data.
The results of this experiment are presented in Table 2.
As it can be seen, tree structured networks are able to make better predictions compared to chain-structured or ﬂat networks.
Therefore, we are leveraging the structure of the identities to capture information about their validity.
Moreover, the superiority of
Tree LSTM to Tree NN shows that it is important to incorporate cells that have memory.
The detailed prediction accuracy broken in terms of depth and also in terms of symbolic and function evaluation expressions is also given in Table 2.
Equation Veriﬁcation - Extrapolation to Unseen Depths: Here we evaluate the generalization of the learned model to equations of higher and lower complexity.
Generalization to equations of higher depth indicates that the network has been able to learn the properties of each mathematical function and is able to use this in more complex equations to validate their correctness.
Ability to generalize to lower complexity indicates whether the model can infer properties of simpler mathematical functions by observing their behavior in complex equations.
For each setup, we hold out symbolic expressions of a certain depth and train on the remaining depths.
Table 3 presents the results of both setups, which suggest that Tree LSTM trained on a combination of symbolic and function evaluation data, outperforms all other methods across all metrics.
Comparing the symbolic accuracy of Tree models
[Table]
[Table]
TreeNN + data 92.
TreeLSTM + data 96.
with and without the function evaluation data, we conclude that our models are able to utilize the patterns in the function evaluations to improve and better model the symbolic expressions as well.
Equation Completion: In this experiment, we evaluate the capability of the model in completing equations by ﬁlling in a blank in unseen identities.
For this experiment, we use the same models as reported in table 2.
We take all the test equations and randomly choose a node of depth either 1 orin each equation, and replace it with all possible conﬁgurations of depth 1 and 2 expressions from our
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Table]
[Figure]
grammar.
We then give this set of equations to the models and look at the top k predictions for the blank.
We perform equation completion on both symbolic and numeric expressions.
Figures 3a and 3b show the average accuracy of the top- k predictions vs. k .
We deﬁne the top- k accuracy as the percentage of samples for which there is at least one correct match for the blank in the top k predictions.
This indicates that the hardest task is to have a high accuracy for k = 1 .
Further, for function evaluation, this indicates that the prediction has to be exactly the same (up to the ﬁxed precision of 2 decimal points), hence the lower accuracies in Figure 3b.
Therefore, as in Fig 3a, the differences at k = 1 for models that use function evaluation data vs models that do not, indicates the importance of combining symbolic and function evaluation data for the task of equation completion.
We can also see that tree-structured models are substantially better than sequential models, indicating that it is important to capture the compositionality of the data in the structure of the model.
Finally,
Tree LSTM shows superior performance compared to Tree NN under both scenarios.
We present examples of some equations, and the generated candidates, in Figures 4a and 4b for the
Tree LSTM + data model.
Figure 4a presents the results on a symbolic equation for which the correct prediction value is 1 .
The Tree LSTM is able to generate many candidates with a high conﬁdence, all of which are correct.
On the other hand, in Figure 4b, we show a function evaluation example, where the top prediction ( 0 . 28 ) is the correct value for tan with precision 2 , but even other predictions are quite close.
We also present example predictions of our model for function evaluations by plotting the top predicted values for cos on samples of test data in Figure 4c.
C ONCLUSIONS AND F UTURE W ORK
In this paper we proposed combining black-box function evaluation data with symbolic expressions to improve the accuracy and broaden the applicability of previously proposed models in this domain.
We apply this to the novel task of validating and completing mathematical equations.
We studied the space of trigonometry and elementary algebra as a case study to validate the proposed model.
We also proposed a novel approach for generating a dataset of mathematical identities and generated identities in trigonometry and elementary algebra.
As noted, our data generation technique is not limited to trigonometry and elementary algebra.
We show that under various experimental setups,
Tree LSTM’s trained on a combination of symbolic expressions and black-box function evaluation achieves superior results compared to the state-of-the-art models.
In our future work we will expand our testbed to include other mathematical domains, inequalities, and systems of equations.
What is interesting about multiple domains is to investigate if the learned representations for one domain can be transfered to the other domains, and whether the embedding of each domain are clustered close to each other similar to the way the word embedding vectors behave.
We are also interested in exploring recent neural models with addressable differentiable memory, in order to evaluate whether they can handle equations of much higher complexity.