- [2023-8-7]: We released our code, datasets and PyPI Package. Check it out!
TableQAKit is a unified platform for TableQA (especially in the LLM era). Its main features includes:
- Extensible design: You can use the interfaces defined by the toolkit, extend methods and models, and implement your own new models based on your own data.
- Equipped with LLM: TableQAKit supports LLM-based methods, including LLM-prompting methods and LLM-finetuning methods.
- Comprehensive datasets: We design a unified data interface to process data and store them in Huggingface datasets.
- Powerful methods: Using our toolkit, you can reproduce most of the SOTA methods for TableQA tasks.
- Efficient LLM benchmark: TableQAEval, a benchmark to evaluate the performance of LLM for TableQA. It evaluates LLM's modeling ability of long tables (context) and comprehension capabilities (numerical reasoning, multi-hop reasoning).
- Comprehensive Survey: We are about to release a systematic TableQA Survey, this project is a pre-work. Paper List
pip install tableqakit
or
git clone [email protected]:lfy79001/TableQAKit.git
pip install -r requirements.txt
pip install ttqakit
The TableQAKit repository is structured as follows:
├── icl/ # LLM-prompting toolkit
├── llama/ # LLM-finetuning toolkit
├── mmqa_utils/ # EncyclopediaQA toolkit
│ ├── classifier_module/ # The package for classifier
│ ├── retriever_module/ # The package for encyclopedia retrieval
├── structuredqa/ # Read model TaLMs
│ ├── builder/
│ ├── utils/
├── retriever/ # TableQA's general retriever (SpreadSheet examples)
├── multihop/ # Readers for encyclopediaQA
│ ├── Retrieval/
│ └── Read/
├── numerical/ # Readers for some TableQA datasets
├── TableQAEval/ # The proposed new LLM-Long-Table Benchmark
│ ├── Baselines/ # Add your LLMs
│ │ ├── turbo16k-table.py
│ │ ├── llama2-chat-table.py
│ │ └── ...
│ ├── Evaluation/ # metrics
│ └── TableQAEval.json
├── outputs/ # the results of some models
├── loaders/
│ ├── WikiSQL.py
│ └── ...
├── structs/
│ ├── data.py
├── static/
├── LICENSE
└── README.md
According to our taxonomy, we classify the TableQA task into three categories of tasks, as shown in the following figure:
MultiHiertt Dataset as a demonstration
from TableQAKit.retriever import MultiHierttTrainer
trainer = MultiHierttTrainer()
# train stage:
trainer.train()
# infer stage:
trainer.infer()
python main.py \
--train_mode row \
--per_device_train_batch_size 16 \
--per_device_eval_batch_size 1 \
--dataloader_pin_memory False \
--output_dir ./ckpt \
--train_path ./data/train.json \
--val_path ./data/val.json \
--save_steps 1000 \
--logging_steps 20 \
--learning_rate 0.00001 \
--top_n_for_eval 10 \
--encoder_path ./PLM/bert-base-uncased/
python infer.py \
--output_dir ./ckpt \
--encoder_path ./ckpt/encoder/deberta-large \
--dataloader_pin_memory False \
--ckpt_for_test ./ckpt/retriever/deberta/epoch1_step30000.pt \
--test_path ./data/MultiHiertt/test.json \
--test_out_path ./prediction.json \
--top_n_for_test 10
from TableQAKit.retriever import RetrieverTrainer as RT
class NewTrainer(RT):
def read_data(self, data_path: str) -> List[Dict]:
"""
:param data_path: The path of data
:return: List of raw data
[
data_1,
data_2,
……
]
"""
data = json.load(
open(data_path, 'r', encoding='utf-8')
)
return data
def data_proc(self, instance) -> Dict:
"""
:return:
{
"id": str,
"question": str,
"rows": list[str],
"labels": list[int]
}
"""
rows = instance["paragraphs"]
labels = [0] * len(instance["paragraphs"])
if len(instance["qa"]["text_evidence"]):
for text_evidence in instance["qa"]["text_evidence"]:
labels[text_evidence] = 1
for k, v in instance["table_description"].items():
rows.append(v)
labels.append(1 if k in instance["qa"]["table_evidence"] else 0)
return {
"id": instance["uid"],
"question": instance["qa"]["question"],
"rows": rows,
"labels": labels
}
Check hear for more details.
Check hear for more details.
Check hear for more details.
Check hear for more details.
TableQAEval is a benchmark to evaluate the performance of LLM for TableQA. It evaluates LLM's modeling ability of long tables (context) and comprehension capabilities (numerical reasoning, multi-hop reasoning).
Model | Parameters | Numerical Reasoning | Multi-hop Reasoning | Structured Reasoning | Total |
---|---|---|---|---|---|
Turbo-16k-0613 | - | 20.3 | 52.8 | 54.3 | 43.5 |
LLaMA2-7b-chat | 7B | 2.0 | 14.2 | 13.4 | 12.6 |
ChatGLM2-6b-8k | 6B | 1.4 | 10.1 | 11.5 | 10.2 |
LLaMA2-7b-4k | 7B | 0.8 | 9.2 | 5.4 | 6.6 |
longchat-7b-16k | 7B | 0.3 | 7.1 | 5.1 | 5.2 |
LLaMA-7b-2k | 7B | 0.5 | 7.3 | 4.1 | 4.5 |
MPT-7b-65k | 7B | 0.3 | 3.2 | 2.0 | 2.3 |
LongLLaMA-3b | 3B | 0.0 | 4.3 | 1.7 | 2.0 |
More details are shown in TableQAEval.
We will continue to optimize the toolkit.
Primary contributors: Fangyu Lei, Tongxu Luo, Pengqi Yang, Weihao Liu, Hanwen Liu, Jiahe Lei, Yifan Wei, Shizhu He and Kang Liu.
Thank you very much to Yilun Zhao(Yale University)and Yongwei Zhou (HIT) for their assistance.