Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lee, Younghun, Kim, Sungchul, Rossi, Ryan A., Yu, Tong, Chen, Xiang
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:https://arxiv.org/abs/2407.02750
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910511128379392
author Lee, Younghun
Kim, Sungchul
Rossi, Ryan A.
Yu, Tong
Chen, Xiang
author_facet Lee, Younghun
Kim, Sungchul
Rossi, Ryan A.
Yu, Tong
Chen, Xiang
contents Large Language Models (LLMs) have been achieving competent performance on a wide range of downstream tasks, yet existing work shows that inference on structured data is challenging for LLMs. This is because LLMs need to either understand long structured data or select the most relevant evidence before inference, and both approaches are not trivial. This paper proposes a framework, Learning to Reduce, that fine-tunes a language model with On-Policy Learning to generate a reduced version of an input structured data. When compared to state-of-the-art LLMs like GPT-4, Learning to Reduce not only achieves outstanding performance in reducing the input, but shows generalizability on different datasets. We further show that the model fine-tuned with our framework helps LLMs better perform on table QA tasks especially when the context is longer.
format Preprint
id arxiv_https___arxiv_org_abs_2407_02750
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Learning to Reduce: Towards Improving Performance of Large Language Models on Structured Data
Lee, Younghun
Kim, Sungchul
Rossi, Ryan A.
Yu, Tong
Chen, Xiang
Computation and Language
Large Language Models (LLMs) have been achieving competent performance on a wide range of downstream tasks, yet existing work shows that inference on structured data is challenging for LLMs. This is because LLMs need to either understand long structured data or select the most relevant evidence before inference, and both approaches are not trivial. This paper proposes a framework, Learning to Reduce, that fine-tunes a language model with On-Policy Learning to generate a reduced version of an input structured data. When compared to state-of-the-art LLMs like GPT-4, Learning to Reduce not only achieves outstanding performance in reducing the input, but shows generalizability on different datasets. We further show that the model fine-tuned with our framework helps LLMs better perform on table QA tasks especially when the context is longer.
title Learning to Reduce: Towards Improving Performance of Large Language Models on Structured Data
topic Computation and Language
url https://arxiv.org/abs/2407.02750