Solving Math Word Problem with Problem Type Classification

• URL: http://arxiv.org/abs/2308.13844v1
• Date: Sat, 26 Aug 2023 10:35:16 GMT
• Title: Solving Math Word Problem with Problem Type Classification
• Authors: Jie Yao, Zihao Zhou, Qiufeng Wang
• Abstract summary: Math word problems (MWPs) require analyzing text descriptions and generating mathematical equations to derive solutions. Existing works focus on solving MWPs with two types of solvers: tree-based solver and large language model (LLM) solver. This paper utilizes multiple ensemble approaches to improve MWP-solving ability.
• Score: 12.700472956406005
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Math word problems (MWPs) require analyzing text descriptions and generating mathematical equations to derive solutions. Existing works focus on solving MWPs with two types of solvers: tree-based solver and large language model (LLM) solver. However, these approaches always solve MWPs by a single solver, which will bring the following problems: (1) Single type of solver is hard to solve all types of MWPs well. (2) A single solver will result in poor performance due to over-fitting. To address these challenges, this paper utilizes multiple ensemble approaches to improve MWP-solving ability. Firstly, We propose a problem type classifier that combines the strengths of the tree-based solver and the LLM solver. This ensemble approach leverages their respective advantages and broadens the range of MWPs that can be solved. Furthermore, we also apply ensemble techniques to both tree-based solver and LLM solver to improve their performance. For the tree-based solver, we propose an ensemble learning framework based on ten-fold cross-validation and voting mechanism. In the LLM solver, we adopt self-consistency (SC) method to improve answer selection. Experimental results demonstrate the effectiveness of these ensemble approaches in enhancing MWP-solving ability. The comprehensive evaluation showcases improved performance, validating the advantages of our proposed approach. Our code is available at this url: https://github.com/zhouzihao501/NLPCC2023-Shared-Task3-ChineseMWP.

Related papers

• LLaMA-Berry: Pairwise Optimization for O1-like Olympiad-Level Mathematical Reasoning [56.273799410256075]
  The framework combines Monte Carlo Tree Search (MCTS) with iterative Self-Refine to optimize the reasoning path. The framework has been tested on general and advanced benchmarks, showing superior performance in terms of search efficiency and problem-solving capability.
  arXiv  Detail & Related papers  (2024-10-03T18:12:29Z)
• An Unsupervised Learning Framework Combined with Heuristics for the Maximum Minimal Cut Problem [5.092968949752308]
  This work proposes an unsupervised learning framework combined with Maximums for MMCP. A crucial observation is that each solution corresponds to at least one spanning tree. We conduct extensive experiments to evaluate our framework and give a specific application.
  arXiv  Detail & Related papers  (2024-08-16T02:07:34Z)
• Interpretable Decision Tree Search as a Markov Decision Process [8.530182510074983]
  Finding an optimal decision tree for a supervised learning task is a challenging problem to solve at scale. It was recently proposed to frame the problem as a Markov Decision Problem (MDP) and use deep reinforcement learning to tackle scaling. We propose instead to scale the resolution of such MDPs using an information-theoretic tests generating function that generates for every state.
  arXiv  Detail & Related papers  (2023-09-22T08:18:08Z)
• Automatic Algorithm Selection for Pseudo-Boolean Optimization with Given Computational Time Limits [0.9831489366502301]
  Machine learning (ML) techniques have been proposed to automatically select the best solver from a portfolio of solvers. These methods, known as meta-solvers, take an instance of a problem and a portfolio of solvers as input. "Anytime" meta-solvers predict the best-performing solver within the specified time limit.
  arXiv  Detail & Related papers  (2023-09-07T03:04:50Z)
• Generalizing Math Word Problem Solvers via Solution Diversification [56.2690023011738]
  We design a new training framework for an MWP solver by introducing a solution buffer and a solution discriminator. Our framework is flexibly applicable to a wide setting of fully, semi-weakly and weakly supervised training for all Seq2Seq MWP solvers.
  arXiv  Detail & Related papers  (2022-12-01T19:34:58Z)
• LogicSolver: Towards Interpretable Math Word Problem Solving with Logical Prompt-enhanced Learning [135.8654475934613]
  We first construct a high-quality MWP dataset named InterMWP which consists of 11,495 MWPs. We propose a novel approach with logical prompt and interpretation, called Logicr. With these improved semantic representations, our Logicr generates corresponding solution expressions and interpretable knowledge in accord with the generated solution expressions.
  arXiv  Detail & Related papers  (2022-05-17T11:01:52Z)
• The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights [59.93939636422896]
  The ML4CO aims at improving state-of-the-art optimization solvers by replacing key components. The competition featured three challenging tasks: finding the best feasible solution, producing the tightest optimality certificate, and giving an appropriate routing configuration.
  arXiv  Detail & Related papers  (2022-03-04T17:06:00Z)
• Learning by Fixing: Solving Math Word Problems with Weak Supervision [70.62896781438694]
  Previous neural solvers of math word problems (MWPs) are learned with full supervision and fail to generate diverse solutions. We introduce a textitweakly-supervised paradigm for learning MWPs. Our method only requires the annotations of the final answers and can generate various solutions for a single problem.
  arXiv  Detail & Related papers  (2020-12-19T03:10:21Z)
• Semantically-Aligned Universal Tree-Structured Solver for Math Word Problems [129.90766822085132]
  A practical automatic textual math word problems (MWPs) solver should be able to solve various textual MWPs. We propose a simple but efficient method called Universal Expression Tree (UET) to make the first attempt to represent the equations of various MWPs uniformly. Then a semantically-aligned universal tree-structured solver (SAU-r) based on an encoder-decoder framework is proposed to resolve multiple types of MWPs in a unified model.
  arXiv  Detail & Related papers  (2020-10-14T06:27:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.