• Login
    View Item 
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    •   Home
    • UA Graduate and Undergraduate Research
    • UA Theses and Dissertations
    • Dissertations
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of UA Campus RepositoryCommunitiesTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournalThis CollectionTitleAuthorsIssue DateSubmit DateSubjectsPublisherJournal

    My Account

    LoginRegister

    About

    AboutUA Faculty PublicationsUA DissertationsUA Master's ThesesUA Honors ThesesUA PressUA YearbooksUA CatalogsUA Libraries

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Explainable Multi-Step Reasoning Over Natural Language

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    azu_etd_20780_sip1_m.pdf
    Size:
    2.572Mb
    Format:
    PDF
    Download
    Author
    Liang, Zhengzhong
    Issue Date
    2023
    Keywords
    generative language model
    machine reasoning
    Advisor
    Surdeanu, Mihai
    
    Metadata
    Show full item record
    Publisher
    The University of Arizona.
    Rights
    Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction, presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
    Embargo
    Release after 09/27/2024
    Abstract
    Despite the significant progress of reasoning over natural language in the recent years, multi-step natural language reasoning is still a great challenge to the current algorithms. The challenges come from three aspects. First, some multi-step reasoning problems require the retrieval of evidence from large knowledge bases, while neither traditional information retrieval (IR) methods nor neural IR methods yield satisfactory results. Second, neural language models are largely black boxes, and how the language models solve the multi-step reasoning problems are unclear, lacking interpretability. Third, neural language models suffer from compositional generalization issues when solving multi-step reasoning problems, meaning that when the models are trained on simple tasks but tested on the hard tasks that require more reasoning steps than in training, they tend to fail. In this dissertation we seek to mitigate these challenges. First, we propose a simple yet effective algorithm to combine traditional word-overlap based IR methods with neural IR methods. As the first step, we design linear probe tasks to formally show that traditional IR and neural IR are good at handling different queries. Following this observation, we propose a routing algorithm that selects whether to use traditional IR or neural IR for each query. The empirical evaluation on three datasets shows that the proposed routing algorithm yields equally good or better performance than individual IR methods. Second, we propose Explainable Verbal Reasoner (EVR) to increase the interpretability and reduce the compositional generalization issue of language models. EVR increases the interpretability of language models in two ways: (1) EVR decomposes a complex multi-step reasoning problem to a few simple problems, and different decomposed problems are finished by dedicated modules; (2) for a complex multi-step reasoning problem, EVR generates the intermediate reasoning steps in the text form, including symbolic operators and natural language explanations. Empirical evaluation on a synthetic multi-step reasoning dataset shows that EVR is able to largely reduce the compositional generalization issue of language models, compared with a few strong baselines. Finally, we propose Explainable Verbal Reasoner Plus (EVR+), a reasoning framework that can handle diverse types of reasoning. EVR+ is also proposed to increase the interpretability and reduce the compositional generalization issue of language models when handling multi-step reasoning problems, and EVR+ shares the same key features as EVR. However, EVR+ is able to handle much more diverse types of reasoning problems than EVR. We achieve this by allowing EVR+ to generate very diverse types of symbolic operators, and devise an interpreter that can parse and execute such operators. To evaluate EVR+, we propose SynthCompR, a synthetic dataset containing five tasks that require compositional reasoning over natural language. Results show that EVR+ is able to achieve much better compositional generalization performance than a strong neural baseline.
    Type
    Electronic Dissertation
    text
    Degree Name
    Ph.D.
    Degree Level
    doctoral
    Degree Program
    Graduate College
    Computer Science
    Degree Grantor
    University of Arizona
    Collections
    Dissertations

    entitlement

     
    The University of Arizona Libraries | 1510 E. University Blvd. | Tucson, AZ 85721-0055
    Tel 520-621-6442 | repository@u.library.arizona.edu
    DSpace software copyright © 2002-2017  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.