Analyzing the Nuances of Transformers' Polynomial Simplification Abilities

04/29/2021
by   Vishesh Agarwal, et al.
0

Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from traditional end-to-end settings, and explore a step-wise polynomial simplification task. Polynomials can be written in a simple normal form as a sum of monomials which are ordered in a lexicographic order. For a polynomial which is not necessarily in this normal form, a sequence of simplification steps is applied to reach the fully simplified (i.e., in the normal form) polynomial. We propose a synthetic Polynomial dataset generation algorithm that generates polynomials with unique proof steps. Through varying coefficient configurations, input representation, proof granularity, and extensive hyper-parameter tuning, we observe that Transformers consistently struggle with numeric multiplication. We explore two ways to mitigate this: Curriculum Learning and a Symbolic Calculator approach (where the numeric operations are offloaded to a calculator). Both approaches provide significant gains over the vanilla Transformers-based baseline.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2018

Normal and Triangular Determinantal Representations of Multivariate Polynomials

In this paper we give a new and simple algorithm to put any multivariate...
research
11/03/2015

Improved Polynomial Remainder Sequences for Ore Polynomials

Polynomial remainder sequences contain the intermediate results of the E...
research
06/16/2020

On the Computational Power of Transformers and Its Implications in Sequence Modeling

Transformers are being used extensively across several sequence modeling...
research
02/05/2016

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix

Given a square, nonsingular matrix of univariate polynomials F∈K[x]^n × ...
research
08/22/2019

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials

We study the arithmetic circuit complexity of some well-known family of ...
research
11/06/2020

Extending Equational Monadic Reasoning with Monad Transformers

There is a recent interest for the verification of monadic programs usin...
research
02/19/2022

Do Transformers use variable binding?

Increasing the explainability of deep neural networks (DNNs) requires ev...

Please sign up or login with your details

Forgot password? Click here to reset