With the recent advancements in deep learning, neural solvers have gained promising results in solving math word problems. However, these SOTA solvers only generate binary expression trees that contain basic arithmetic operators and do not explicitly use the math formulas. As a result, the expression trees they produce are lengthy and uninterpretable because they need to use multiple operators and constants to represent one single formula. In this paper, we propose sequence-to-general tree (S2G) that learns to generate interpretable and executable operation trees where the nodes can be formulas with an arbitrary number of arguments. With nodes now allowed to be formulas, S2G can learn to incorporate mathematical domain knowledge into problem-solving, making the results more interpretable. Experiments show that S2G can achieve a better performance against strong baselines on problems that require domain knowledge.
MWP-BERT: Numeracy-Augmented Pre-training for Math Word Problem Solving
University of Notre Dame(圣母大学);Hong Kong University of Science and Technology(香港科技大学);Singapore Management University(新加坡管理大学);Hefei University of Technology(合肥工业大学);East China Normal University(华东师范大学);University of Electronic Science and Technology of China(电子科技大学)
Solving Math Word Problems Using Estimation Verification and Equation Generation
Computer Science University of Iowa(计算机科学 威斯康星大学);Computer Science University of Colorado(计算机科学 色达省大学);Foster School of Business University of Washington(福斯特商学院 威斯康星大学)
Ten Words Only Still Help: Improving Black-Box AI-Generated Text Detection via Proxy-Guided Efficient Re-Sampling
Key Lab of Intelligent Information Processing of Chinese Academy of Sciences(中国科学院智能信息处理重点实验室);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Xi’an Jiaotong University(西安交通大学)
National University of Singapore(新加坡国立大学);University of Electronic Science and Technology of China(电子科技大学);The Hong Kong Polytechnic University(香港理工大学)
Human-guided Collaborative Problem Solving: A Natural Language based Framework
University of Texas at Dallas(德克萨斯大学达拉斯分校);Microsoft Research India(微软印度研究院);Washington State University(华盛顿州立大学);University of Colorado Boulder(科罗拉多大学博尔德分校);University of Pennsylvania(宾夕法尼亚大学);University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)
A Diversity-Enhanced Knowledge Distillation Model for Practical Math Word Problem Solving
Faculty of Artificial Intelligence in Education, Central China Normal University(华中师范大学教育人工智能学院);School of Information and Safety Engineering, Zhongnan University of Economics and Law(中南财经政法大学信息与安全工程学院);School of Computer, Central China Normal University(华中师范大学计算机学院);Information Retrieval and Knowledge Management Research Lab, York University(约克大学信息检索与知识管理研究实验室)
Proposing and solving olympiad geometry with guided tree search
Beijing Institute for General Artificial Intelligence (BIGAI)(北京通用人工智能研究院(BIGAI));Institute for Artificial Intelligence, Peking University(北京大学人工智能研究院)
Bolzano: From Expert-Guided Proof Search to Automated Open-Problem Solving
Computer Science Institute, Charles University(查尔斯大学计算机科学研究所);Institute of Formal and Applied Linguistics, Charles University(查尔斯大学形式与应用语言学研究所);Department of Applied Mathematics, Charles University(查尔斯大学应用数学系);Institute of Mathematics, Czech Academy of Sciences(捷克科学院数学研究所)
LogicSolver: Towards Interpretable Math Word Problem Solving with Logical Prompt-enhanced Learning
Shenzhen Campus of Sun Yat-sen University(中山大学深圳校区);Sun Yat-sen University(中山大学);Guangdong University of Technology(广东工业大学);Dark Matter AI Inc.(暗物质人工智能公司)
From Words to Collisions: LLM-Guided Evaluation and Adversarial Generation of Safety-Critical Driving Scenarios
Professorship of Autonomous Vehicle Systems, TUM School of Engineering and Design, Technical University of Munich(自主车辆系统教授职位,技术大学慕尼黑工程与设计学院);Munich Institute of Robotics and Machine Intelligence (MIRMI)(慕尼黑机器人与机器智能研究所);TUM School of Computation, Information and Technology, Department of Computer Engineering, Technical University of Munich(技术大学慕尼黑计算、信息与技术学院,计算机工程系)
Solving Truly Massive Budgeted Monotonic POMDPs with Oracle-Guided Meta-Reinforcement Learning
Department of Aerospace Engineering(航空航天工程系);University of Illinois Urbana Champaign(伊利诺伊大学厄巴纳-香槟分校);Department of Mathematics(数学系);Engineer Research and Development Center(工程研究与发展中心);U.S. Army Corps of Engineers(美国陆军工程兵团)