Simulating Problem Difficulty in Arithmetic Cognition Through Dynamic Connectionist Models

05/09/2019
by   Sungjae Cho, et al.
0

The present study aims to investigate similarities between how humans and connectionist models experience difficulty in arithmetic problems. Problem difficulty was operationalized by the number of carries involved in solving a given problem. Problem difficulty was measured in humans by response time, and in models by computational steps. The present study found that both humans and connectionist models experience difficulty similarly when solving binary addition and subtraction. Specifically, both agents found difficulty to be strictly increasing with respect to the number of carries. Another notable similarity is that problem difficulty increases more steeply in subtraction than in addition, for both humans and connectionist models. Further investigation on two model hyperparameters --- confidence threshold and hidden dimension --- shows higher confidence thresholds cause the model to take more computational steps to arrive at the correct answer. Likewise, larger hidden dimensions cause the model to take more computational steps to correctly answer arithmetic problems; however, this effect by hidden dimensions is negligible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/13/2022

Agents facilitate one category of human empathy through task difficulty

One way to improve the relationship between humans and anthropomorphic a...
research
03/15/2018

Rigid models of Presburger arithmetic

We present a description of rigid models of Presburger arithmetic (i.e.,...
research
06/25/2021

Improving Human Decisions by Adjusting the Alerting Thresholds for Computer Alerting Tools According to User and Task Characteristics

Objective: To investigate whether performance (number of correct decisio...
research
03/28/2014

Difficulty Rating of Sudoku Puzzles: An Overview and Evaluation

How can we predict the difficulty of a Sudoku puzzle? We give an overvie...
research
05/25/2021

Guiding the Growth: Difficulty-Controllable Question Generation through Step-by-Step Rewriting

This paper explores the task of Difficulty-Controllable Question Generat...
research
10/04/2019

Measuring Arithmetic Extrapolation Performance

The Neural Arithmetic Logic Unit (NALU) is a neural network layer that c...
research
03/11/2020

Magic: the Gathering is as Hard as Arithmetic

Magic: the Gathering is a popular and famously complicated card game abo...

Please sign up or login with your details

Forgot password? Click here to reset