Turker Tuncer, Sengul Dogan, Mehmet Baygin, Prabal Datta Barua, Abdul Hafeez-Baig, Ru-San Tan, Subrata Chakraborty, U. Rajendra Acharya
{"title":"Solving the multiplication problem of a large language model system using a graph-based method","authors":"Turker Tuncer, Sengul Dogan, Mehmet Baygin, Prabal Datta Barua, Abdul Hafeez-Baig, Ru-San Tan, Subrata Chakraborty, U. Rajendra Acharya","doi":"arxiv-2310.13016","DOIUrl":null,"url":null,"abstract":"The generative pre-trained transformer (GPT)-based chatbot software ChatGPT\npossesses excellent natural language processing capabilities but is inadequate\nfor solving arithmetic problems, especially multiplication. Its GPT structure\nuses a computational graph for multiplication, which has limited accuracy\nbeyond simple multiplication operations. We developed a graph-based\nmultiplication algorithm that emulated human-like numerical operations by\nincorporating a 10k operator, where k represents the maximum power to base 10\nof the larger of two input numbers. Our proposed algorithm attained 100%\naccuracy for 1,000,000 large number multiplication tasks, effectively solving\nthe multiplication challenge of GPT-based and other large language models. Our\nwork highlights the importance of blending simple human insights into the\ndesign of artificial intelligence algorithms. Keywords: Graph-based\nmultiplication; ChatGPT; Multiplication problem","PeriodicalId":501310,"journal":{"name":"arXiv - CS - Other Computer Science","volume":"48 3","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Other Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2310.13016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The generative pre-trained transformer (GPT)-based chatbot software ChatGPT
possesses excellent natural language processing capabilities but is inadequate
for solving arithmetic problems, especially multiplication. Its GPT structure
uses a computational graph for multiplication, which has limited accuracy
beyond simple multiplication operations. We developed a graph-based
multiplication algorithm that emulated human-like numerical operations by
incorporating a 10k operator, where k represents the maximum power to base 10
of the larger of two input numbers. Our proposed algorithm attained 100%
accuracy for 1,000,000 large number multiplication tasks, effectively solving
the multiplication challenge of GPT-based and other large language models. Our
work highlights the importance of blending simple human insights into the
design of artificial intelligence algorithms. Keywords: Graph-based
multiplication; ChatGPT; Multiplication problem